On a random graph evolving by degrees

DOI10.1016/j.aim.2009.08.015zbMath1203.05140OpenAlexW2013294371MaRDI QIDQ1047669

Boris G. Pittel

Publication date: 5 January 2010

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2009.08.015

zbMATH Keywords

Random graphPhase transitionGiant componentPreferential attachmentRandom multigraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

On edge exchangeable random graphs, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, On Bollobás‐Riordan random pairing model of preferential attachment graph, Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model, Limits of randomly grown graph sequences, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Preferential attachment without vertex growth: emergence of the giant component, Limits of sparse configuration models and beyond: graphexes and multigraphexes, 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
• Edge percolation on a random regular graph of low degree
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• The asymptotic number of labeled graphs with given degree sequences
• Renormalization group analysis of the small-world network model
• Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel
• The diameter of a scale-free random graph
• Differential equations for random processes and random graphs
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• The degree sequence of a scale-free random graph process
• Critical percolation on random regular graphs
• Emergence of Scaling in Random Networks
• The number of connected sparsely edged graphs. III. Asymptotic results
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• On the number of sparse connected graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Note on the heights of random recursive trees and random m‐ary search trees
• The Structure of a Random Graph at the Point of the Phase Transition
• On a random graph with immigrating vertices: Emergence of the giant component
• On the structure of random plane‐oriented recursive trees and their branches
• A critical point for random graphs with a given degree sequence
• A Graph-Valued Markov Process as Rings-Allowed Polymerization Model: Subcritical Behavior
• Paths in graphs
• A general model of web graphs
• The birth of the giant component
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Collective dynamics of ‘small-world’ networks
• Stable husbands