اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAsymptotic Word Length of Random Walks on HNN Extensions
59
0
0.0
(
0
)
تأليف
Lorenz A. Gilch
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the generalised word length is derived. Finally, we show that the rate of escape, which can be regarded as a function in the finitely many parameters which describe the random walk, behaves as a real-analytic function in terms of probability measures of constant support.
قيم البحث
اقرأ أيضاً
We study the asymptotic behaviour of random walks on topological abelian groups $G$. Our main result is a sufficient condition for one random walk to overtake another in the stochastic order induced by any suitably large positive cone $G_+ subseteq G
$, assuming that both walks have Radon distributions and compactly supported steps. We explain in which sense our sufficient condition is very close to a necessary one. Our result is a direct application of a recently proven theorem of real algebra, namely a Positivstellensatz for preordered semirings. It is due to Aubrun and Nechita in the one-dimensional case, but new already for $R^n$ with $n > 1$. We use our result to derive a formula for the rate at which the probabilities of a random walk decay relative to those of another, again for walks on $G$ with compactly supported Radon steps. In the case where one walk is a constant, this formula specializes to a version of Cramers large deviation theorem.
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant support, whi
ch describe the random walk. This setting applies, in particular, to random walks on virtually free groups.
In this article we prove existence of the asymptotic entropy for isotropic random walks on regular Fuchsian buildings. Moreover, we give formulae for the asymptotic entropy, and prove that it is equal to the rate of escape of the random walk with res
pect to the Green distance. When the building arises from a Fuchsian Kac-Moody group our results imply results for random walks induced by bi-invariant measures on these groups, however our results are proven in the general setting without the assumption of any group acting on the building. The main idea is to consider the retraction of the isotropic random walk onto an apartment of the building, to prove existence of the asymptotic entropy for this retracted walk, and to `lift this in order to deduce the existence of the entropy for the random walk on the building.
We study random walks on the giant component of the ErdH{o}s-Renyi random graph ${cal G}(n,p)$ where $p=lambda/n$ for $lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Ko
zma and Wormald, to have order $log^2 n$. We prove that starting from a uniform vertex (equivalently, from a fixed vertex conditioned to belong to the giant) both accelerates mixing to $O(log n)$ and concentrates it (the cutoff phenomenon occurs): the typical mixing is at $( u {bf d})^{-1}log n pm (log n)^{1/2+o(1)}$, where $ u$ and ${bf d}$ are the speed of random walk and dimension of harmonic measure on a ${rm Poisson}(lambda)$-Galton-Watson tree. Analogous results are given for graphs with prescribed degree sequences, where cutoff is shown both for the simple and for the non-backtracking random walk.
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition kernels w
ithout the assumption of uniform ellipticity or nearest-neighbour jumps. Specifically, we obtain a strong law of large numbers, a functional central limit theorem and large deviation estimates for the position of the random walker under the annealed law in a high density regime. The main obstacle is the intrinsic lack of monotonicity in higher-dimensional, non-nearest neighbour settings. Here we develop more general renormalization and renewal schemes that allow us to overcome this issue. As a second application of our methods, we provide an alternative proof of the ballistic behaviour of the front of (the discrete-time version of) the infection model introduced in [23].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
