The degree-wise effect of a second step for a random walk on a graph

DOI10.1017/JPR.2018.79MaRDI QIDQ4611281zbMATH OpenOpenAlexWikidataFDO

Authors Kenneth S. Berenhaut, Hongyi Jiang, Katelyn M. McNab, Elizabeth J. Krizay

Publication date 17 January 2019

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/jpr.2018.79

zbMATH Keywords

configuration modelfriendship paradoxgraphrandom walk

Mathematics Subject Classification ID

Vertex degrees (05C07) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Combinatorial probability (60C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Social networks; opinion dynamics (91D30)

Recommendations

• The distribution of second degrees in the Bollobás-Riordan random graph model
• scientific article; zbMATH DE number 909704
• The distribution of second degrees in the Buckley-Osthus random graph model
• scientific article; zbMATH DE number 3847442
• Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.

Cites work

• A critical point for random graphs with a given degree sequence
• Cutoff for nonbacktracking random walks on sparse random graphs
• Cutoff phenomena for random walks on random regular graphs
• Directed random graphs with given degree distributions
• Discrete probability models and methods. Probability on graphs and trees, Markov chains and random fields, entropy and coding
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mixing times of random walks on dynamic configuration models
• Random walk on sparse random digraphs
• Random walks on the random graph
• The asymptotic number of labeled graphs with given degree sequences
• The friendship paradox
• THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS
• The multistep friendship paradox
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Cited in

(2)

• Hitting times for second-order random walks
• Disparity-persistence and the multistep friendship paradox

This page was built for publication: The degree-wise effect of a second step for a random walk on a graph

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