Elwes, R orcid.org/0000-0002-6752-5501 (2022) Preferential attachment processes approaching the Rado multigraph. The Art of Discrete and Applied Mathematics, 5 (2). ISSN 2590-9770
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 Rado multigraph. This structure is the natural multigraph analogue of the Rado graph, which we introduce here.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: | |
Copyright, Publisher and Additional Information: | This item is protected by copyright. This is an open access article under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. |
Keywords: | Preferential attachment, random graphs, multigraphs, Rado graph |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Pure Mathematics (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 05 Jul 2021 09:51 |
Last Modified: | 06 Mar 2024 13:47 |
Status: | Published |
Publisher: | Slovenian Discrete and Applied Mathematics Society and the University of Primorska, FAMNIT. |
Identification Number: | 10.26493/2590-9770.1297.f97 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:175830 |