Fastest random walk on a path

DOI10.1080/00207721.2018.1543470MaRDI QIDQ5025808zbMATH OpenOpenAlexFDO

Authors Onur Cihan, Mehmet Akar

Publication date 7 February 2022

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207721.2018.1543470

zbMATH Keywords

fastest mixinggraph theoryMarkov chainssecond largest eigenvalue modulus

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Convex programming (90C25)

Recommendations

• Fastest Mixing Markov Chain on a Path
• Fastest Mixing Markov Chain on a Graph
• The rapid mixing of random walks defined by an \(n\)-cube
• Fastest mixing Markov chain problem for the union of two cliques
• Fastest mixing Markov chain on graphs with symmetries

Cites work

• Estimating sizes of social networks via biased sampling
• Fastest Mixing Markov Chain on a Graph
• Fastest Mixing Markov Chain on a Path
• Fastest mixing Markov chain on graphs with symmetries
• Fastest Mixing Reversible Markov Chains on Graphs With Degree Proportional Stationary Distributions
• scientific article; zbMATH DE number 5599306 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• Inequalities for the spectra of symmetric doubly stochastic matrices

Cited in

(5)

• The complete positivity of symmetric tridiagonal and pentadiagonal matrices
• Fastest mixing Markov chain on graphs with symmetries
• Fastest Mixing Markov Chain on a Graph
• Many Random Walks Are Faster Than One
• Fastest Mixing Markov Chain on a Path

This page was built for publication: Fastest random walk on a path

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