On the Rényi index of random graphs
From MaRDI portal
Publication:6579397
DOI10.1007/s00362-023-01463-8zbMath1546.05136MaRDI QIDQ6579397
Publication date: 25 July 2024
Published in: Statistical Papers (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80)
Cites Work
- Pseudo-likelihood methods for community detection in large sparse networks
- Maximum likelihood estimation in the \(\beta\)-model
- Randomness, evenness, and Rényi's index
- Generating simple random graphs with prescribed degree distribution
- Number of cliques in random scale-free network ensembles
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs
- Sharp detection boundaries on testing dense subhypergraph
- Large Cliques in a Power-Law Random Graph
- Power-Law Distributions in Empirical Data
- The Structure and Function of Complex Networks
- Community Detection and Stochastic Block Models
- A Survey of Statistical Network Models
- Statistical Physics of Particles
- Hypothesis Testing for Automated Community Detection in Networks
- Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs
- Information Limits for Detecting a Subhypergraph
This page was built for publication: On the Rényi index of random graphs
