اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRandom walks on torus and random interlacements: Macroscopic coupling and phase transition
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For $dge 3$ we construct a new coupling of the trace left by a random walk on a large $d$-dimensional discrete torus with the random interlacements on $mathbb Z^d$. This coupling has the advantage of working up to macroscopic subsets of the torus. As an application, we show a sharp phase transition for the diameter of the component of the vacant set on the torus containing a given point. The threshold where this phase transition takes place coincides with the critical value $u_*(d)$ of random interlacements on $mathbb Z^d$. Our main tool is a variant of the soft-local time coupling technique of [PT12].
قيم البحث
اقرأ أيضاً
We consider the model of random interlacements on transient graphs, which was first introduced by Sznitman [Ann. of Math. (2) (2010) 171 2039-2087] for the special case of ${mathbb{Z}}^d$ (with $dgeq3$). In Sznitman [Ann. of Math. (2) (2010) 171 2039
-2087], it was shown that on ${mathbb{Z}}^d$: for any intensity $u>0$, the interlacement set is almost surely connected. The main result of this paper says that for transient, transitive graphs, the above property holds if and only if the graph is amenable. In particular, we show that in nonamenable transitive graphs, for small values of the intensity u the interlacement set has infinitely many infinite clusters. We also provide examples of nonamenable transitive graphs, for which the interlacement set becomes connected for large values of u. Finally, we establish the monotonicity of the transition between the disconnected and the connected phases, providing the uniqueness of the critical value $u_c$ where this transition occurs.
Let $mathbb{T}^d_N$, $dge 2$, be the discrete $d$-dimensional torus with $N^d$ points. Place a particle at each site of $mathbb{T}^d_N$ and let them evolve as independent, nearest-neighbor, symmetric, continuous-time random walks. Each time two parti
cles meet, they coalesce into one. Denote by $C_N$ the first time the set of particles is reduced to a singleton. Cox [6] proved the existence of a time-scale $theta_N$ for which $C_N/theta_N$ converges to the sum of independent exponential random variables. Denote by $Z^N_t$ the total number of particles at time $t$. We prove that the sequence of Markov chains $(Z^N_{ttheta_N})_{tge 0}$ converges to the total number of partitions in Kingmans coalescent.
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 introduce the model of two-dimensional continuous random interlacements, which is constructed using the Brownian trajectories conditioned on not hitting a fixed set (usually, a disk). This model yields the local picture of Wiener sausage on the to
rus around a late point. As such, it can be seen as a continuous analogue of discrete two-dimensional random interlacements [Comets, Popov, Vachkovskaia, 2016]. At the same time, one can view it as (restricted) Brownian loops through infinity. We establish a number of results analogous to these of [Comets, Popov, Vachkovskaia, 2016; Comets, Popov, 2016], as well as the results specific to the continuous case.
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].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
