相关论文: Random Apollonian Networks

Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of…

We propose a general geometric growth model for pseudofractal scale-free web, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks: degree distribution, second moment of degree…

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…

Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…

We review the recent fast progress in statistical physics of evolving networks. Interest has focused mainly on the structural properties of random complex networks in communications, biology, social sciences and economics. A number of giant…

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which approximate the measured degree distribution of the Internet.…

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…

Future communications systems will definitely be built on green infrastructures. To realize such a goal, recently a new network infrastructure named cloud radio access network (C-RAN) is proposed by China Mobile to enhance network coverage…

The family of planar graphs is a particularly important family and models many real-world networks. In this paper, we propose a principled framework based on the widely-known Apollonian packing process to generate new planar network, i.e.,…

In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs-the well connected…

We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on…

We study the realizability of scale free-networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this…

Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution $P(k)\sim k^{-\gamma}$, where the degree exponent $\gamma$ describes the extent of…

A Barab\'asi-Albert scale-free network is constructed whose nodes are the Poisson distributed random points within a unit square and links are the straight line connections among the nodes. The cost function, which is the total wiring…

In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos and Renyi graphs only in the limit of diverging average connectivity. Starting…

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…

We study the statistical properties of the sampled networks by a random walker. We compare topological properties of the sampled networks such as degree distribution, degree-degree correlation, and clustering coefficient with those of the…

We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…

The vast majority of real-world networks are scale-free, loopy, and sparse, with a power-law degree distribution and a constant average degree. In this paper, we study first-order consensus dynamics in binary scale-free networks, where…

It has been well-known that many real networks are scale-free (SF) but extremely vulnerable against attacks. We investigate the robustness of connectivity and the lengths of the shortest loops in randomized SF networks with realistic…