2000 character limit reached
Modularity and Graph Expansion (2312.07521v1)
Published 12 Dec 2023 in math.CO
Abstract: We relate two important notions in graph theory: expanders which are highly connected graphs, and modularity a parameter of a graph that is primarily used in community detection. More precisely, we show that a graph having modularity bounded below 1 is equivalent to it having a large subgraph which is an expander. We further show that a connected component $H$ will be split in an optimal partition of the host graph $G$ if and only if the relative size of $H$ in $G$ is greater than an expansion constant of $H$. This is a further exploration of the resolution limit known for modularity, and indeed recovers the bound that a connected component $H$ in the host graph~$G$ will not be split if~$e(H)<\sqrt{2e(G)}$.
- Deterministic simulation in logspace. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC ’87, page 132–140, New York, NY, USA, 1987. Association for Computing Machinery.
- N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83–96, 1986. Theory of computing (Singer Island, Fla., 1984).
- P. J. Bickel and A. Chen. A nonparametric view of network models and newman–girvan and other modularities. Proceedings of the National Academy of Sciences, 106(50):21068–21073, 2009.
- Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 10, 2008.
- Spectral properties of modularity matrices. Linear Algebra and Its Applications, 473:359–376, 2015.
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. European Journal of Combinatorics, 31(5):1217–1227, 2010.
- On modularity clustering. Knowledge and Data Engineering, IEEE Transactions on, 20(2):172–188, 2008.
- Well-mixing vertices and almost expanders. Proceedings of the American Mathematical Society, 2022.
- J. Cheeger. A lower bound for the smallest eigenvalue of the laplacian. In Proceedings of the Princeton conference in honor of Professor S. Bochner, pages 195–199, 1969.
- F. Chung. Spectral graph theory, volume 92. American Mathematical Soc. Providence, RI, 1997.
- On the power of louvain in the stochastic block model. Advances in Neural Information Processing Systems, 33, 2020.
- E. Davis and S. Sethuraman. Consistency of modularity clustering on random geometric graphs. Annals of Applied Probability, 28(4):2003–2062, 2018.
- D. Fasino and F. Tudisco. An algebraic analysis of the graph modularity. SIAM Journal on Matrix Analysis and Applications, 35(3):997–1018, 2014.
- S. Fortunato. Community detection in graphs. Phys. Rep., 486(3-5):75–174, 2010.
- S. Fortunato and M. Barthélemy. Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1):36–41, 2007.
- D. Gillman. A Chernoff bound for random walks on expander graphs. SIAM J. Comput., 27(4):1203–1220, 1998.
- Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.), 43(4):439–561, 2006.
- Isoperimetric problems for convex bodies and a localization lemma. Discrete & Computational Geometry, 13(3):541–559, 1995.
- On clusterings: good, bad and spectral. J. ACM, 51(3):497–515, 2004.
- M. Koshelev. Modularity in planted partition model. Computational Management Science, 20(1):34, 2023.
- M. Krivelevich. Finding and using expanders in locally sparse graphs. SIAM J. Discrete Math., 32(1):611–623, 2018.
- M. Krivelevich. Expanders—how to find them, and what to find in them. Surveys in Combinatorics, pages 115–142, 2019.
- A. Lancichinetti and S. Fortunato. Limits of modularity maximization in community detection. Physical Review E, 84(6):066122, 2011.
- M. Lasoń and M. Sulkowska. Modularity of minor-free graphs. Journal of Graph Theory, 2022.
- L. Lichev and D. Mitsche. On the modularity of 3‐regular random graphs and random graphs with given degree sequences. Random Structures & Algorithms, 61(4):754–802, 2022.
- B. Louf and F. Skerman. Finding large expanders in graphs: from topological minors to induced subgraphs. Electronic Journal of Combinatorics, 30(1), 2023.
- S. Majstorovic and D. Stevanovic. A note on graphs whose largest eigenvalues of the modularity matrix equals zero. Electronic Journal of Linear Algebra, 27(1):256, 2014.
- C. McDiarmid and F. Skerman. Modularity of regular and treelike graphs. Journal of Complex Networks, 6(4), 2018.
- C. McDiarmid and F. Skerman. Modularity of Erdős-Rényi random graphs. Random Structures & Algorithms, 57(1):211–243, 2020.
- C. McDiarmid and F. Skerman. Modularity of nearly complete graphs and bipartite graphs. arXiv preprint arXiv:2311.06875, 2023.
- K. Meeks and F. Skerman. The parameterised complexity of computing the maximum modularity of a graph. Algorithmica, 82(8):2174–2199, 2020.
- Asymptotic modularity of some graph classes. In Algorithms and Computation, pages 435–444. Springer, 2011.
- M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(2):026113, 2004.
- Communities in networks. Notices Amer. Math. Soc., 56(9):1082–1097, 2009.
- Modularity in several random graph models. Electronic Notes in Discrete Mathematics, 61:947–953, 2017.
- From louvain to leiden: guaranteeing well-connected communities. Scientific reports, 9(1):5233, 2019.
- Spectral graph analysis of modularity and assortativity. Physical Review E, 82(5):056113, 2010.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.