Pages that link to "Item:Q603129"
From MaRDI portal
The following pages link to Fastest expected time to mixing for a Markov chain on a directed graph (Q603129):
Displayed 16 items.
- Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs (Q513241) (← links)
- Alleviating road network congestion: traffic pattern optimization using Markov chain traffic assignment (Q1654365) (← links)
- Kemeny's constant and the effective graph resistance (Q2408952) (← links)
- Lower bounds for the Estrada index using mixing time and Laplacian spectrum (Q2439540) (← links)
- Generalized inverses of Markovian kernels in terms of properties of the Markov chain (Q2451649) (← links)
- The minimum coefficient of ergodicity for a Markov chain with a given directed graph (Q2451657) (← links)
- Load balancing for Markov chains with a specified directed graph (Q2929487) (← links)
- A Google-like model of road network dynamics and its application to regulation and control (Q3015166) (← links)
- The Hitting Time of Multiple Random Walks (Q3185674) (← links)
- Kemeny's Constant And An Analogue Of Braess' Paradox For Trees (Q3186700) (← links)
- Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices (Q4908206) (← links)
- Analysis of Markov Influence Graphs (Q5126639) (← links)
- A Structured Condition Number for Kemeny's Constant (Q5210986) (← links)
- The Role of Kemeny's Constant in Properties of Markov Chains (Q5419650) (← links)
- Random Walks, Directed Cycles, and Markov Chains (Q5872079) (← links)
- On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival (Q6086701) (← links)