Scale-free networks with exponent one

Abstract

A majority of studied models for scale-free networks have degree distributions with exponents greater than $2$. Real networks, however, can demonstrate essentially more heavy-tailed degree distributions. We explore two models of scale-free equilibrium networks that have the degree distribution exponent $\gamma =1$, $P(q)\sim q^{-\gamma }$. Such degree distributions can be identified in empirical data only if the mean degree of a network is sufficiently high. Our models exploit a rewiring mechanism. They are local in the sense that no knowledge of the network structure, apart from the immediate neighbourhood of the vertices, is required. These models generate uncorrelated networks in the infinite size limit, where they are solved explicitly. We investigate finite size effects by the use of simulations. We find that both models exhibit disassortative degree-degree correlations for finite network sizes. In addition, we observe a markedly degree-dependent clustering in the finite networks. We indicate a real-world network with a similar degree distribution.

8 pages, 8 figures

References in corpus (24)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The diameter of the world wide web
• Evolution of networks
• Scale-free brain functional networks
• The Web of Human Sexual Contacts
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Connectivity of Growing Random Networks
• Hyperbolic Geometry of Complex Networks
• Bose-Einstein condensation in complex networks
• Popularity versus Similarity in Growing Networks
• Power Laws are Logarithmic Boltzmann Laws
• Scale-free Networks from Optimal Design
• Multiplicative processes and power laws
• Statistical ensemble of scale-free random graphs
• Uncorrelated Random Networks
• Scale-free networks with an exponent less than two
• Principles of statistical mechanics of random networks
• The power of choice in network growth
• Self Organized Scale-Free Networks from Merging and Regeneration
• Entropy distribution and condensation in random networks with a given degree distribution
• Clustering of random scale-free networks
• Complex networks created by aggregation
• Hamiltonian Dynamics of Preferential Attachment

Cited by in corpus (10)

• Percolation on complex networks: Theory and application
• Sparse graphs using exchangeable random measures
• Cumulative effects of triadic closure and homophily in social networks
• Dense Power-law Networks and Simplicial Complexes
• General expression for the component size distribution in infinite configuration networks
• Self-isolation or borders closing: what prevents epidemic spreading better?
• Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model
• Network science Ising states of matter
• Generalised thresholding of hidden variable network models with scale-free property
• Multiple predator based capture process on complex networks