The degree sequence of a scale-free random graph process

DOI10.1002/rsa.1009zbMath0985.05047WikidataQ56170570 ScholiaQ56170570MaRDI QIDQ2725033

Béla Bollobás, Oliver Riordan, J. H. Spencer, Gábor Tusnády

Publication date: 13 May 2002

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.9280

zbMATH Keywords

degree distribution; random digraph process

Mathematics Subject Classification ID

60G42: Martingales with discrete parameter

05C80: Random graphs (graph-theoretic aspects)

05C07: Vertex degrees

Related Items

Scale‐free graphs of increasing degree, A Geometric Preferential Attachment Model of Networks II, Robustness of Preferential Attachment Under Deletion of Edges, CENTRALITY ESTIMATION IN LARGE NETWORKS, CENTRALITY ESTIMATION IN LARGE NETWORKS, On the mixing time of geographical threshold graphs, Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs, Fundamentals of Stein's method, Euler index in uncertain graph, On the degree evolution of a fixed vertex in some growing networks, Rumor spreading in social networks, Phase transition on the degree sequence of a random graph process with vertex copying and deletion, The clustering coefficient of a scale-free random graph, Random continuous model of scale-free networks, A preferential attachment model with Poisson growth for scale-free networks, Markov chain-based analysis of a modified Cooper-Frieze model, A preferential attachment model with random initial degrees, Branches in scale-free trees, Preferential deletion in dynamic models of web-like networks, Phase transitions in dynamical random graphs, On large deviation properties of Erdős-Rényi random graphs, The degree distribution of the generalized duplication model, The cover time of the preferential attachment graph, Growth of preferential attachment random graphs via continuous-time branching processes, Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing, Diameters in preferential attachment models, Dynamic random networks in dynamic populations, Coagulation-fragmentation duality, Poisson-Dirichlet distributions and random recursive trees, The degree sequences of an asymmetrical growing network, The degree distribution of random \(k\)-trees, On a random graph evolving by degrees, Degree distribution of a scale-free random graph model, Popularity based random graph models leading to a scale-free degree sequence, An algorithm generating random graphs with power law degree distributions, Power laws for family sizes in a duplication model, Synchronization in random networks with given expected degree sequences, On certain connectivity properties of the internet topology, Reconstruction of Kauffman networks applying trees, A new class of scale free random graphs, On the mean distance in scale free graphs, An estimate of the probability of localisation of the diameter of a random scale-free graph, How to distribute antidote to control epidemics, Random Networks with Preferential Growth and Vertex Death, Width of a scale-free tree, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, On the asymptotic behaviour of random recursive trees in random environments, Probabilistic Inductive Classes of Graphs, Characterization of Graphs Using Degree Cores, Degree sequences of geometric preferential attachment graphs, Small-world graphs: characterization and alternative constructions, Universality for distances in power-law random graphs, Large deviations for the leaves in some random trees

Cites Work