相关论文: Ultrametric and tree potential

Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…

The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a…

For a class of integral operators with kernels metric functions on manifold we find some necessary and sufficient conditions to have finite rank. The problem we pose has a stochastic nature and boils down to the following alternative…

In the first part of the article our subject of interest is a simple symmetric random walk on the integers which faces a random risk to be killed. This risk is described by random potentials, which in turn are defined by a sequence of…

Consider an irreducible Markov chain which satisfies a ratio limit theorem, and let $\rho$ be the spectral radius of the chain. We investigate the relation of the the $\rho\,$-Martin boundary with the boundary induced by the…

We investigate the spectral properties of balanced trees and dendrimers, with a view toward unifying and improving the existing results. Here we find a semi-factorized formula for their characteristic polynomials. Afterwards, we determine…

Kigami showed that a transient random walk on a deterministic infinite tree $T$ induces its trace process on the Martin boundary of $T$. In this paper, we will deal with trace processes on Martin boundaries of random trees instead of…

We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…

We introduce and study a 2-parameter family of unitarily invariant probability measures on the space of infinite Hermitian matrices. We show that the decomposition of a measure from this family on ergodic components is described by a…

Tree kernels are fundamental tools that have been leveraged in many applications, particularly those based on machine learning for Natural Language Processing tasks. In this paper, we devise a parallel implementation of the sequential…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

A model for studying the ultrametricity of the energy landscape in a disordered heteropolymer is presented. It is treated as a simplified model of a protein molecule in which amino acid residues are modeled as point masses. Pairwise…

When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…

The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…

In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…

In this paper we study multi-matrix models whose potentials are perturbations of the quadratic potential associated with independent GUE random matrices. More precisely, we compute the free energy and the expectation of the trace of…

Strongly non-Gaussian ensembles of large random matrices possessing unitary symmetry and logarithmic level repulsion are studied both in presence and absence of hard edge in their energy spectra. Employing a theory of polynomials orthogonal…

We apply the matrix-tree theorem to establish a link between various diagrammatic and determinant expressions, which naturally appear in scattering amplitudes of gravity theories. Using this link we are able to give a general…

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…