Preferential attachment processes approaching the Rado multigraph
نویسندگان
چکیده
We consider a preferential attachment process in which multigraph is built one node at time. The number of edges added stage t, emanating from the new node, given by some prescribed function f(t), generalising model considered Kleinberg and 2005 where f was presumed constant. show that if f(t) asymptotically bounded above below linear functions then with probability 1 infinite limit will be isomorphic to Rado multigraph. This structure natural analogue graph, we introduce here.
منابع مشابه
Preferential Attachment Processes Approaching The Rado Multigraph
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...
متن کاملThe preferential attachment model∗
Many empirically studied networks have approximately so-called power-law or scale-free degree distributions. In Section 1 we formally define such distributions and explore some of their properties. We also introduce and briefly compare two methods for constructing random networks with approximately power-law degree distributions: generic scale-free networks and the preferential attachment model...
متن کاملRandom Preferential Attachment Hypergraphs
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment evolution model than by the ordinary (uniform) evolution lodel. Analogously, this paper extends the random hypergraph model to a random preferential attachment ...
متن کاملCompetition-Induced Preferential Attachment
Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here, rather than assuming preferential attachment, we give an explanation of how it can arise from a more basic underlying mechanism of competition between opposing forces. We introduce a family of one-dimensional geometri...
متن کاملNongrowing Preferential Attachment Random Graphs
We consider an edge rewiring process which is widely used to model the dynamics of scale-free weblike networks. This process uses preferential attachment and operates on sparse multigraphs with n vertices and m edges. We prove that its mixing time is optimal and develop a framework which simplifies the calculation of graph properties in the steady state. The applicability of this framework is d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The art of discrete and applied mathematics
سال: 2021
ISSN: ['2590-9770']
DOI: https://doi.org/10.26493/2590-9770.1297.f97