相关论文: Ultrametric and tree potential

We introduce and study a family of Markov processes on partitions. The processes preserve the so-called z-measures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the…

First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…

Phrase structure trees have a hierarchical structure. In many subjects, most notably in Taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which…

It is proved that the Green's function of a symmetric finite range random walk on a co-compact Fuchsian group decays exponentially in distance at the radius of convergence R. It is also shown that Ancona's inequalities extend to R, and…

An inequality of K. Marton shows that the joint distribution of a Markov chain with uniformly contracting transition kernels exhibits concentration. We prove an analogous inequality for broadcast models on finite trees. We use this…

Let $\mathcal{U}$ be the uniform spanning tree on $\mathbb{Z}^3$, whose probability law is denoted by $\mathbf{P}$. For $\mathbf{P}$-a.s. realization of $\mathcal{U}$, the recurrence of the the simple random walk on $\mathcal{U}$ is proved…

We derive a graph expansion for the thermal partition function of solvable two-dimensional models with boundaries. This expansion of the integration measure over the virtual particles winding around the time cycle is obtained with the help…

We introduce a family of two-dimensional reflected random walks in the positive quadrant and study their Martin boundary. While the minimal boundary is systematically equal to a union of two points, the full Martin boundary exhibits an…

A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…

We survey the definition and some elementary properties of real trees. There are no new results, as far as we know. One purpose is to give a number of different definitions and show the equivalence between them. We discuss also, for…

In practical situations, the tree ensemble is one of the most popular models along with neural networks. A soft tree is a variant of a decision tree. Instead of using a greedy method for searching splitting rules, the soft tree is trained…

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

We develop a martingale approximation approach to studying the limiting behavior of quadratic forms of Markov chains. We use the technique to examine the asymptotic behavior of lag-window estimators in time series and we apply the results…

The affine group of a tree is the group of the isometries of a homogeneous tree that fix an end of its boundary. Consider a probability measure on this group and the associated random walk. The main goal of this paper is to determine the…

We develop an idempotent version of probabilistic potential theory. The goal is to describe the set of max-plus harmonic functions, which give the stationary solutions of deterministic optimal control problems with additive reward. The…

For different reversible Markov kernels on finite state spaces, we look for families of probability measures for which the time evolution almost remains in their convex hull. Motivated by signal processing problems and metastability studies…

It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…