Phase Transitions for Random Geometric Preferential Attachment Graphs
نویسندگان
چکیده
منابع مشابه
Phase Transitions for Random Geometric Preferential Attachment Graphs
Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the resulting graph as the relative strengths of these two components of the attachment rule are varied. Previous work of one of the authors showed that when the geometric component is weak, the limiting ...
متن کامل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...
متن کاملSublinear Random Access Generators for Preferential Attachment Graphs
We consider the problem of sampling from a distribution on graphs, specifically when the distribution is defined by an evolving graph model, and consider the time, space and randomness complexities of such samplers. In the standard approach, the whole graph is chosen randomly according to the randomized evolving process, stored in full, and then queries on the sampled graph are answered by simp...
متن کامل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 ...
متن کاملPreferential Attachment Random Graphs with General Weight Function
Consider a network of sites growing over time such that at step n a newcomer chooses a vertex from the existing vertices with probability proportional to a function of the degree of that vertex, i.e., the number of other vertices that this vertex is connected to. This is called a preferential attachment random graph. The objects of interest are the growth rates for the growth of the degree for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2015
ISSN: 0001-8678,1475-6064
DOI: 10.1239/aap/1435236988