相关论文: Modelling Aging Characteristics in Citation Networ…

Citation networks emerge from a number of different social systems, such as academia (from published papers), business (through patents) and law (through legal judgements). A citation represents a transfer of information, and so studying…

We provide a general framework to model the growth of networks consisting of different coupled layers. Our aim is to estimate the impact of one such layer on the dynamics of the others. As an application, we study a scientometric network,…

We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…

We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barab\'{a}si and Albert in the particular case of growing networks. The networks considered here evolve…

We perform experimental verification of the preferential attachment model that is commonly accepted as a generating mechanism of the scale-free complex networks. To this end we chose citation network of Physics papers and traced citation…

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…

Generalized preferential attachment is defined as the tendency of a vertex to acquire new links in the future with respect to a particular vertex property. Understanding which properties influence link acquisition tendency (LAT) gives us a…

We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…

In this paper we present the application of a novel methodology to scientific citation and collaboration networks. This methodology is designed for understanding the governing dynamics of evolving networks and relies on an attachment…

Many real-world complex networks arise as a result of a competition between growth and rewiring processes. Usually the initial part of the evolution is dominated by growth while the later one rather by rewiring. The initial growth allows…

A solution for the time- and age-dependent connectivity distribution of a growing random network is presented. The network is built by adding sites which link to earlier sites with a probability A_k which depends on the number of…

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…

There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…

In many real world networks, the number of links increases nonlinearly with the number of nodes. Models of such accelerated growth have been considered earlier with deterministic and stochastic number of links. Here we consider stochastic…

We propose a model of the evolution of the networks of scientific citations. The model takes an out-degree distribution (distribution of number of citations) and two parameters as input. The parameters capture the two main ingredients of…

The directed preferential attachment model is revisited. A new exact characterization of the limiting in- and out-degree distribution is given by two \emph{independent} pure birth processes that are observed at a common exponentially…

This paper presents an approach to the modeling of degree-degree correlation in complex networks. Thus, a simple function, \Delta(k', k), describing specific degree-to- degree correlations is considered. The function is well suited to…

A preferential attachment model for a growing network incorporating deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step $t=1,2,\ldots$, with probability $\pi_1>0$ a new vertex with one…

Based on the empirical analysis of the dependency network in 18 Java projects, we develop a novel model of network growth which considers both: an attachment mechanism and the addition of new nodes with a heterogeneous distribution of their…

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…