Markov chains on trees: almost lower and upper directed cases
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909384134623232 |
|---|---|
| author | Fredes, Luis Marckert, Jean-François |
| author_facet | Fredes, Luis Marckert, Jean-François |
| contents | The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be almost lower-directed if given $X_k$, $X_{k+1}$ is either an ancestor of $X_k$ or a child of $X_k$.
These models include nearest neighbor Markov chains on trees.
Under an irreducibility assumption, we show that every almost upper-directed transition matrix on infinite (locally finite) trees has some invariant measures. An invariant measure $π$ is expressed thanks to a determinantal formula. We give general explicit criteria for recurrence and positive recurrence. An efficient algorithm (the leaf addition algorithm) of independent interest allows $π$ to be computed on many trees, without resorting to linear algebra considerations.
Flajolet, in a series of papers, provided some relations between continuous fractions, generating functions of weighted Mötzkin paths, and used them in connection with the analysis of birth and death processes. These fruitful representations made it possible to establish many formulae for continuous fractions. Analogous considerations appear here: this type of study can be extended to weighted paths on trees, whose generating functions can also be expressed, this time in terms of multicontinuous fractions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07158 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Markov chains on trees: almost lower and upper directed cases Fredes, Luis Marckert, Jean-François Probability Combinatorics The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be almost lower-directed if given $X_k$, $X_{k+1}$ is either an ancestor of $X_k$ or a child of $X_k$. These models include nearest neighbor Markov chains on trees. Under an irreducibility assumption, we show that every almost upper-directed transition matrix on infinite (locally finite) trees has some invariant measures. An invariant measure $π$ is expressed thanks to a determinantal formula. We give general explicit criteria for recurrence and positive recurrence. An efficient algorithm (the leaf addition algorithm) of independent interest allows $π$ to be computed on many trees, without resorting to linear algebra considerations. Flajolet, in a series of papers, provided some relations between continuous fractions, generating functions of weighted Mötzkin paths, and used them in connection with the analysis of birth and death processes. These fruitful representations made it possible to establish many formulae for continuous fractions. Analogous considerations appear here: this type of study can be extended to weighted paths on trees, whose generating functions can also be expressed, this time in terms of multicontinuous fractions. |
| title | Markov chains on trees: almost lower and upper directed cases |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2411.07158 |