A preferential attachment model with random initial degrees

DOI10.1007/s11512-007-0067-4zbMath1182.05107arXiv0705.4151OpenAlexW3102281103MaRDI QIDQ841212

Henri Van Den Esker, Maria Deijfen, Remco van der Hofstad, Gerard Hooghiemstra

Publication date: 14 September 2009

Published in: Arkiv för Matematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0705.4151

zbMATH Keywords

degree sequencerandom graph process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Scale-free property for degrees and weights in an \(N\)-interactions random graph model, Scale-free behavior of networks with the copresence of preferential and uniform attachment rules, From trees to graphs: collapsing continuous-time branching processes, Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms, On the asymptotic normality of estimating the affine preferential attachment network models with random initial degrees, On the continuous-time limit of the Barabási-Albert random graph, The dynamics of power laws: fitness and aging in preferential attachment trees, Uniform preferential selection model for generating scale-free networks, Weights and degrees in a random graph model based on 3-interactions, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Justifying the small-world phenomenon via random recursive trees, First passage percolation on random graphs with finite mean degrees, Pólya urns with immigration at random times, Preferential attachment random graphs with edge-step functions, How rare are power-law networks really?, Small subgraphs in preferential attachment networks, Degree sequences of geometric preferential attachment graphs, Robust Analysis of Preferential Attachment Models with Fitness, Diameters in preferential attachment models, Scalable and exact sampling method for probabilistic generative graph models, A phase transition for preferential attachment models with additive fitness, Geometry of weighted recursive and affine preferential attachment trees, Inference for the degree distributions of preferential attachment networks with zero-degree nodes, Birds of a feather or opposites attract - effects in network modelling, Unnamed Item, RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING, Studies on generalized Yule models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of the degree distribution of some growing network models
• Generating simple random graphs with prescribed degree distribution
• Diameters in preferential attachment models
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Connected components in random graphs with given expected degree sequences
• A phase transition in the random transposition random walk
• A new class of scale free random graphs
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• The degree sequences and spectra of scale-free random graphs
• Order of Magnitude of Moments of Sums of Random Variables
• The Structure and Function of Complex Networks
• Concentration of vertex degrees in a scale‐free random graph process
• Probability: A Graduate Course
• Robustness and Vulnerability of Scale-Free Random Graphs
• A general model of web graphs
• The phase transition in inhomogeneous random graphs
• The average distances in random graphs with given expected degrees
• Moment Convergence of Sample Extremes
• Growing random networks with fitness