相关论文: Two complementary representations of a scale-free …

We propose and study a model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node. As the network grows the weights of links are…

We consider local leaders in random uncorrelated networks, i.e. nodes whose degree is higher or equal than the degree of all of their neighbors. An analytical expression is found for the probability of a node of degree $k$ to be a local…

Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…

We address the problem of social network de-anonymization when relationships between people are described by scale-free graphs. In particular, we propose a rigorous, asymptotic mathematical analysis of the network de-anonymization problem…

We formulate a general model for the growth of scale-free networks under filtering information conditions--that is, when the nodes can process information about only a subset of the existing nodes in the network. We find that the…

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information…

We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…

While previous works have shown that an overwhelming number of scale-free networks are sparse, there still exist some real-world networks including social networks, urban networks, information networks, which are by observation dense. In…

Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…

The dynamics of Boolean networks (the N-K model) with scale-free topology are studied here. The existence of a phase transition governed by the value of the scale-free exponent of the network is shown analytically by analyzing the overlap…

Metabolic networks are known to be scale free but the evolutionary origin of this structural property is not clearly understood. One way of studying the dynamical process is to compare the metabolic networks of species that have arisen at…

In search of many social and economical systems, it is found that node strength distribution as well as degree distribution demonstrate the behavior of power-law with droop-head and heavy-tail. We present a new model for the growth of…

This paper establishes a relation between scale-free networks and Markov chains, and proposes a computation framework for degree distributions of scale-free networks. We first find that, under the BA model, the degree evolution of…

To study transport properties of complex networks, we analyze the equivalent conductance $G$ between two arbitrarily chosen nodes of random scale-free networks with degree distribution $P(k)\sim k^{-\lambda}$ in which each link has the same…

Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…

Real world complex networks are scale free and possess meso-scale properties like core-periphery and community structure. We study evolution of the core over time in real world networks. This paper proposes evolving models for both…

We propose a novel paradigm for modeling real-world scale-free networks, where the integration of new nodes is driven by the combined attractiveness of degree and betweenness centralities, the competition of which (expressed by a parameter…

Degree distribution of nodes, especially a power law degree distribution, has been regarded as one of the most significant structural characteristics of social and information networks. Node degree, however, only discloses the first-order…

Understanding the subgraph distribution in random networks is important for modelling complex systems. In classic Erdos networks, which exhibit a Poissonian degree distribution, the number of appearances of a subgraph G with n nodes and g…

We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment…