Related papers: Directed preferential attachment models
A network growth mechanism based on a two-step preferential rule is investigated as a model of network growth in which no global knowledge of the network is required. In the first filtering step a subset of fixed size $m$ of existing nodes…
Preferential attachment is widely used to model power-law behavior of degree distributions in both directed and undirected networks. In a directed preferential attachment model, despite the well-known marginal power-law degree…
The analysis in this paper helps to explain the formation of growing networks with degree distributions that follow extended exponential or power-law tails. We present a generic model in which edge dynamics are driven by a continuous…
Identifying the generating mechanism of a network is challenging as, more often than not, only snapshots are available, but not the full evolution. One candidate for the generating mechanism is preferential attachment which, in its simplest…
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…
Preferential attachment in a directed scale-free graph is widely used to model the evolution of social networks. Statistical analyses of social networks often relies on node based data rather than conventional repeated sampling. For our…
We obtain closed form expressions for the expected conditional degree distribution and the joint degree distribution of the linear preferential attachment model for network growth in the steady state. We consider the multiple-destination…
We study the growth of a directed network, in which the growth is constrained by the cost of adding links to the existing nodes. We propose a new preferential-attachment scheme, in which a new node attaches to an existing node i with…
Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…
Motivated by the complexity of network data, we propose a directed hybrid random network that mixes preferential attachment (PA) rules with uniform attachment (UA) rules. When a new edge is created, with probability $p\in [0,1]$, it follows…
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…
We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…
We propose a preferential attachment model for network growth where new entering nodes have a partial information about the state of the network. Our main result is that the presence of bounded information modifies the degree distribution…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
Reciprocity characterizes the information exchange between users in a network, and some empirical studies have revealed that social networks have a high proportion of reciprocal edges. Classical directed preferential attachment (PA) models,…
For the directed edge preferential attachment network growth model studied by Bollobas et al. (2003) and Krapivsky and Redner (2001), we prove that the joint distribution of in-degree and out-degree has jointly regularly varying tails.…
We present exact results for the degree distribution in a directed network model that grows by node duplication (ND). Such models are useful in the study of the structure and growth dynamics of gene regulatory networks and scientific…
When modeling a directed social network, one choice is to use the traditional preferential attachment model, which generates power-law tail distributions. In a traditional directed preferential attachment, every new edge is added…
In this paper, we study some important statistics of the random graph in the directed preferential attachment model introduced by B. Bollob\'as, C. Borgs, J. Chayes and O. Riordan. First, we find a new asymptotic formula for the expectation…
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we…