Related papers: Structure of a large social network
A random network model which allows for tunable, quite general forms of clustering, degree correlation and degree distribution is defined. The model is an extension of the configuration model, in which stubs (half-edges) are paired to form…
Large scale simulations of the movements of people in a ``virtual'' city and their analyses are used to generate new insights into understanding the dynamic processes that depend on the interactions between people. Models, based on these…
How are people linked in a highly connected society? Since in many networks a power-law (scale-free) node-degree distribution can be observed, power-law might be seen as a universal characteristics of networks. But this study of…
Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks…
It was experimentally observed that the majority of real-world networks follow power law degree distribution. The aim of this paper is to study the algorithmic complexity of such "typical" networks. The contribution of this work is twofold.…
We present an algorithm for generating random networks with arbitrary degree distribution and Clustering (frequency of triadic closure). We use this algorithm to generate networks with exponential, power law, and poisson degree…
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,…
How does the shape of a network change as its size increases? Although random graph models provide some expectations for such "scaling behaviors" in the structure of networks, relatively little is known about how empirical network structure…
Approaches from statistical physics are applied to investigate the structure of network models whose growth rules mimic aspects of the evolution of the world-wide web. We first determine the degree distribution of a growing network in which…
Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a network's most influential nodes, but are rarely usefully accurate in quantifying the spreading power of the vast majority of nodes which are not…
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…
Based on the empirical analysis of the dependency network in 18 Java projects, we develop a novel model of network growth which considers both: an attachment mechanism and the addition of new nodes with a heterogeneous distribution of their…
The study of community networks has attracted considerable attention recently. In this paper, we propose an evolving community network model based on local processes, the addition of new nodes intra-community and new links intra- or…
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential…
Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…
In this paper we make an attempt to increase our understanding of the urban scaling phenomenon. We investigate how superlinear scaling emerges if a network increases in size and how this scaling depends on the occurrence of elements that…
Researchers have devoted themselves to exploring static features of social networks and further discovered many representative characteristics, such as power law in the degree distribution and assortative value used to differentiate social…
Recently, a framework for analyzing time series by constructing an associated complex network has attracted significant research interest. One of the advantages of the complex network method for studying time series is that complex network…
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…
Extensive studies have been done to understand the principles behind architectures of real networks. Recently, evidences for hierarchical organization in many real networks have also been reported. Here, we present a new hierarchical model…