相关论文: Natural emergence of clusters and bursts in networ…
This paper presents an analysis of a temporal network that describes the social connections of a large-scale (~ 30,000) sample of online social network users, inhabitants of a fixed city. We tested how the main network formation…
Complex systems can be characterized by classes of equivalency of their elements defined according to system specific rules. We propose a generalized preferential attachment model to describe the class size distribution. The model…
We examine the effects of preferential attachment on a model of competing clusters. In the original model, cluster masses grow at the expense of their neighbours; on a lattice, this is known to result in the asymptotic survival and…
We consider a preferential growth model where particles are added one by one to the system consisting of clusters of particles. A new particle can either form a new cluster (with probability q) or join an already existing cluster with a…
In graph theory and network analysis, node degree is defined as a simple but powerful centrality to measure the local influence of node in a complex network. Preferential attachment based on node degree has been widely adopted for modeling…
In this paper, we characterise the notion of preferential attachment in networks as action at a distance, and argue that it can only be an emergent phenomenon -- the actual mechanism by which networks grow always being the closing of…
The ever-increasing knowledge of the structure of various real-world networks has uncovered their complex multi-mechanism-governed evolution processes. Therefore, a better understanding of the structure and evolution of these networked…
The preferential attachment model is a natural and popular random graph model for a growing network that contains very well-connected ``hubs''. We study the higher-order connectivity of such a network by investigating the topological…
We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…
Real growing networks like the WWW or personal connection based networks are characterized by a high degree of clustering, in addition to the small-world property and the absence of a characteristic scale. Appropriate modifications of the…
Cooperation is observed widely in nature and is thought an essential component of many evolutionary processes, yet the mechanisms by which it arises and persists are still unclear. Among several theories, network reciprocity -- a model of…
Networks are widely used to model the interaction between individual dynamical systems. In many instances, the total number of units as well as the interaction coupling are not fixed in time, but rather constantly evolve. In terms of…
Real networks often grow through the sequential addition of new nodes that connect to older ones in the graph. However, many real systems evolve through the branching of fundamental units, whether those be scientific fields, countries, or…
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…
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…
We introduce a minimal model of small-world growing network generated by attaching to edges. The produced network is a plane graph which exists in real-life world. We obtain the analytic results of degree distribution decaying exponentially…
In this work we present a model for evolving networks, where the driven force is related to the social affinity between individuals in a population. In the model, a set of individuals initially arranged on a regular ordered network and thus…
Evolving network models under a dynamic growth rule which comprises the addition and deletion of nodes are investigated. By adding a node with a probability $P_a$ or deleting a node with the probability $P_d=1-P_a$ at each time step, where…
Modularity structures are common in various social and biological networks. However, its dynamical origin remains an open question. In this work, we set up a dynamical model describing the evolution of a social network. Based on the…
Large-scale transitions in societies are associated with both individual behavioural change and restructuring of the social network. These two factors have often been considered independently, yet recent advances in social network research…