On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Random Structures & Algorithms
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Diameter of a Scale-Free Random Graph
Combinatorica
The Cover Time of Random Regular Graphs
SIAM Journal on Discrete Mathematics
Distribution of Vertex Degree in Web-Graphs
Combinatorics, Probability and Computing
The cover time of the preferential attachment graph
Journal of Combinatorial Theory Series B
The cover time of the giant component of a random graph
Random Structures & Algorithms
| Hi-index | 0.00 |
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$.