Preferential attachment processes approaching the Rado multigraph

DOI10.26493/2590-9770.1297.F97MaRDI QIDQ5045256zbMATH OpenOpenAlexFDO

Authors Richard Elwes

Publication date 4 November 2022

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsmultigraphspreferential attachmentRado graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Abstract: We consider a preferential attachment process in which a multigraph is built one node at a time. The number of edges added at stage $t$, emanating from the new node, is given by some prescribed function $f(t)$, generalising a model considered by Kleinberg and Kleinberg in 2005 where $f$ was presumed constant. We show that if $f(t)$ is asymptotically bounded above and below by linear functions in $t$, then with probability $1$ the infinite limit of the process will be isomorphic to the emph{Rado multigraph}. This structure is the natural multigraph analogue of the Rado graph, which we introduce here.

Recommendations

• A preferential attachment process approaching the Rado graph
• Isomorphism and embedding problems for infinite limits of scale-free graphs
• Multigraph limit of the dense configuration model and the preferential attachment graph
• Growth of preferential attachment random graphs via continuous-time branching processes
• Asymptotic degree distribution in preferential attachment graph models with multiple type edges

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 1425669 (Why is no real title available?)
• A preferential attachment process approaching the Rado graph
• Connectivity Transitions in Networks with Super-Linear Preferential Attachment
• Emergence of Scaling in Random Networks
• Evolving Shelah‐Spencer graphs
• Functions of a Complex Variable: Theory and Technique
• Infinite Limits and Adjacency Properties of a Generalized Copying Model
• Isomorphism and embedding problems for infinite limits of scale-free graphs
• Large networks and graph limits
• Multigraph limits, unbounded kernels, and Banach space decorated graphs
• Probability with Martingales
• Random graphs.
• The random graph
• The strange logic of random graphs

Cited in

(4)

• On the dense preferential attachment graph models and their graphon induced counterpart
• A preferential attachment process approaching the Rado graph
• Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
• Evolving Shelah‐Spencer graphs

This page was built for publication: Preferential attachment processes approaching the Rado multigraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045256)