Modulated Scale-free Network in the Euclidean Space

Abstract

A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability proportional to $k_i{\ell }^{\alpha }$. Our numerical study indicates that the network is Scale-free for all values of $\alpha >{\alpha }_c$ and the degree distribution decays stretched exponentially for the other values of $\alpha$. The link length distribution follows a power law: $D(\ell )\sim {\ell }^{\delta }$ where $\delta$ is calculated exactly for the whole range of values of $\alpha$.

4 pages, 4 figures. To be published in Physical Review E

References in corpus (7)

• Statistical mechanics of complex networks
• Weighted Evolving Networks
• Scaling properties of scale-free evolving networks: Continuous approach
• Evolving networks with distance preferences
• Phase transitions in a network with range dependent connection probability
• Shortest paths on systems with power-law distributed long-range connections
• Small-world phenomena and the statistics of linear polymer networks

Cited by in corpus (46)

• Spatial Networks
• Small-world properties of the Indian Railway network
• The spatial structure of networks
• Uncovering individual and collective human dynamics from mobile phone records
• Uncovering space-independent communities in spatial networks
• Self-similar disk packings as model spatial scale-free networks
• The effects of spatial constraints on the evolution of weighted complex networks
• Preferential attachment growth model and nonextensive statistical mechanics
• Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting networks ensembles
• Geographical threshold graphs with small-world and scale-free properties
• Wiring cost in the organization of a biological network
• Critical fluctuations in spatial complex networks
• The urban economy as a scale-free network
• Unified model for network dynamics exhibiting nonextensive statistics
• Crossovers in ScaleFree Networks on Geographical Space
• Preferential attachment in growing spatial networks
• Corporate competition: A self-organized network
• Geographical networks evolving with optimal policy
• Complex networks embedded in space: Dimension and scaling relations between mass, topological distance and Euclidean distance
• Weighted Scale-free Networks in Euclidean Space Using Local Selection Rule
• Clustering properties of a generalised critical Euclidean network
• A directed network model for World-Wide Web
• The age-dependent random connection model
• Phase transitions in Ising model on a Euclidean network
• Growing networks under geographical constraints
• Geographical effects on epidemic spreading in scale-free networks
• Features and heterogeneities in growing network models
• Scale-free network on a vertical plane
• Phase transitions for random geometric preferential attachment graphs
• The Network of Commuters in London
• Modelling temporal and spatial features of collaboration network
• Geographical networks stochastically constructed by a self-similar tiling according to population
• Contact graphs of disk packings as a model of spatial planar networks
• Complex systems: features, similarity and connectivity
• Transitions in spatial networks
• Limit theorems for random spatial drainage networks
• Duality between preferential attachment and static random networks on hyperbolic spaces
• Heterogeneous network with distance dependent connectivity
• Generation of Synthetic Spatially Embedded Power Grid Networks
• A transition from river networks to scale-free networks
• Spatial Strength Centrality and the Effect of Spatial Embeddings on Network Architecture
• A study of cascading failures in real and synthetic power grid topologies using DC power flows
• Solvable Metric Growing Networks
• Adaptive Fractal-like Network Structure for Efficient Search of Inhomogeneously Distributed Targets at Unknown Positions
• Network Evolution by Relevance and Importance Preferential Attachment
• Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model