Scale-free Networks on Lattices

Abstract

We suggest a method for embedding scale-free networks, with degree distribution P(k) k^-lambda, in regular Euclidean lattices. The embedding is driven by a natural constraint of minimization of the total length of the links in the system. We find that all networks with lambda>2 can be successfully embedded up to an (Euclidean) distance xi which can be made as large as desired upon the changing of an external parameter. Clusters of successive chemical shells are found to be compact (the fractal dimension is d_f=d), while the dimension of the shortest path between any two sites is smaller than one: d_min=(lambda-2)/(lambda-1-1/d), contrary to all other known examples of fractals and disordered lattices.

Latex, 4 pages, 5 figures

References in corpus (3)

• Statistical mechanics of complex networks
• Lethality and centrality in protein networks
• Evolution of networks

Cited by in corpus (64)

• The structure and function of complex networks
• Spatial Networks
• Efficient Immunization Strategies for Computer Networks and Populations
• The Kuramoto model in complex networks
• Self-similarity of complex networks and hidden metric spaces
• Crossover from Scale-Free to Spatial Networks
• Identifying "communities" within energy landscapes
• Self-similar disk packings as model spatial scale-free networks
• Preferential attachment growth model and nonextensive statistical mechanics
• Geographical threshold graphs with small-world and scale-free properties
• Cooperation enhanced by the difference between interaction and learning neighborhoods for evolutionary spatial prisoner's dilemma games
• Structural properties of spatially embedded networks
• Weighted Scale-Free Networks with Stochastic Weight Assignments
• Subgraphs and network motifs in geometric networks
• The fractal/small-world dichotomy in real-world networks
• Two distinct transitions in spatially embedded multiplex networks
• Epidemics, disorder, and percolation
• Geographical Coarsegraining of Complex Networks
• Geographical Embedding of Scale-Free Networks
• The shortest path to complex networks
• Geographical effects on cascading breakdowns of scale-free networks
• Evolving small-world scale-free networks consist of cliques
• Mapping Koch curves into scale-free small-world networks
• Crossovers in ScaleFree Networks on Geographical Space
• A general model for collaboration networks
• Integer Networks
• Impacts of preference and geography on epidemic spreading
• Corporate competition: A self-organized network
• Robust short-term memory without synaptic learning
• Complex networks embedded in space: Dimension and scaling relations between mass, topological distance and Euclidean distance
• Scaling of Energy Dissipation in Nonequilibrium Reaction Networks
• Epidemic spreading in lattice-embedded scale-free networks
• Effective dimensions and percolation in hierarchically structured scale-free networks
• Diffusion in scale-free networks with annealed disorder
• Impact of network structure on the capacity of wireless multihop ad hoc communication
• An SIS epidemic model with vaccination in a dynamical contact network of mobile individuals with heterogeneous spatial constraints
• Numerical evaluation of the upper critical dimension of percolation in scale-free networks
• Non-Markov stochastic dynamics of real epidemic process of respiratory infections
• Growing networks under geographical constraints
• Optimal transport on wireless networks
• Evolution of Cooperation on Spatially Embedded Networks
• Scale-free networks embedded in fractal space
• Bursting synchronization in networks with long-range coupling mediated by a diffusing chemical substance
• Geographical effects on epidemic spreading in scale-free networks
• Cross-over behaviour in a communication network
• Enhancing Robustness and Immunization in geographical networks
• Robustness of Spatial Micronetworks
• Voronoi and Fractal Complex Networks and Their Characterization
• Scale-free Network on Euclidean Space Optimized by Rewiring of Links
• Scale-free network on a vertical plane
• The Gradient Mechanism in a Communication Network
• The Network of Commuters in London
• Contact graphs of disk packings as a model of spatial planar networks
• Complex systems: features, similarity and connectivity
• Topological estimation of the latent geometry of a complex network
• Dissipation at limited resolutions: Power law and detection of hidden dissipative scales
• Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks
• A transition from river networks to scale-free networks
• Preferential compactness of networks
• Queue-length synchronization in a communication networks
• Unimodular lattice triangulations as small-world and scale-free random graphs
• Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity
• Interplay between Network Topology and Dynamics in Neural Systems
• Factorization threshold models for scale-free networks generation