Number of edges in inhomogeneous random graphs
From MaRDI portal
Publication:2037546
DOI10.1007/s11425-018-9549-8zbMath1467.05245OpenAlexW3016926105MaRDI QIDQ2037546
Publication date: 8 July 2021
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-018-9549-8
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Novel scaling limits for critical inhomogeneous random graphs
- Generating simple random graphs with prescribed degree distribution
- Universality for the distance in finite variance random graphs
- Limit laws in the generalized random graphs with random vertex weights
- Random Graphs and Complex Networks
- Critical behavior in inhomogeneous random graphs
- Large Cliques in a Power-Law Random Graph
- A new approach to the giant component problem
- The Average Distance in a Random Graph with Given Expected Degrees
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process