相关论文: The Buckley-Osthus model and the block preferentia…

There has been a lot of research on random graph models for large real-world networks such as those formed by hyperlinks between web pages in the world wide web. Though largely successful qualitatively in capturing their key properties,…

Preferential attachment is an appealing mechanism for modeling power-law behavior of the degree distributions in directed social networks. In this paper, we consider methods for fitting a 5-parameter linear preferential model to network…

In real life, networks are dynamic in nature; they grow over time and often exhibit power-law degree sequences. To model the evolving structure of the internet, Barab\'{a}si and Albert introduced a simple dynamic model with a power-law…

The preferential attachment (PA) model is a popular way of modeling dynamic social networks, such as collaboration networks. Assuming that the PA function takes a parametric form, we propose and study the maximum likelihood estimator of the…

In this article we presented a brief study of the main network models with growth and preferential attachment. Such models are interesting because they present several characteristics of real systems. We started with the classical model…

We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses…

Preferential attachment probabilities scheme appear in the context of scale free random graphs [1],[2]. In this work we present preferential attachment probabilities scheme as a sequence of dependent Bernoulli random variables and we give…

Preferential attachment is often suggested to be the underlying mechanism of the growth of a network, largely due to that many real networks are, to a certain extent, scale-free. However, such attribution is usually made under debatable…

We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible…

Our work introduces an approach for estimating the contribution of attachment mechanisms to the formation of growing networks. We present a generic model in which growth is driven by the continuous attachment of new nodes according to…

A statistical model assuming a preferential attachment network, which is generated by adding nodes sequentially according to a few simple rules, usually describes real-life networks better than a model assuming, for example, a Bernoulli…

We introduce a network growth model in which the preferential attachment probability includes the fitness vertex and the Euclidean distance between nodes. We grow a planar network around its barycenter. Each new site is fixed in space by…

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

We perform an empirical study of the preferential attachment phenomenon in temporal networks and show that on the Web, networks follow a nonlinear preferential attachment model in which the exponent depends on the type of network…

In this paper we consider a well-known generalization of the Barab\'asi and Albert preferential attachment model - the Buckley-Osthus model. Buckley and Osthus proved that in this model the degree sequence has a power law distribution. As a…

In this paper we define a family of preferential attachment models for random graphs with fitness in the following way: independently for each node, at each time step a random fitness is drawn according to the position of a moving average…

Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to…

Many important real-world networks manifest "small-world" properties such as scale-free degree distributions, small diameters, and clustering. The most common model of growth for these networks is "preferential attachment", where nodes…

We introduce a new type of preferential attachment tree that includes choices in its evolution, like with Achlioptas processes. At each step in the growth of the graph, a new vertex is introduced. Two possible neighbor vertices are selected…

This paper analyzes key properties of networks generated by geometric preferential attachment. We establish that the expected number of triangles is proportional to that of the standard preferential attachment model, with a proportionality…