English
Related papers

Related papers: $p$-adic boundary laws and Markov chains on trees

200 papers

Consider a Markov chain $(\xi_v)_{v \in V} \in [k]^V$ on the infinite $b$-ary tree $T = (V,E)$ with irreducible edge transition matrix $M$, where $b \geq 2$, $k \geq 2$ and $[k] = \{1,...,k\}$. We denote by $L_n$ the level-$n$ vertices of…

Probability · Mathematics 2011-09-07 Yuval Peres , Sebastien Roch

We investigate an infinite array of point interactions of the same strength in R^d, d=2,3, situated at vertices of a polygonal curve with a fixed edge length. We demonstrate that if the curve is not a line, but it is asymptotically straight…

Mathematical Physics · Physics 2020-01-17 Pavel Exner

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

Probability · Mathematics 2019-12-25 Vincent Beffara , Cong Bang Huynh

The evolution of aligned DNA sequence sites is generally modeled by a Markov process operating along the edges of a phylogenetic tree. It is well known that the probability distribution on the site patterns at the tips of the tree…

Populations and Evolution · Quantitative Biology 2013-10-15 Benny Chor , Mike Steel

We continue the analysis of nontrivial examples of quantum Markov processes. This is done by applying the construction of entangled Markov chains obtained from classical Markov chains with infinite state--space. The formula giving the joint…

Operator Algebras · Mathematics 2007-05-23 Francesco Fidaleo

In this paper we investigate generalized Gibbs measure (GGM) for $p$-adic Hard-Core(HC) model with a countable set of spin values on a Cayley tree of order $k\geq 2$. This model is defined by $p$-adic parameters $\lambda_i$, $i\in \mathbb…

Functional Analysis · Mathematics 2022-07-12 U. A. Rozikov , I. A. Sattarov , A. M. Tukhtabaev

In the present paper, we give some examples of stochastic differential equations which have delicateness in the Markov and strong Markov properties, the uniqueness locally in time and globally in time, and initial conditions. Moreover, we…

Probability · Mathematics 2022-09-14 Seiichiro Kusuoka

In this paper we prove that the lack of uniqueness for solutions of the tree dyadic model of turbulence is overcome with the introduction of a suitable noise. The uniqueness is a weak probabilistic uniqueness for all $l^2$-initial…

Probability · Mathematics 2015-10-15 Luigi Amedeo Bianchi

We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…

Data Structures and Algorithms · Computer Science 2013-01-16 Mong-Jen Kao , Der-Tsai Lee , Dorothea Wagner

The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…

Number Theory · Mathematics 2023-08-24 Dillon Snyder

We consider a sequence of Markov chains $(\mathcal X^n)_{n=1,2,...}$ with $\mathcal X^n = (X^n_\sigma)_{\sigma\in\mathcal T}$, indexed by the full binary tree $\mathcal T = \mathcal T_0 \cup \mathcal T_1 \cup ...$, where $\mathcal T_k$ is…

Probability · Mathematics 2014-06-17 Peter Czuppon , Peter Pfaffelhuber

We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…

Probability · Mathematics 2014-09-08 Louigi Addario-Berry , Nicolas Broutin , Cecilia Holmgren

A standard way of justifying that a certain probabilistic property holds in a system is to provide a witnessing subsystem (also called critical subsystem) for the property. Computing minimal witnessing subsystems is NP-hard already for…

Logic in Computer Science · Computer Science 2021-09-20 Simon Jantsch , Jakob Piribauer , Christel Baier

Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for…

Logic in Computer Science · Computer Science 2017-09-08 Lisa Hutschenreiter , Christel Baier , Joachim Klein

This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov…

Probability · Mathematics 2019-07-02 Roy Cerqueti , Emilio De Santis

The complete set of Eigenstates and Eigenvalues of the nearest neighbour tight binding model on a Cayley tree with branching number $b=2$ and $M$ branching generations with open boundary conditions is derived. We find that of the $N= 1 +3…

Mesoscale and Nanoscale Physics · Physics 2020-11-03 Deepak Aryal , Stefan Kettemann

Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…

Probability · Mathematics 2024-10-24 Rodrigo B. Alves , Yuri F. Saporito , Luiz M. Carvalho

Product-form stationary distributions in Markov chains have been a foundational advance and driving force in our understanding of stochastic systems. In this paper, we introduce a new product-form relationship that we call "graph-based…

Probability · Mathematics 2025-11-03 Céline Comte , Isaac Grosof

We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…

Probability · Mathematics 2013-09-24 Douglas Rizzolo

This paper studies Hoeffding's inequality for Markov chains under the generalized concentrability condition defined via integral probability metric (IPM). The generalized concentrability condition establishes a framework that interpolates…

Machine Learning · Statistics 2023-10-06 Hao Chen , Abhishek Gupta , Yin Sun , Ness Shroff
‹ Prev 1 8 9 10 Next ›