相关论文: A weighted evolving network model more approach to…

We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the…

We study a novel model for evolution of complex networks. We introduce information filtering for reduction of the number of available nodes to a randomly chosen sample, as stochastic component of evolution. New nodes are attached to the…

We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by…

We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative…

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…

The degree distributions of many real world networks follow power-laws whose exponents tend to fall between two and three. Within the framework of the Barabasi-Albert model (BA model), we explain this empirical observation by a simple fact.…

Recently several authors have proposed stochastic evolutionary models for the growth of complex networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the ``rich get…

Consensus about the universality of the power law feature in complex networks is experiencing profound challenges. To shine fresh light on this controversy, we propose a generic theoretical framework in order to examine the power law…

Research in network science has shown that many naturally occurring and technologically constructed networks are scale free, that means a power law degree distribution emerges from a growth model in which each new node attaches to the…

Recently several authors have proposed stochastic evolutionary models for the growth of complex networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the ``rich get…

We introduce a new mechanism of connectivity evolution in networks to account for the emergence of scale-free behavior. The mechanism works on a fixed set of nodes and promotes growth from a minimally connected initial topology by the…

Recently, we introduced a quantity, "node weight", to describe the collaboration sharing or competition gain of the elements in the collaboration-competition networks, which can be well described by bipartite graphs. We find that the node…

The configuration model is one of the most successful models for generating uncorrelated random networks. We analyze its behavior when the expected degree sequence follows a power law with exponent smaller than two. In this situation, the…

Complex networks have recently aroused a lot of interest. However, network edges are considered to be the same in almost all these studies. In this paper, we present a simple classification method, which divides the edges of undirected,…

We propose an analytically tractable neural connectivity model with power-law distributed synaptic strengths. When threshold neurons with biologically plausible number of incoming connections are considered, our model features a continuous…

The probability distribution of number of ties of an individual in a social network follows a scale-free power-law. However, how this distribution arises has not been conclusively demonstrated in direct analyses of people's actions in…

Many real networks are equipped with short diameters, high clustering, and power-law degree distributions. With preferential attachment and network growth, the model by Barabasi and Albert simultaneously reproduces these properties, and…

Inspired by studies on airline networks we propose a general model for weighted networks in which topological growth and weight dynamics are both determined by cost adversarial mechanism. Since transportation networks are designed and…

Recently it has been shown that a large variety of different networks have power-law (scale-free) distributions of connectivities. We investigate the robustness of such a distribution in discrete threshold networks under neutral evolution.…

What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by…