Generalised thresholding of hidden variable network models with scale-free property

Abstract

The hidden variable formalism (based on the assumption of some intrinsic node parameters) turned out to be a remarkably efficient and powerful approach in describing and analyzing the topology of complex networks. Owing to one of its most advantageous property - namely proven to be able to reproduce a wide range of different degree distribution forms - it has become a standard tool for generating networks having the scale-free property. One of the most intensively studied version of this model is based on a thresholding mechanism of the exponentially distributed hidden variables associated to the nodes (intrinsic vertex weights), which give rise to the emergence of a scale-free network where the degree distribution $p(k)\sim k^{-\gamma }$ is decaying with an exponent of $\gamma =2$. Here we propose a generalization and modification of this model by extending the set of connection probabilities and hidden variable distributions that lead to the aforementioned degree distribution, and analyze the conditions leading to the above behavior analytically. In addition, we propose a relaxation of the hard threshold in the connection probabilities, which opens up the possibility for obtaining sparse scale free networks with arbitrary scaling exponent.

References in corpus (32)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Hyperbolic Geometry of Complex Networks
• Optimal network topologies for local search with congestion
• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Class of correlated random networks with hidden variables
• Phase transition in the detection of modules in sparse networks
• Self-similarity of complex networks and hidden metric spaces
• Learning Latent Block Structure in Weighted Networks
• The origin of degree correlations in the Internet and other networks
• Characterizing and modeling citation dynamics
• Temporal effects in the growth of networks
• Vertex Intrinsic Fitness: How to Produce Arbitrary Scale-Free Networks
• Curvature and temperature of complex networks
• Nonparametric weighted stochastic block models
• Self-organized network evolution coupled to extremal dynamics
• Geographical threshold graphs with small-world and scale-free properties
• Multifractal Network Generator
• Scale-free networks with an exponent less than two
• Topological properties of a time-integrated activity driven network
• Statistical mechanics of topological phase transitions in networks
• Exploration of scale-free networks
• Scale-free networks with exponent one
• Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights
• VIP-club phenomenon: emergence of elites and masterminds in social networks
• Local clustering in scale-free networks with hidden variables
• On the Widespread Occurrence of the Inverse Square Distribution in Social Sciences and Taxonomy
• Low-temperature behaviour of social and economic networks
• Rigorous results on the threshold network model
• Universal power laws in the threshold network model: A theoretical analysis based on extreme value theory

Cited by in corpus (1)

• Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model