language-icon Old Web
English
Sign In

Fastest random walk on a path

2019 
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 vert...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    7
    References
    13
    Citations
    NaN
    KQI
    []