Fastest random walk on a path

Onur Cihan and Mehmet Akar

International Journal of Systems Science, 2019, vol. 50, issue 1, 1-7

Abstract: In this paper, we consider two convex optimisation problems in order to maximise the mixing rate of a Markov chain on an undirected path. In the first formulation, the holding probabilities of vertices are identical and the transition probabilities from a vertex to its neighbours are equal, whereas the second formulation is the more general reversible Markov chain with the same degree proportional stationary distribution. We derive analytical results on the solutions of the optimisation problems and compare the spectra of the associated transition probability matrices.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207721.2018.1543470 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tsysxx:v:50:y:2019:i:1:p:1-7

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TSYS20

DOI: 10.1080/00207721.2018.1543470

Access Statistics for this article

International Journal of Systems Science is currently edited by Visakan Kadirkamanathan

More articles in International Journal of Systems Science from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().