Related papers: $p$-adic boundary laws and Markov chains on trees
In the present paper we study forward Quantum Markov Chains (QMC) defined on Cayley tree. A construction of such QMC is provided, namely we construct states on finite volumes with boundary conditions, and define QMC as a weak limit of those…
In this paper adapting to $p$-adic case some methods of real valued Gibbs measures on Cayley trees we construct several $p$-adic distributions on the set $\mathbb{Z}_p$ of $p$-adic integers. Moreover, we give conditions under which these…
We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…
The main aim of the present paper is to prove the existence of a phase transition in quantum Markov chain (QMC) scheme for the Ising type models on a Cayley tree. Note that this kind of models do not have one-dimensional analogous, i.e. the…
R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…
We consider a nearest-neighbor $p$-adic $\l$-model with spin values $\pm 1$ on a Cayley tree of order $k\geq 1$. We prove for the model there is no phase transition and as well as the unique $p$-adic Gibbs measure is bounded if and only if…
We consider matrices on infinite trees which are universal covers of Jacobi matrices on finite graphs. We are interested in the question of the existence of sequences of finite covers whose normalized eigenvalue counting measures converge…
We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…
In the present paper we consider countable state $p$-adic Potts model on the Cayley tree. A construction of $p$-adic Gibbs measures which depends on weights $\l$ is given, and an investigation of such measures is reduced to examination of…
We prove an apparently novel concentration of measure result for Markov tree processes. The bound we derive reduces to the known bounds for Markov processes when the tree is a chain, thus strictly generalizing the known Markov process…
In the present paper we provide a new construction of measure, called $p$-adic quasi Gibbs measure, for countable state of $p$-adic Potts model on the Cayley tree. Such a construction depends on a parameter $\frak{p}$ and wights. In…
We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
We examine the behavior of the sequences of $p$-adic valuations of quadratic polynomials with integer coefficients for an odd prime $p$ through tree representations. Under this representation, a finite tree corresponds to a periodic…
We derive some key extremal features for $k$th order Markov chains that can be used to understand how the process moves between an extreme state and the body of the process. The chains are studied given that there is an exceedance of a…
A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the…
We consider a population with non-overlapping generations, whose size goes to infinity. It is described by a discrete genealogy which may be time non-homogeneous and we pay special attention to branching trees in varying environments. A…
A sequence of real numbers (x_n) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (x_n) are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov…
The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous's Brownian continuum random tree, the…