Preferential compactness of networks
arXiv:cond-mat/0407643
Abstract
We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex architectures, but infinite ones tend towards the opposite, having rapidly decreasing distributions of connections. We present an analytical solution of the problem for tree-like networks. Our approach links a collective self-optimization mechanism of the emergence of complex network architectures to self-organization mechanisms.
7 pages, 4 figures
References in corpus (10)
- Mean-field theory for scale-free random networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Modeling the Internet's Large-Scale Topology
- Highly Optimized Tolerance: Robustness and Power Laws in Complex Systems
- Scale-free Networks on Lattices
- Small-worlds: How and why
- Evolving networks with disadvantaged long-range connections
- Extreme self-organization in networks constructed from gene expression data
- Network Structures from Selection Principles