Random walks on a tree and capacity in the interval
From MaRDI portal
Publication:1203114
zbMath0767.60061MaRDI QIDQ1203114
Publication date: 4 February 1993
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIHPB_1992__28_4_557_0
logarithmic energyharmonic measuresDiophantine approximation conditiongeometric criterion for transience of a random walk
Related Items
Continuum-sites stepping-stone models, coalescing exchangeable partitions and random trees, On the speed of random walks on graphs., Tree-indexed random walks on groups and first passage percolation, Riesz capacities of a set due to Dobiński, Heat kernel and Green kernel comparison theorems for infinite graphs, Greedy Search on the Binary Tree with Random Edge-Weights, Capacity and principal eigenvalues: The method of enlargement of obstacles revisited, Intersection-equivalence of Brownian paths and certain branching processes, Limit distributions of branching Markov chains, The Dirichlet problem at infinity for random walks on graphs with a strong isoperimetric inequality, On the Hausdorff dimension of fibres, Invariance of Capacity Under Quasisymmetric Maps of the Circle: An Easy Proof, Capacity of shrinking condensers in the plane, Potential theory on trees, graphs and Ahlfors-regular metric spaces, The Poisson boundary of covering Markov operators, Unnamed Item, Graphs of finite measure
