The cover time of the preferential attachment graph
From MaRDI portal
Publication:864904
DOI10.1016/j.jctb.2006.05.007zbMath1114.05095OpenAlexW2087887302WikidataQ57401499 ScholiaQ57401499MaRDI QIDQ864904
Publication date: 13 February 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.05.007
Related Items
Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ Random walk on sparse random digraphs ⋮ Rumors Spread Slowly in a Small-World Spatial Network ⋮ Random walks and diffusion on networks ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ Stationary distribution and cover time of random walks on random digraphs ⋮ A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma" ⋮ Large deviations for the degree structure in preferential attachment schemes ⋮ The concentration of the maximum degree in the duplication-divergence models ⋮ The cover time of random geometric graphs ⋮ Rumor spreading in social networks ⋮ On the Cover Time of Dense Graphs ⋮ A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence ⋮ Out-of-equilibrium random walks ⋮ Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
Cites Work
- Unnamed Item
- Unnamed Item
- The diameter of a scale-free random graph
- On certain connectivity properties of the internet topology
- The degree sequence of a scale-free random graph process
- Emergence of Scaling in Random Networks
- On the Cover Time for Random Walks on Random Graphs
- A tight upper bound on the cover time for random walks on graphs
- A tight lower bound on the cover time for random walks on graphs
- The Cover Time of Random Regular Graphs
This page was built for publication: The cover time of the preferential attachment graph
