Modularity and graph expansion
From MaRDI portal
Cites work
- A Chernoff Bound for Random Walks on Expander Graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- A note on graphs whose largest eigenvalues of the modularity matrix equals zero
- An algebraic analysis of the graph modularity
- Asymptotic modularity of some graph classes
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- Communities in Networks
- Consistency of modularity clustering on random geometric graphs
- Eigenvalues and expanders
- Expander graphs and their applications
- Expanders -- how to find them, and what to find in them
- Fast unfolding of communities in large networks
- Finding and using expanders in locally sparse graphs
- Finding large expanders in graphs: from topological minors to induced subgraphs
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Isoperimetric problems for convex bodies and a localization lemma
- Modularity in planted partition model
- Modularity in several random graph models
- Modularity of Erdős-Rényi random graphs
- Modularity of minor‐free graphs
- Modularity of regular and treelike graphs
- On clusterings: good, bad and spectral
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences
- Spectral properties of modularity matrices
- The parameterised complexity of computing the maximum modularity of a graph
- Well-mixing vertices and almost expanders
This page was built for publication: Modularity and graph expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906349)
