Long range random walks and associated geometries on groups of polynomial growth

نویسندگان

چکیده

In the context of countable groups polynomial volume growth, we consider a large class random walks that are allowed to take long jumps along multiple subgroups according power law distributions. For such walk, study time behavior its probability return at n in terms key parameters describing driving measure and structure underlying group. We obtain assorted estimates including near-diagonal two-sided Hölder continuity solutions associated discrete parabolic difference equation. each case, these involve construction geometry adapted walk.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random walks under slowly varying moment conditions on groups of polynomial volume growth

Let G be a finitely generated group of polynomial volume growth equipped with a word-length | · |. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures μ such that, for any ǫ > 0, ∑ | · |ǫμ = ∞. In particular, we provide a sharp lower bound for the return probability in the case when μ has a finite weak-logarithmic moment.

متن کامل

Random walks with long-range self-repulsion on proper time

We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent ν are obtained. They are in good agreement with Monte Carlo simulations in two dimensions. A numerical study of the scaling functions and of the efficiency of the algorithm is also presented.

متن کامل

Long-Range Navigation on Complex Networks using Lévy Random Walks

We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long...

متن کامل

Random Walks on Finite Groups

Markov chains on finite sets are used in a great variety of situations to approximate, understand and sample from their limit distribution. A familiar example is provided by card shuffling methods. From this viewpoint, one is interested in the “mixing time” of the chain, that is, the time at which the chain gives a good approximation of the limit distribution. A remarkable phenomenon known as t...

متن کامل

“ Isoperimetry on Solvable Groups and Random Walks ”

We exhibit a large class of locally compact amenable groups having the same isoperimetric profile and the same probability of return for random walks. This class of groups contains closed subgroups of triangular matrices over local fields and their quotients, but some of them are not linear. Abstract : In this talk, we introduce a variant of the isoperimetric profile on groups that we compute o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l'Institut Fourier

سال: 2022

ISSN: ['0373-0956', '1777-5310']

DOI: https://doi.org/10.5802/aif.3515