Generic scale of the "scale-free" growing networks
arXiv:cond-mat/0011115 · doi:10.1103/PhysRevE.63.062101
Abstract
We show that the connectivity distributions of scale-free growing networks ( is the network size) have the generic scale -- the cut-off at . The scaling exponent is related to the exponent of the connectivity distribution, . We propose the simplest model of scale-free growing networks and obtain the exact form of its connectivity distribution for any size of the network. We demonstrate that the trace of the initial conditions -- a hump at -- may be found for any network size. We also show that there exists a natural boundary for the observation of the scale-free networks and explain why so few scale-free networks are observed in Nature.
4 pages revtex, 3 figures
References in corpus (11)
- Error and attack tolerance of complex networks
- The structure of scientific collaboration networks
- The large-scale organization of metabolic networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Topology of evolving networks: local events and universality
- Connectivity of Growing Random Networks
- Evolution of reference networks with aging
- Scaling properties of scale-free evolving networks: Continuous approach
- Scaling Behaviour of Developing and Decaying Networks
Cited by in corpus (104)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- Evolutionary games on graphs
- Critical phenomena in complex networks
- Attack vulnerability of complex networks
- Growing Scale-Free Networks with Tunable Clustering
- Scale-Free Networks are Ultrasmall
- Popularity versus Similarity in Growing Networks
- Measuring preferential attachment for evolving networks
- Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
- Pseudofractal Scale-free Web
- Networks in Cognitive Science
- Localization and centrality in networks
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Non-equilibrium dynamics of language games on complex networks
- Quantifying randomness in real networks
- Scale-free Networks on Lattices
- Combining complex networks and data mining: why and how
- Emergent Hyperbolic Network Geometry
- Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
- Network geometry with flavor: from complexity to quantum geometry
- Comparison of voter and Glauber ordering dynamics on networks
- Tuning clustering in random networks with arbitrary degree distributions
- Finiteness and Fluctuations in Growing Networks
- Exploring networks with traceroute-like probes: theory and simulations
- Scale-Free Networks Generated By Random Walkers
- A deterministic small-world network created by edge iterations
- Local structure can identify and quantify influential global spreaders in large scale social networks
- Rate equation approach for correlations in growing network models
- Recursive graphs with small-world scale-free properties
- Emergent Complex Network Geometry
- Emergence of Soft Communities from Geometric Preferential Attachment
- Uncorrelated Random Networks
- Shortest paths and load scaling in scale-free trees
- Evolving networks with distance preferences
- Simplicial complexes: higher-order spectral dimension and dynamics
- Kinetic Theory of Random Graphs: from Paths to Cycles
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Growing scale-free simplices
- Scale Free Networks from Self-Organisation
- Random Graphs with Hidden Color
- Competitive cluster growth in complex networks
- Complex Quantum Network Geometries: Evolution and Phase Transitions
- Properties of Random Graphs with Hidden Color
- Evolution of Cooperation in the Presence of Higher-Order Interactions: from Networks to Hypergraphs
- Statistics of Lead Changes in Popularity-Driven Systems
- Network clique cover approximation to analyze complex contagions through group interactions
- Statistics of Cycles: How Loopy is your Network?
- The spectral dimension of simplicial complexes: a renormalization group theory
- Geographical Embedding of Scale-Free Networks
- Network Geometry and Complexity
- Complex network view of evolving manifolds
- Evolving small-world scale-free networks consist of cliques
- Correlations in connected random graphs
- Evolving small-world networks with geographical attachment preference
- Bounding network spectra for network design
- Reaction-diffusion processes on correlated and uncorrelated scale-free networks
- Growing Scale-free Small-world Networks with Tunable Assortative Coefficient
- Addition-Deletion Networks
- A statistical approach to the traceroute-like exploration of networks: theory and simulations
- Evolution of the digital society reveals balance between viral and mass media influence
- Degree-dependent intervertex separation in complex networks
- Clustering Phase Transitions and Hysteresis: Pitfalls in Constructing Network Ensembles
- Correlations in random Apollonian network
- Local-world evolving networks with tunable clustering
- Organization of complex networks without multiple connections
- Generating-function approach for bond percolations in hierarchical networks
- Multistage Random Growing Small-World Networks with Power-law degree Distribution
- Renormalization group for evolving networks
- On the Tomography of Networks and Multicast Trees
- Statistics of cycles in large networks
- Competition between global and local online social networks
- Two universal physical principles shape the power-law statistics of real-world networks
- Modular organization of cancer signaling networks is associated with patient survivability
- Minimal models of weighted scale-free networks
- Finite size effects in Barabasi-Albert growing networks
- From regular to growing small-world networks
- Digital Ecology: Coexistence and Domination among Interacting Networks
- Nested structure acquired through simple evolutionary process
- Fluctuations analysis in complex networks modeled by hidden variable models. Necessity of a large cut-off in hidden-variable models
- Critical Phase of Bond Percolations on Growing Networks
- Scale-free properties of weighted networks with connectivity-driven topology
- Heterogeneous distribution of metabolites across plant species
- Stratification in the Preferential Attachment Network
- Quantum statistics in Network Geometry with Fractional Flavor
- Fundamental Structural Constraint of Random Scale-Free Networks
- Scaling of disordered recursive networks
- Network growth for enhanced natural selection
- Mesoscopics and fluctuations in networks
- Finite-time fluctuations in the degree statistics of growing networks
- Degree and component size distributions in generalized uniform recursive tree
- Growing Hypergraphs with Preferential Linking
- Global architecture of metabolite distributions across species and its formation mechanisms
- Fluctuations of motifs and non self-averaging in complex networks. A self- vs non-self-averaging phase transition scenario
- Condition numbers and scale free graphs
- Inhomogeneous substructures hidden in random networks
- Discrete Scale Invariance in Scale Free Graphs
- Simple rules govern finite-size effects in scale-free networks
- Two-level relationships and Scale-Free Networks
- Growing graphs with addition of communities
- Exact statistical mechanics of the Ising model on networks
- Deterministic simplicial complexes
- Evolution of collective fairness in complex networks through degree-based role assignment