Zobrazeno 1 - 10
of 52
pro vyhledávání: '"60J10, 05C81"'
Autor:
Devriendt, Karel
Kemeny's constant is an invariant of discrete-time Markov chains, equal to the expected number of steps between two states sampled from the stationary distribution. It appears in applications as a concise characterization of the mixing properties of
Externí odkaz:
http://arxiv.org/abs/2405.20300
Autor:
Kim, Sooyeong, Madras, Neal
Let $G$ be a graph on $n$ vertices, with complement $\overline{G}$. The spectral gap of the transition probability matrix of a random walk on $G$ is used to estimate how fast the random walk becomes stationary. We prove that the larger spectral gap o
Externí odkaz:
http://arxiv.org/abs/2404.15167
In this paper we consider global $\theta$-curvatures of finite Markov chains with associated means $\theta$ in the spirit of the entropic curvature (based on the logarithmic mean) by Erbar-Maas and Mielke. As in the case of Bakry-\'Emery curvature, w
Externí odkaz:
http://arxiv.org/abs/2404.04581
Autor:
Breen, Jane, Kim, Sooyeong, Fung, Alexander Low, Mann, Amy, Parfeni, Andrei A., Tedesco, Giovanni
Kemeny's constant measures how fast a random walker moves around in a graph. Expressions for Kemeny's constant can be quite involved, and for this reason, many lines of research focus on graphs with structure that makes them amenable to more in-depth
Externí odkaz:
http://arxiv.org/abs/2310.08552
We study Nordhaus-Gaddum problems for Kemeny's constant $\mathcal{K}(G)$ of a connected graph $G$. We prove bounds on $\min\{\mathcal{K}(G),\mathcal{K}(\overline{G})\}$ and the product $\mathcal{K}(G)\mathcal{K}(\overline{G})$ for various families of
Externí odkaz:
http://arxiv.org/abs/2309.05171
On trees of fixed order, we show a direct relation between Kemeny's constant and Wiener index, and provide a new formula of Kemeny's constant from the relation with a combinatorial interpretation. Moreover, the relation simplifies proofs of several k
Externí odkaz:
http://arxiv.org/abs/2209.11271
Autor:
Markowsky, Greg, Palacios, José
In certain instances an electric network transforms in natural ways by the addition or removal of an edge. This can have interesting consequences for random walks, in light of the known relationships between electric resistance and random walks. We e
Externí odkaz:
http://arxiv.org/abs/2104.09706
Autor:
Sylvester, John
Publikováno v:
Statistics & Probability Letters, 187:109534, 2022
The cover time of a Markov chain on a finite state space is the expected time until all states are visited. We show that if the cover time of a discrete-time Markov chain with rational transitions probabilities is bounded, then it is a rational numbe
Externí odkaz:
http://arxiv.org/abs/2102.12356
Autor:
Bowditch, Adam, Tokushige, Yuki
We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is differentiab
Externí odkaz:
http://arxiv.org/abs/2006.03433
Autor:
Bates, Erik, Podder, Moumanti
A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be an avoidance coupling if the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in particula
Externí odkaz:
http://arxiv.org/abs/2001.11524