Spreading and shortest paths in systems with sparse long-range connections

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, 1 eps fig. Uses psfig

Scientific paper

10.1103/PhysRevE.60.R6263

Spreading according to simple rules (e.g. of fire or diseases), and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (``Small-World'' lattices). The volume V(t) covered by the spreading quantity on an infinite system is exactly calculated in all dimensions. We find that V(t) grows initially as t^d/d for t<< t^* = (2p \Gamma_d (d-1)!)^{-1/d} and later exponentially for $t>>t^*$, generalizing a previous result in one dimension. Using the properties of V(t), the average shortest-path distance \ell(r) can be calculated as a function of Euclidean distance r. It is found that \ell(r) = r for rr_c. The characteristic length r_c, which governs the behavior of shortest-path lengths, diverges with system size for all p>0. Therefore the mean separation s \sim p^{-1/d} between shortcut-ends is not a relevant internal length-scale for shortest-path lengths. We notice however that the globally averaged shortest-path length, divided by L, is a function of L/s only.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Spreading and shortest paths in systems with sparse long-range connections does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spreading and shortest paths in systems with sparse long-range connections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spreading and shortest paths in systems with sparse long-range connections will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-10718

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.