Scaling Laws in Spatial Network Formation
arXiv:1607.01435 · doi:10.1103/PhysRevLett.117.168301
Abstract
Geometric constraints impact the formation of a broad range of spatial networks, from amino acid chains folding to proteins structures to rearranging particle aggregates. How the network of interactions dynamically self-organizes in such systems is far from fully understood. Here, we analyze a class of spatial network formation processes by introducing a mapping from geometric to graph-theoretic constraints. Combining stochastic and mean field analyses yields an algebraic scaling law for the extent (graph diameter) of the resulting networks with system size, in contrast to logarithmic scaling known for networks without constraints. Intriguingly, the exponent falls between that of self-avoiding random walks and that of space filling arrangements, consistent with experimentally observed scaling (of the spatial radius of gyration) for protein tertiary structures.
References in corpus (12)
- Random graphs with arbitrary degree distributions and their applications
- Spatial Networks
- Mean-field solution of the small-world network model
- Folding Kinetics of Protein Like Heteropolymers
- Self-organized adaptation of a simple neural circuit enables complex robot behaviour
- Impact of Single Links in Competitive Percolation -- How complex networks grow under competition
- Assortative mixing in Protein Contact Networks and protein folding kinetics
- RNA secondary structure formation: a solvable model of heteropolymer folding
- Dynamics and Scaling of 2D Polymers in a Dilute Solution
- A Gauge Field Theory of Chirally Folded Homopolymers with Applications to Folded Proteins
- Small-world spectra in mean field theory
- Universal Attractors of Reversible Aggregate-Reorganization Processes