On the Rényi index of random graphs
From MaRDI portal
Publication:6579397
DOI10.1007/S00362-023-01463-8zbMATH Open1546.05136MaRDI QIDQ6579397FDOQ6579397
Authors: Mingao Yuan 
Publication date: 25 July 2024
Published in: Statistical Papers (Search for Journal in Brave)
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80)
Cites Work
- Power-law distributions in empirical data
- Pseudo-likelihood methods for community detection in large sparse networks
- A survey of statistical network models
- The Structure and Function of Complex Networks
- Community detection and stochastic block models: recent developments
- Hypothesis Testing for Automated Community Detection in Networks
- Maximum likelihood estimation in the \(\beta\)-model
- Generating simple random graphs with prescribed degree distribution
- Randomness, evenness, and Rényi's index
- Statistical Physics of Particles
- Large cliques in a power-law random graph
- 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
- Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs
- Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős-Rényi random graphs
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Sharp detection boundaries on testing dense subhypergraph
- Information Limits for Detecting a Subhypergraph
Cited In (2)
This page was built for publication: On the Rényi index of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579397)
