On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
From MaRDI portal
Publication:2116270
DOI10.1016/j.physd.2020.132689OpenAlexW2991862449MaRDI QIDQ2116270
Laura Sacerdote, Federico Polito, Umberto De Ambroggio
Publication date: 16 March 2022
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.03846
Cites Work
- Unnamed Item
- On the degree evolution of a fixed vertex in some growing networks
- Phase transition on the degree sequence of a random graph process with vertex copying and deletion
- Markov chain-based analysis of the degree distribution for a growing network
- Dynamic random networks in dynamic populations
- Random networks with sublinear preferential attachment: degree evolutions
- Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
- Random networks with sublinear preferential attachment: the giant component
- On a preferential attachment and generalized Pólya's urn model
- On the growth of a superlinear preferential attachment scheme
- The asymptotic expansion of a ratio of gamma functions
- The degree sequence of a scale-free random graph process
- Random Graphs and Complex Networks
- Emergence of Scaling in Random Networks
- A Dynamic Network in a Dynamic Population: Asymptotic Properties
- The role of detachment of in-links in scale-free networks
- On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon
- Random mappings with exchangeable in-degrees
- The Structure and Function of Complex Networks
- Random Deletion in a Scale-Free Random Graph Process
- A general model of web graphs
- Fluctuations in a general preferential attachment model via Stein's method
- Robustness of Preferential Attachment Under Deletion of Edges
- Preferential Attachment Random Graphs with General Weight Function
