On the modularity of 3‐regular random graphs and random graphs with given degree sequences

DOI10.1002/rsa.21080zbMath1522.05434arXiv2007.15574MaRDI QIDQ6052476

Lyuben Lichev, Dieter Mitsche

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.15574

zbMATH Keywords

random regular graphs; modularity; random graphs with given degree sequence

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C07: Vertex degrees

05C22: Signed and weighted graphs

Related Items

Correcting for granularity bias in modularity-based community detection methods, Modularity of minor‐free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic distribution of short cycles in random regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Modularity in several random graph models
• Differential equations for random processes and random graphs
• Asymptotic Modularity of Some Graph Classes
• Modularity of regular and treelike graphs
• On Finding Graph Clusterings with Maximum Modularity
• Communities in Networks
• A critical point for random graphs with a given degree sequence
• The limit distributions of the maximum size of a tree in a random forest
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Modularity of Erdős‐Rényi random graphs
• Critical Window for Connectivity in the Configuration Model