Random Walks with Look-Ahead in Scale-Free Random Graphs

13 years 5 months ago

Download www.math.cmu.edu

If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(m - 1))) n log n.

Colin Cooper, Alan M. Frieze

Real-time Traffic

Random Walk | Scale-free Graph | SIAMDM 2010 | Small Positive Constant |

claim paper

» Adversarial Deletion in a ScaleFree Random Graph Process

» The Diameter of a ScaleFree Random Graph

» Scale Free Properties of Random kTrees

» Fast Random Walk Graph Kernel

» Sampling directed graphs with random walks

» Comparison of Failures and Attacks on Random and ScaleFree Networks

» Hybrid search schemes for unstructured peertopeer networks

» Legislative Prediction via Random Walks over a Heterogeneous Graph

Post Info
More Details (n/a)

Added	21 May 2011
Updated	21 May 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Colin Cooper, Alan M. Frieze

Comments (0)

Sciweavers

Random Walks with Look-Ahead in Scale-Free Random Graphs

Random Walk | Scale-free Graph | SIAMDM 2010 | Small Positive Constant |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers