A random graph of moderate density
From MaRDI portal
Publication:2078117
DOI10.1214/21-ECP444zbMath1483.05152OpenAlexW4210276084MaRDI QIDQ2078117
Tamás F. Móri, Agnes Backhausz
Publication date: 25 February 2022
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/21-ecp444
Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hoeffding's inequality for supermartingales
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Random Graphs and Complex Networks
- Degree distribution in the lower levels of the uniform recursive tree
- Emergence of Scaling in Random Networks
- Note on the heights of random recursive trees and random m‐ary search trees
- Convergence of graphs with intermediate density
- The Maximum Degree of the Barabási–Albert Random Tree
- Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model
- Action convergence of operators and graphs
- Adversarial Deletion in a Scale-Free Random Graph Process
This page was built for publication: A random graph of moderate density