相关论文: Competition-Induced Preferential Attachment

The parallel computational complexity or depth of growing network models is investigated. The networks considered are generated by preferential attachment rules where the probability of attaching a new node to an existing node is given by a…

One of the best-known models in network science is preferential attachment. In this model, the probability of attaching to a node depends on the degree of all nodes in the population, and thus depends on global information. In many…

Many networks generated by nature have two generic properties: they are formed in the process of {preferential attachment} and they are scale-free. Considering these features, by interfering with mechanism of the {preferential attachment},…

The degree distribution of many biological and technological networks has been described as a power-law distribution. While the degree distribution does not capture all aspects of a network, it has often been suggested that its functional…

In studying network growth, the conventional approach is to devise a growth mechanism, quantify the evolution of a statistic or distribution (such as the degree distribution), and then solve the equations in the steady state (the…

We propose a scale-free network model with a tunable power-law exponent. The Poisson growth model, as we call it, is an offshoot of the celebrated model of Barab\'{a}si and Albert where a network is generated iteratively from a small seed…

Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks are not drawn at random. Therefore, Brach, Cygan, {\L}acki,…

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…

Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…

In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $\alpha_1$, a new vertex $x_t$ and $m$ edges…

We study structural properties of trees grown by preferential attachment. In this mechanism, nodes are added sequentially and attached to existing nodes at a rate that is strictly proportional to the degree. We classify nodes by their depth…

For most networks, the connection between two nodes is the result of their mutual affinity and attachment. In this paper, we propose a mutual selection model to characterize the weighted networks. By introducing a general mechanism of…

The preferential attachment (PA) process is a popular theory for explaining network power-law degree distributions. In PA, the probability that a new vertex adds an edge to an existing vertex depends on the connectivity of the target…

Motivated by widely observed examples in nature, society and software, where groups of already related nodes arrive together and attach to an existing network, we consider network growth via sequential attachment of linked node groups, or…

In an affiliation network vertices are linked to attributes and two vertices are declared adjacent whenever they share a common attribute. For example, two customers of an internet shop are called adjacent if they have purchased the same or…

Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…

The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness…

Empirical evidence suggests that heavy-tailed degree distributions occurring in many real networks are well-approximated by power laws with exponents $\eta$ that may take values either less than and greater than two. Models based on various…

Simple growth mechanisms have been proposed to explain the emergence of seemingly universal network structures. The widely-studied model of preferential attachment assumes that new nodes are more likely to connect to highly connected nodes.…

Preferential attachment drives the evolution of many complex networks. Its analytical studies mostly consider the simplest case of a network that grows uniformly in time despite the accelerating growth of many real networks. Motivated by…