# Modularity and edge sampling

@article{McDiarmid2021ModularityAE, title={Modularity and edge sampling}, author={Colin McDiarmid and Fiona Skerman}, journal={ArXiv}, year={2021}, volume={abs/2112.13190} }

Suppose that there is an unknown underlying graph G on a large vertex set, and we can test only a proportion of the possible edges to check whether they are present in G. If G has high modularity, is the observed graph G′ likely to have high modularity? We see that this is indeed the case under a mild condition, in a natural model where we test edges at random. We find that q∗(G′) ≥ q∗(G) − ε with probability at least 1 − ε, as long as the expected number edges in G′ is large enough. Similarly…

## Figures from this paper

## References

SHOWING 1-10 OF 17 REFERENCES

Modularity of Erdös-Rényi Random Graphs

- MathematicsAofA
- 2018

It is shown that whp q^*(G_{n,p}) has order (np)^{-1/2}, in accord with a conjecture by Reichardt and Bornholdt in 2006 (and disproving another conjecture from the physics literature).

Modularity of regular and treelike graphs

- Mathematics, Computer ScienceJ. Complex Networks
- 2018

This work sees that for random cubic graphs the 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/\sqrt{r}$.

Spectral graph theory

- MathematicsZeta and 𝐿-functions in Number Theory and Combinatorics
- 2019

With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shall…

On Modularity Clustering

- Computer ScienceIEEE Transactions on Knowledge and Data Engineering
- 2008

The conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts is proved and an Integer Linear Programming formulation is given.

Finding Community Structure with Performance Guarantees in Scale-Free Networks

- Computer Science2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing
- 2011

It is shown, using analytical arguments, that the power-law topology indicates the presence of community structure, and an approximation algorithm for finding community structure via maximizing the modularity that guarantees optimal solutions up to a constant factor is provided.

Large Networks and Graph Limits

- Mathematics

The book Large Networks and Graph Limits, xiv + 475 pp., published in late 2012, comprises five parts, the first an illuminating introduction and the last a tantalizing taste of how the scope of the…

Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing

- Mathematics
- 2007

Limits of modularity maximization in community detection

- MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2011

It is shown that multiresolution modularity is not capable to recover the planted community structure, not even when it is pronounced and easily detectable by other methods, for any value of the resolution parameter.

Finding and evaluating community structure in networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2004

It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.