Cited By
View all- Tao WYu MLi G(2014)Efficient top-k simrank-based similarity joinProceedings of the VLDB Endowment10.14778/2735508.27355208:3(317-328)Online publication date: 1-Nov-2014
Random Walks with Look-Ahead in Scale-Free Random Graphs
Authors: 
Colin Cooper, Alan FriezeAuthors Info & Claims
Colin Cooper, Alan FriezeAuthors Info & ClaimsPages 1162 - 1176
Abstract
If $m\geq2$ is constant and $0\leq r\leq\varepsilon\log\log n$ for a small positive constant $\varepsilon$, then whp a random walk with look-ahead $r$ on a scale-free graph $G=G_{(m,n)}$ has cover time $C_G(r)\sim(2/(m^{r-1}(m-1)))\;n\log n$.
References
[1]
A. Barabási and R. Albert, Emergence of scaling in random networks, Science, 286 (1999), pp. 509-512.
[2]
B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica, 24 (2004), pp. 5-34.
[3]
A. Broder, R. Kumar, F.Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, Graph structure in the web, in Proceedings of the 9th WWW Conference, Amsterdam, 2000, pp. 309-320.
[4]
C. Cooper, The age specific degree distribution of web-graphs, Combin. Probab. Comput., 15 (2006), pp. 637-661.
[5]
C. Cooper and A. M. Frieze, A general model of web graphs, Random Structures Algorithms, 22 (2003), pp. 311-335.
[6]
C. Cooper and A. Frieze, The cover time of random regular graphs, SIAM J. Discrete Math., 18 (2005), pp. 728-740.
[7]
C. Cooper and A. M. Frieze, The cover time of the preferential attachment graph, J. Combin. Theory Ser. B, 97 (2007), pp. 269-290.
[8]
C. Cooper and A. Frieze, The cover time of the giant component of a random graph, Random Structures Algorithms, 32 (2008), pp. 401-439.
[9]
P. G. Doyle and J. L. Snell, Random Walks and Electrical Networks, Carus Math. Monogr. 22, Mathematical Association of America, Washington, DC, 1984.
[10]
M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, in Proceedings of SIGCOMM, Cambridge, MA, ACM, 1999, pp. 251-262.
[11]
W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, Wiley and Sons, New York, 1971.
[12]
M. Mihail, C. Papadimitriou, and A. Saberi, On certain connectivity properties of the internet topology, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, Cambridge, MA, 2003, pp. 28-35.
[13]
M. Mihail, A. Saberi, and P. Tetali, Random walks with lookahead on power law random graphs, Internet Math., 3 (2006), pp. 147-152.
[14]
A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput., 1 (1992), pp. 351-370.
- Random Walks with Look-Ahead in Scale-Free Random Graphs
Recommendations
Multiple Random Walks in Random Regular Graphs
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random $r$-regular ...
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
We study conditions under which the treewidth of three different classes of random graphs is linear in the number of vertices. For the Erdos-Renyi random graph G(n,m), our result improves a previous lower bound obtained by Kloks (1994) [22]. For random ...
Treewidth of Erd's-Rényi random graphs, random intersection graphs, and scale-free random graphs
We study conditions under which the treewidth of three different classes of random graphs is linear in the number of vertices. For the Erd s-Rényi random graph G ( n , m ) , our result improves a previous lower bound obtained by Kloks (1994) 22]. For ...
Comments
Information & Contributors
Information
Published In
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 September 2010
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 11 Jan 2025
Other Metrics
Citations
Cited By
View all- Tao WYu MLi G(2014)Efficient top-k simrank-based similarity joinProceedings of the VLDB Endowment10.14778/2735508.27355208:3(317-328)Online publication date: 1-Nov-2014