Preferential attachment without vertex growth: emergence of the giant component
From MaRDI portal
Publication:2240859
DOI10.1214/20-AAP1610zbMath1477.05171arXiv1904.11861MaRDI QIDQ2240859
Publication date: 4 November 2021
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.11861
Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)
Related Items
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, Distance evolutions in growing preferential attachment graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multigraph limit of the dense configuration model and the preferential attachment graph
- Achlioptas process phase transitions are continuous
- Critical window for the configuration model: finite third moment degrees
- Hypercube percolation
- Susceptibility of random graphs with given vertex degrees
- Limits of randomly grown graph sequences
- Limit theorems for triangular urn schemes
- Handbook of large-scale random networks
- Birth control for giants
- On percolation in random graphs with given vertex degrees
- On a random graph evolving by degrees
- Principles of statistical mechanics of uncorrelated random networks
- On edge exchangeable random graphs
- On the critical probability in percolation
- Sandwiching random graphs: universality between random graph models
- Differential equations for random processes and random graphs
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- The degree sequence of a scale-free random graph process
- Random Graphs and Complex Networks
- The Phase Transition in the Configuration Model
- Nongrowing Preferential Attachment Random Graphs
- Introduction to Random Graphs
- Critical percolation on random regular graphs
- Emergence of Scaling in Random Networks
- Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
- The evolution of subcritical Achlioptas processes
- A simple solution to the k‐core problem
- A new approach to the giant component problem
- A unified approach to limit theorems for urn models
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- Random Graph Processes with Degree Restrictions
- Generating Random Regular Graphs Quickly
- Slightly subcritical hypercube percolation
- Component structure of the configuration model: Barely supercritical case
- The Phase Transition in the Erdős-Rényi Random Graph Process
- Percolation on Sparse Random Graphs with Given Degree Sequence
- Generating random regular graphs
