On the Rényi index of random graphs
From MaRDI portal
Publication:6579397
Recommendations
Cites work
- A survey of statistical network models
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Community detection and stochastic block models: recent developments
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs
- Generating simple random graphs with prescribed degree distribution
- Hypothesis testing for automated community detection in networks
- Information Limits for Detecting a Subhypergraph
- Large cliques in a power-law random graph
- Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
- Maximum likelihood estimation in the \(\beta\)-model
- Number of cliques in random scale-free network ensembles
- Power-law distributions in empirical data
- Pseudo-likelihood methods for community detection in large sparse networks
- Randomness, evenness, and Rényi's index
- Sharp detection boundaries on testing dense subhypergraph
- Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős-Rényi random graphs
- Statistical Physics of Particles
- The Structure and Function of Complex Networks
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)