相关论文: A general model for collaboration networks

In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to…

Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the…

Evolutionary game theory is employed to study topological conditions of scale-free networks for the evolution of cooperation. We show that Apollonian Networks (ANs) are perfect scale-free networks, on which cooperation can spread to all…

We investigate several geometric models of network which simultaneously have some nice global properties, that the small diameter property, the small-community phenomenon, which is defined to capture the common experience that (almost)…

We study a modified version of a model previously proposed by Jackson and Wolinsky to account for communicating information and allocating goods in socioeconomic networks. In the model, the utility function of each node is given by a…

Many networks exhibit scale free behavior where their degree distribution obeys a power law for large vertex degrees. Models constructed to explain this phenomena have relied on preferential attachment where the networks grow by the…

Although the community structure organization is one of the most important characteristics of real-world networks, the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for…

Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with…

Network models are widely used to represent relational information among interacting units and the structural implications of these relations. Recently, social network studies have focused a great deal of attention on random graph models of…

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…

We introduce a dynamical network model which unifies a number of network families which are individually known to exhibit $q$-exponential degree distributions. The present model dynamics incorporates static (non-growing) self-organizing…

Many real networks have cliques as their constitutional units. Here we present a family of scale-free network model consist of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and…

We propose a simple dynamical model that generates networks with power-law degree distributions with the exponent 2 through rewiring only. At each time step, two nodes, i and j, are randomly selected, and one incoming link to i is…

Scale-free networks are characterized by a degree distribution with power-law behavior and have been shown to arise in many areas, ranging from the World Wide Web to transportation or social networks. Degree distributions of observed…

We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…

Network growth is currently explained through mechanisms that rely on node prestige measures, such as degree or fitness. In many real networks those who create and connect nodes do not know the prestige values of existing nodes, but only…

It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power…

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…

The dynamics of diffusion in complex networks are widely studied to understand how entities, such as information, diseases, or behaviors, spread in an interconnected environment. Complex networks often present community structure, and tools…

This article addresses the degree distribution of subnetworks, namely the number of links between the nodes in each subnetwork and the remainder of the structure (cond-mat/0408076). The transformation from a subnetwork-partitioned model to…