Diffusion Processes on Small-World Networks with Distance-Dependent Random-Links
arXiv:0704.2564 · doi:10.1088/1742-5468/2007/08/P08014
Abstract
We considered diffusion-driven processes on small-world networks with distance-dependent random links. The study of diffusion on such networks is motivated by transport on randomly folded polymer chains, synchronization problems in task-completion networks, and gradient driven transport on networks. Changing the parameters of the distance-dependence, we found a rich phase diagram, with different transient and recurrent phases in the context of random walks on networks. We performed the calculations in two limiting cases: in the annealed case, where the rearrangement of the random links is fast, and in the quenched case, where the link rearrangement is slow compared to the motion of the random walker or the surface. It has been well-established that in a large class of interacting systems, adding an arbitrarily small density of, possibly long-range, quenched random links to a regular lattice interaction topology, will give rise to mean-field (or annealed) like behavior. In some cases, however, mean-field scaling breaks down, such as in diffusion or in the Edwards-Wilkinson process in "low-dimensional" small-world networks. This break-down can be understood by treating the random links perturbatively, where the mean-field (or annealed) prediction appears as the lowest-order term of a naive perturbation expansion. The asymptotic analytic results are also confirmed numerically by employing exact numerical diagonalization of the network Laplacian. Further, we construct a finite-size scaling framework for the relevant observables, capturing the cross-over behaviors in finite networks. This work provides a detailed account of the self-consistent-perturbative and renormalization approaches briefly introduced in two earlier short reports.
36 pages, 27 figures. Minor revisions in response to the referee's comments. Furthermore, some typos were fixed and new references were added
References in corpus (36)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Finding and evaluating community structure in networks
- Evolution of networks
- Renormalization group analysis of the small-world network model
- Optimal network topologies for local search with congestion
- Theory of resistor networks: The two-point resistance
- Diffusion, localization and dispersion relations on ``small-world'' lattices
- Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations
- XY model in small-world networks
- Small-World Networks: Links with long-tailed distributions
- Anomalous Transport in Complex Networks
- From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth
- Relaxation Properties of Small-World Networks
- Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency
- Phase transitions in a network with range dependent connection probability
- Physical realizability of small-world networks
- Shortest paths on systems with power-law distributed long-range connections
- Congestion-gradient driven transport on complex networks
- Mean-Field and Anomalous Behavior on a Small-World Network
- Characterizing the structure of small-world networks
- Current Flow in Random Resistor Networks: The Role of Percolation in Weak and Strong Disorder
- Diffusion Processes on Power-Law Small-World Networks
- Scaling of random spreading in small world networks
- Small-world phenomena and the statistics of linear polymer networks
- Testing the Collective Properties of Small-World Networks through Roughness Scaling
- Scaling in Small-World Resistor Networks
- Particle Dispersion on Rapidly Folding Random Hetero-Polymers
- Extreme Fluctuations in Small-Worlds with Relaxational Dynamics
- Synchronization Landscapes in Small-World-Connected Computer Networks
- Phase transitions in Ising model on a Euclidean network
- Traversal Times for Random Walks on Small-World Networks
- Critical Properties of an Ising Model with Dilute Long-range Interactions
- Random spreading phenomena in annealed small world networks
- Algorithmic scalability in globally constrained conservative parallel discrete event simulations of asynchronous systems
- An -expansion for Small-World Networks