Locally Markov walks on finite graphs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Kaiser, Robin, Levine, Lionel, Sava-Huss, Ecaterina
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866908682719068160
author Kaiser, Robin
Levine, Lionel
Sava-Huss, Ecaterina
author_facet Kaiser, Robin
Levine, Lionel
Sava-Huss, Ecaterina
contents Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We introduce the concept of locally Markov walks and we describe their stationary distribution and recurrent states, and we prove several properties such as irreducibility and ergodicity. For a particular locally Markov walk - the uniform unicycle walk on the complete graph - we investigate the mixing time and we prove that it exhibits cutoff.
format Preprint
id arxiv_https___arxiv_org_abs_2412_13766
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Locally Markov walks on finite graphs
Kaiser, Robin
Levine, Lionel
Sava-Huss, Ecaterina
Probability
Combinatorics
60J10, 37A25, 05C81, 15A18
Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We introduce the concept of locally Markov walks and we describe their stationary distribution and recurrent states, and we prove several properties such as irreducibility and ergodicity. For a particular locally Markov walk - the uniform unicycle walk on the complete graph - we investigate the mixing time and we prove that it exhibits cutoff.
title Locally Markov walks on finite graphs
topic Probability
Combinatorics
60J10, 37A25, 05C81, 15A18
url https://arxiv.org/abs/2412.13766