Modularity of networks

Fiona Skerman

Abstract:

Modularity is a quality function on partitions of a network which may be used to identify highly clustered components. It is commonly used to analyse large real networks, for example in social networks and protein discovery to find communities and related proteins respectively. Given a graph G, the modularity of a partition of the vertex set measures the extent to which edge density is higher within parts than between parts, and the maximum modularity q^*(G

Expand abstract

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Skerman, F. (2015). Modularity of networks [PhD thesis]. University of Oxford.

MLA Style

Skerman, Fiona. Modularity of Networks. University of Oxford, 2015.

Chicago Style

Skerman, Fiona. 2015. “Modularity of Networks.” PhD thesis, University of Oxford.
Tweet
Print

Access Document

Files:: SkermanThesisFinal2.pdf

(pdf, 2.9mb)

Authors

Fiona Skerman More by this author

Contributors

+ Colin McDiarmid

Role:

Supervisor

Bibliographic Details

Type of award:: DPhil
Level of award:: Doctoral
Awarding institution:: University of Oxford

Related Items

Has part:: Modularity of Erdös-Rényi graphs near criticality
Description:
Has part:: Modularity of lattices and well-embeddable graphs
Description:
Has part:: Modularity of treelike and random regular graphs
Description:: Clustering algorithms for large networks typically use modularity values to test which partitions better represent structure in the data. We establish baselines for statistical tests on regular graphs, by showing that: for random cubic graphs the (maximum) modularity is usually in the interval (0.666, 0.804), and for random r-regular graphs with large r it usually is of order 1/√r. The modularity of cycles and low degree trees is known to be close to 1: we extend this to ‘treelike’ graphs,...
Expand description
Collapse description
Has part:: Modularity in random regular graphs and lattices
Description:: Given a graph G, the modularity of a partition of the vertex set measures the extent to which edge density is higher within parts than between parts; and the modularity of G is the maximum modularity of a partition. We give an upper bound on the modularity of r-regular graphs as a function of the edge expansion (or isoperimetric number) under the restriction that each part in our partition has a sub-linear numbers of vertices. This leads to results for random r-regular graphs. In particula...
Expand description
Collapse description

Terms of use

License:: Terms and Conditions of Use for Oxford University Research Archive

Views & Downloads

Metrics

If you are the owner of this record, you can report an update to it here: Report update to this record