Limit laws for the number of triangles in the generalized random graphs with random node weights

DOI10.1016/j.spl.2020.108733OpenAlexW3006443489MaRDI QIDQ2307413

Qun Liu, Zhi Shan Dong

Publication date: 27 March 2020

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2020.108733

zbMATH Keywords

random graphsnumber of trianglesgeneralized random graphsrandom node weights

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20)

Related Items (2)

Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph ⋮ Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs

Cites Work

• Unnamed Item
• Large deviation principles for empirical measures of colored random graphs
• The large deviation principle for the Erdős-Rényi random graph
• Generating simple random graphs with prescribed degree distribution
• Upper tails for subgraph counts in random graphs
• Nonlinear large deviations
• Random Graphs and Complex Networks
• Upper tails for triangles
• Divide and conquer martingales and the number of triangles in a random graph
• The phase transition in inhomogeneous random graphs
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process

This page was built for publication: Limit laws for the number of triangles in the generalized random graphs with random node weights