相关论文: Preferential attachment mechanism of complex netwo…

We propose a simple preferential attachment model of growing network using the complementary probability of Barab\'asi-Albert (BA) model, i.e., $\Pi(k_i) \propto 1-\frac{k_i}{\sum_j k_j}$. In this network, new nodes are preferentially…

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…

Several growth models have been proposed in the literature for scale-free complex networks, with a range of fitness-based attachment models gaining prominence recently. However, the processes by which such fitness-based attachment behaviour…

Under preferential attachment (PA) network growth models late arrivals are at a disadvantage with regard to their final degrees. Previous extensions of PA have addressed this deficiency by either adding the notion of node fitness to PA,…

Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like Trophic Analysis and non-normality. We propose a simple growing network model where the…

Many real-world systems are profitably described as complex networks that grow over time. Preferential attachment and node fitness are two simple growth mechanisms that not only explain certain structural properties commonly observed in…

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…

Preferential attachment models form a popular class of growing networks, where incoming vertices are preferably connected to vertices with high degree. We consider a variant of this process, where vertices are equipped with a random initial…

A new mechanism leading to scale-free networks is proposed in this letter. It is shown that in many cases of interest, the connectivity power-law behavior is neither related to dynamical properties nor to preferential attachment. Instead,…

The principle that 'the brand effect is attractive' underlies preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly develop a general framework…

Preferential attachment models were shown to be very effective in predicting such important properties of real-world networks as the power-law degree distribution, small diameter, etc. Many different models are based on the idea of…

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…

In this paper, we provide a rigorous analysis of preferential attachment with fitness, a random graph model introduced by Bianconi and Barabasi. Depending on the shape of the fitness distribution, we observe three distinct phases: a…

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…

We extend the work of Antunovi\'{c}, Mossel and R\'{a}cz on competing types in preferential attachment models to include cases where the types have different fitnesses, which may be either multiplicative or additive. We will show that,…

Three models of growing random networks with fitness dependent growth rates are analysed using the rate equations for the distribution of their connectivities. In the first model (A), a network is built by connecting incoming nodes to nodes…

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…

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…

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…

Growing network models with preferential attachment dependent on both age and degree are proposed to simulate certain features of citation network noted in \cite{red2}. In this directed network, a new node gets attached to an older node…