相关论文: Co-evolution of networks and quantum dynamics: a g…

We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…

We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…

In this paper we present a generalized model for network growth that links the microscopical agent strategies with the large scale behavior. This model is intended to reproduce the largest number of features of the Internet network at the…

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…

We consider a preferential attachment model that incorporates an anomaly. Our goal is to understand the evolution of the network before and after the occurrence of the anomaly by studying the influence of the anomaly on the structural…

Preferential attachment models have been widely studied in complex networks, because they can explain the formation of many networks like social networks, citation networks, power grids, and biological networks, to name a few. Motivated by…

In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…

Many real systems possess accelerating statistics where the total number of edges grows faster than the network size. In this paper, we propose a simple weighted network model with accelerating growth. We derive analytical expressions for…

We introduce a two-dimensional growth model where every new site is located, at a distance $r$ from the barycenter of the pre-existing graph, according to the probability law $1/r^{2+\alpha_G} (\alpha_G \ge 0)$, and is attached to (only)…

In the field of complex networks, hypergraph models have so far received significantly less attention than graphs. However, many real-life networks feature multiary relations (co-authorship, protein reactions) may therefore be modeled way…

A few of evolving models in hypernetworks have been proposed based on uniform growth. In order to better depict the growth mechanism and competitive aspect of real hypernetworks, we propose a model in term of the non-uniform growth. Besides…

In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barab\'asi-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our…

We study the growth of a reference network with aging of sites defined in the following way. Each new site of the network is connected to some old site with probability proportional (i) to the connectivity of the old site as in the…

We analyze Axelrod's model of social interactions on coevolving complex networks. We introduce four extensions with different mechanisms of edge rewiring. The models are intended to catch two kinds of interactions - preferential attachment,…

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…

The co-authorship network of scientists represents a prototype of complex evolving networks. By mapping the electronic database containing all relevant journals in mathematics and neuro-science for an eight-year period (1991-98), we infer…

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},…

We present analytical results for the emerging structure of networks that evolve via a combination of growth (by node addition and random attachment) and contraction (by random node deletion). To this end we consider a network model in…

We show that to explain the growth of the citation network by preferential attachment (PA), one has to accept that individual nodes exhibit heterogeneous fitness values that decay with time. While previous PA-based models assumed either…

We study the interplay between evolutionary game and network structure and show how the dynamics of the game affect the growth pattern of the network and how the evolution of the network influence the cooperative behavior in the game.…