Vertex Intrinsic Fitness: How to Produce Arbitrary Scale-Free Networks
arXiv:cond-mat/0309659 · doi:10.1103/PhysRevE.70.056126
Abstract
We study a recent model of random networks based on the presence of an intrinsic character of the vertices called fitness. The vertices fitnesses are drawn from a given probability distribution density. The edges between pair of vertices are drawn according to a linking probability function depending on the fitnesses of the two vertices involved. We study here different choices for the probability distribution densities and the linking functions. We find that, irrespective of the particular choices, the generation of scale-free networks is straightforward. We then derive the general conditions under which scale-free behavior appears. This model could then represent a possible explanation for the ubiquity and robustness of such structures.
4 pages, 3 figures, RevTex
References in corpus (2)
Cited by in corpus (30)
- Interplay between topology and dynamics in the World Trade Web
- Self-organized network evolution coupled to extremal dynamics
- Geographical threshold graphs with small-world and scale-free properties
- Growing complex network of citations of scientific papers -- measurements and modeling
- Complex stock trading network among investors
- Crossovers in ScaleFree Networks on Geographical Space
- Process Flow Diagram of an Ammonia Plant as a Complex Network
- Uncovering the topology of configuration space networks
- Turing instability in Reaction-Diffusion models on complex networks
- Preferential attachment mechanism of complex network growth: "rich-gets-richer" or "fit-gets-richer"?
- Socioeconomic Networks with Long-Range Interactions
- Scale-Free Networks beyond Power-Law Degree Distribution
- Node similarity as a basic principle behind connectivity in complex networks
- Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model
- Self-Organization and Complex Networks
- Evaluating transport in irregular pore networks
- Diophantine Networks
- The Fitness-Corrected Block Model, or how to create maximum-entropy data-driven spatial social networks
- Mutual selection in network evolution: the role of the intrinsic fitness
- Financial Contagion in a Generalized Stochastic Block Model
- Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
- Generalised thresholding of hidden variable network models with scale-free property
- Fitness-driven deactivation in network evolution
- Mathematical Modeling of Systemic Risk in Financial Networks: Managing Default Contagion and Fire Sales
- Node isolation in large homogeneous binary multiplicative attribute graph models
- On the log-normality of the degree distribution in large homogeneous binary multiplicative attribute graph models
- A Self-organized model for network evolution
- Multiplex Networks with Intrinsic Fitness: Modeling the Merit-Fame Interplay via Latent Layers
- Will Scale-free Popularity Develop Scale-free Geo-social Networks?
- Decay of Scale-Free Property in Birth-and-Death Network