Deterministic Scale-Free Networks

Abstract

Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in a deterministic fashion. We solve exactly the model, showing that the tail of the degree distribution follows a power law.

References in corpus (2)

• Lethality and centrality in protein networks
• The Web of Human Sexual Contacts

Cited by in corpus (102)

• Hierarchical organization of modularity in metabolic networks
• Evolution of networks
• Critical phenomena in complex networks
• Hierarchical Organization in Complex Networks
• From time series to complex networks: the visibility graph
• Kronecker Graphs: An Approach to Modeling Networks
• Random walks and diffusion on networks
• Pseudofractal Scale-free Web
• Bipartite Graphs as Models of Complex Networks
• Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale
• Structure and Time-Evolution of an Internet Dating Community
• The network topology of a potential energy landscape: A static scale-free network
• Non-equilibrium dynamics of language games on complex networks
• A Geometric Fractal Growth Model for Scale Free Networks
• Combining complex networks and data mining: why and how
• Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
• Self-similar disk packings as model spatial scale-free networks
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• A deterministic small-world network created by edge iterations
• Recursive graphs with small-world scale-free properties
• Self-similar scaling of density in complex real-world networks
• Multi-node basin stability in complex dynamical networks
• Quantum Google in a Complex Network
• Coherence in scale-free networks of chaotic maps
• Random Walks on deterministic Scale-Free networks: Exact results
• Edge vulnerability in neural and metabolic networks
• Multifractal Network Generator
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• Exact calculations of first-passage quantities on recursive networks
• High dimensional random Apollonian networks
• Higher order clustering coefficients in Barabasi-Albert networks
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Deterministic Small-World Networks
• High Dimensional Apollonian Networks
• Measure for degree heterogeneity in complex networks and its application to recurrence network analysis
• Networks in life: Scaling properties and eigenvalue spectra
• Exact solution of mean geodesic distance for Vicsek fractals
• Weighted Fractal Networks
• Evolving Apollonian Networks with Small-world Scale-free topologies
• A general geometric growth model for pseudofractal scale-free web
• Exact analytical solution of average path length for Apollonian networks
• Analyses of Some Structural Properties on a Class of Hierarchical Scale-free Networks
• Random Graph Modeling: A survey of the concepts
• Link prediction based on path entropy
• Hierarchical, Regular Small-World Networks
• Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights
• Mapping Koch curves into scale-free small-world networks
• Effective target arrangement in a deterministic scale-free graph
• Trapping in scale-free networks with hierarchical organization of modularity
• Consensus formation on a triad scale-free network
• Evolving small-world networks with geographical attachment preference
• Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
• Exactly solvable scale-free network model
• Random walks in modular scale-free networks with multiple traps
• Average distance in a hierarchical scale-free network: an exact solution
• Degree-dependent intervertex separation in complex networks
• Generating hierarchial scale free graphs from fractals
• Scaling laws for diffusion on (trans)fractal scale-free networks
• Topologies and Laplacian spectra of a deterministic uniform recursive tree
• Deterministic hierarchical networks
• Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks
• Recursive weighted treelike networks
• Renormalization group for evolving networks
• A geometric growth model interpolating between regular and small-world networks
• Deterministic weighted scale-free small-world networks
• Counterexample: scale-free networked graphs with invariable diameter and density feature
• Clustering under the line graph transformation: Application to reaction network
• Minimal models of weighted scale-free networks
• Hierarchical scale-free network is fragile against random failure
• Geometry and Dynamics for Hierarchical Regular Networks
• Recovery time after localized perturbations in complex dynamical networks
• A Complex Network Approach to Topographical Connections
• A trust model for spreading gossip in social networks
• Stochastic and mixed flower graphs
• Flexible construction of hierarchical scale-free networks with general exponent
• On scale-free and poly-scale behaviors of random hierarchical network
• Overlapping modularity at the critical point of k-clique percolation
• S-curve networks and an approximate method for estimating degree distributions of complex networks
• Can recurrence networks show small world property?
• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
• Rewiring hierarchical scale-free networks: Influence on synchronizability and topology
• A star based model for the eigenvalue power law of Internet graphs
• Random walks in unweighted and weighted modular scale-free networks with a perfect trap
• The rigorous solution for the average distance of a Sierpinski network
• Constructions and properties of a class of random scale-free networks
• Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap
• Vertex labeling and routing in expanded Apollonian networks
• An alternative approach to determining average distance in a class of scale-free modular networks
• Efficient Algorithms for Sampling and Clustering of Large Nonuniform Networks
• Transfinite fractal dimension of trees and hierarchical scale-free graphs
• The art of community detection
• Exactly solvable tight-binding models on two scale-free networks with identical degree distribution
• Analytical controllability of deterministic scale-free networks and Cayley trees
• Deterministic scale-free networks created in a recursive manner
• On the Importance of Hubs in Hopfield Complex Neuronal Networks under Attack
• Coherence in complex networks of oscillators
• Minimum leader selection for Structural Controllability of Undirected Graphs with Leader-follower Framework
• Structure Properties of Koch Networks Based on Networks Dynamical Systems
• Quantum Google Algorithm: Construction and Application to Complex Networks
• Deterministic simplicial complexes
• Hierarchical deposition and scale-free networks: a visibility algorithm approach
• Structural properties and average tapping time on scale-free graphs with smallest diameter