Generating functionology
A tight upper bound on the cover time for random walks on graphs
Random Structures & Algorithms
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
A tight lower bound on the cover time for random walks on graphs
Random Structures & Algorithms
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
The cover time of sparse random graphs.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the Cover Time for Random Walks on Random Graphs
Combinatorics, Probability and Computing
The Diameter of a Scale-Free Random Graph
Combinatorica
The Cover Time of Random Regular Graphs
SIAM Journal on Discrete Mathematics
Gossiping (via mobile?) in social networks
Proceedings of the fifth international workshop on Foundations of mobile computing
The Cover Time of Random Digraphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The cover time of random geometric graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Rumor Spreading in Social Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Multiple Random Walks and Interacting Particle Systems
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Second order centrality: Distributed assessment of nodes criticity in complex networks
Computer Communications
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
Random Walks with Look-Ahead in Scale-Free Random Graphs
SIAM Journal on Discrete Mathematics
Rumor spreading in social networks
Theoretical Computer Science
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Stationary distribution and cover time of random walks on random digraphs
Journal of Combinatorial Theory Series B
A fast algorithm to find all high degree vertices in power law graphs
Proceedings of the 21st international conference companion on World Wide Web
A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
| Hi-index | 0.00 |
The preferential attachment graph G"m(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability proportional to their degree. Thus at time n there are n vertices and mn edges. This process yields a graph which has been proposed as a simple model of the world wide web [A. Barabasi, R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509-512]. In this paper we show that if m=2 then whp the cover time of a simple random walk on G"m(n) is asymptotic to 2mm-1nlogn.