The cover time of the preferential attachment graph

DOI10.1016/J.JCTB.2006.05.007zbMATH Open1114.05095OpenAlexW2087887302WikidataQ57401499 ScholiaQ57401499MaRDI QIDQ864904FDOQ864904

Authors: Colin Cooper, Alan Frieze 

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

Recommendations

• The cover time of two classes of random graphs
• On the Cover Time for Random Walks on Random Graphs
• On the cover time of random walks on graphs
• Cover time of a random graph with given degree sequence
• The cover time of sparse random graphs

zbMATH Keywords

cover timepreferential attachment graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Emergence of Scaling in Random Networks
• The degree sequence of a scale-free random graph process
• The diameter of a scale-free random graph
• 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
• Title not available (Why is that?)
• On certain connectivity properties of the internet topology
• The Cover Time of Random Regular Graphs
• On the Cover Time for Random Walks on Random Graphs
• Title not available (Why is that?)

Cited In (21)

• On the cover time of dense graphs
• Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
• Stationary distribution and cover time of random walks on random digraphs
• Unexpected advantages of exploitation for target searches in complex networks
• Out-of-equilibrium random walks
• Rumor spreading in social networks
• Random walks and diffusion on networks
• Random walk on sparse random digraphs
• Random walk attachment graphs
• Random walks with look-ahead in scale-free random graphs
• Cover and hitting times of hyperbolic random graphs
• Multiple random walks on graphs: mixing few to cover many
• A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
• The Cover Time of a Random Walk in Affiliation Networks
• The cover time of random geometric graphs
• Analytical results for the distribution of cover times of random walks on random regular graphs
• Large deviations for the degree structure in preferential attachment schemes
• Rumors spread slowly in a small-world spatial network
• The concentration of the maximum degree in the duplication-divergence models
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
• A probabilistic proof of Cooper \& Frieze's ``First Visit Time Lemma

This page was built for publication: The cover time of the preferential attachment graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864904)