Let $\{B(ξ_n,r_n)\}_{n\ge1}$ be a sequence of random balls whose centers $\{ξ_n\}_{n\ge1}$ is a stationary process, and $\{r_n\}_{n\ge1}$ is a sequence of positive numbers decreasing to 0. Our object is the random covering set $E=\limsup\limits_{n\to\infty}B(ξ_n,r_n)$, that is, the points covered by $B(ξ_n,r_n)$ infinitely often. The sizes of $E$ are investigated from the viewpoint of measure, dimension and topology.
We consider the superposition of symmetric simple exclusion dynamics speeded-up in time, with spin-flip dynamics in a one-dimensional interval with periodic boundary conditions. We show that the mixing time has an exponential lower bound in the system size if the potential of the hydrodynamic equation has more than two local minima. We also apply our estimates to show that the normalized hitting times of rare events converge to a mean one exponential random variable if the potential has a unique minimum.
In this paper we establish a general dynamical Central Limit Theorem (CLT) for group actions which are exponentially mixing of all orders. In particular, the main result applies to Cartan flows on finite-volume quotients of simple Lie groups. Our proof uses a novel relativization of the classical method of cumulants, which should be of independent interest. As a sample application of our techniques, we show that the CLT holds along lacunary samples of the horocycle flow on finite-area hyperbolic surfaces applied to any smooth compactly supported function.
In this paper, we construct a natural probability measure on the space of real branched coverings from a real projective algebraic curve $(X,c_X)$ to the projective line $(\mathbb{C}\mathbb{P}^1,\textrm{conj})$. We prove that the space of degree $d$ real branched coverings having "many" real branched points (for example more than $\sqrt{d}^{1+α}$, for any $α>0$) has exponentially small measure. In particular, maximal real branched coverings, that is real branched coverings such that all the branched points are real, are exponentially rare.
Swendsen-Wang dynamics for the Potts model was proposed in the late 1980's as an alternative to single-site heat-bath dynamics, in which global updates allow this MCMC sampler to switch between metastable states and ideally mix faster. Gore and Jerrum (1999) found that this dynamics may in fact exhibit slow mixing: they showed that, for the Potts model with $q\geq 3$ colors on the complete graph on $n$ vertices at the critical point $β_c(q)$, Swendsen-Wang dynamics has $t_{\mathrm{mix}}\geq \exp(c\sqrt n)$. The same lower bound was extended to the critical window $(β_s,β_S)$ around $β_c$ by Ga…
In this note we (in particular) prove an almost sure invariance principle (ASIP) for non-stationary and uniformly bounded sequences of random variables which are exponentially fast $ϕ$-mixing. The obtained rate is of order $o(V_n^{\frac14+\del})$ for an arbitrary $\del>0$, where $V_n$ is the variance of the underlying partial sums $S_n$. For certain classes of inhomogeneous Markov chains we also prove a vector-valued ASIP with similar rates.
In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in [5] that such probability decays exponentially with respect to $N$. For $d=3$, however, the same technique does not apply, and in this paper we obtain a slightly weaker upper bound: $\forall \varepsilon>0,\exists c_\varepsilon>0,$ $$P\left({\rm Trace}(\mathcal{P})\subseteq {\rm Trace}\big(\{X_n\}_{n=0}^\infty\big) \right)\le \exp\left(-c_\varepsilon N\log^{…
We prove that random walks in random environments, that are exponentially mixing in space and time, are almost surely diffusive, in the sense that their scaling limit is given by the Wiener measure.
We derive asymptotics for the probability of the origin to be an extremal point of a random walk in R^n. We show that in order for the probability to be roughly 1/2, the number of steps of the random walk should be between e^{c n / log n}$ and e^{C n log n}. As a result, we attain a bound for the ?pi/2-covering time of a spherical brownian motion.
Central limit theorems for linear statistics of lattice random fields (including spin models) are usually proven under suitable mixing conditions or quasi-associativity. Many interesting examples of spin models do not satisfy mixing conditions, and on the other hand, it does not seem easy to show central limit theorem for local statistics via quasi-associativity. In this work, we prove general central limit theorems for local statistics and exponentially quasi-local statistics of spin models on discrete Cayley graphs with polynomial growth. Further, we supplement these results by proving simil…
Let $(X,\mathscr{B}, μ,T,d)$ be a measure-preserving dynamical system with exponentially mixing property, and let $μ$ be an Ahlfors $s$-regular probability measure. The dynamical covering problem concerns the set $E(x)$ of points which are covered by the orbits of $x\in X$ infinitely many times. We prove that the Hausdorff dimension of the intersection of $E(x)$ and any regular fractal $G$ equals $\dim_{\rm H}G+α-s$, where $α=\dim_{\rm H}E(x)$ $μ$--a.e. Moreover, we obtain the packing dimension of $E(x)\cap G$ and an estimate for $\dim_{\rm H}(E(x)\cap G)$ for any analytic set $G$.
We show that mixing for local, reversible dynamics of mean field spin glasses is exponentially slow in the low temperature regime. We introduce a notion of free energy barriers for the overlap, and prove that their existence imply that the spectral gap is exponentially small, and thus that mixing is exponentially slow. We then exhibit sufficient conditions on the equilibrium Gibbs measure which guarantee the existence of these barriers, using the notion of replicon eigenvalue and 2D Guerra Talagrand bounds. We show how these sufficient conditions cover large classes of Ising spin models for re…
We deduce almost-sure exponentially fast mixing of passive scalars advected by solutions of the stochastically-forced 2D Navier-Stokes equations and 3D hyper-viscous Navier-Stokes equations in $\mathbb T^d$ subjected to non-denegenerate $H^σ$-regular noise for any $σ$ sufficiently large. That is, for all $s > 0$ there is a deterministic exponential decay rate such that all mean-zero $H^s$ passive scalars decay in $H^{-s}$ at this same rate with probability one. This is equivalent to what is known as \emph{quenched correlation decay} for the Lagrangian flow in the dynamical systems literature. …
Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs. Sampling from these distributions is crucial for parameter estimation hypothesis testing, and more generally for understanding basic features of the network model itself. In practice sampling is typically carried out using Markov chain Monte Carlo, in particular either the Glauber dynamics or the Metropolis-Hasting procedure. In this paper we characterize the high …
We consider the question of exponential mixing for random dynamical systems on arbitrary compact manifolds without boundary. We put forward a robust, dynamics-based framework that allows us to construct space-time smooth, uniformly bounded in time, universal exponential mixers. The framework is then applied to the problem of proving exponential mixing in a classical example proposed by Pierrehumbert in 1994, consisting of alternating periodic shear flows with randomized phases. This settles a longstanding open problem on proving the existence of a space-time smooth (universal) exponentially mi…
In this paper we consider the problem of sampling from the low-temperature exponential random graph model (ERGM). The usual approach is via Markov chain Monte Carlo, but Bhamidi et al. showed that any local Markov chain suffers from an exponentially large mixing time due to metastable states. We instead consider metastable mixing, a notion of approximate mixing relative to the stationary distribution, for which it turns out to suffice to mix only within a collection of metastable states. We show that the Glauber dynamics for the ERGM at any temperature -- except at a lower-dimensional critical…
We consider the random walk on a simple point process on $\Bbb{R}^d$, $d\geq2$, whose jump rates decay exponentially in the $α$-power of jump length. The case $α=1$ corresponds to the phonon-induced variable-range hopping in disordered solids in the regime of strong Anderson localization. Under mild assumptions on the point process, we show, for $α\in(0,d)$, that the random walk confined to a cubic box of side $L$ has a.s. Cheeger constant of order at least $L^{-1}$ and mixing time of order $L^2$. For the Poisson point process, we prove that at $α=d$, there is a transition from diffusive to su…
We consider randomly forced 2D Navier-Stokes equations in a bounded domain with smooth boundary. It is assumed that the random perturba- tion is non-degenerate, and its law is periodic in time and has a support localised with respect to space and time. Concerning the unperturbed problem, we assume that it is approximately controllable in infinite time by an external force whose support is included in that of the random force. Under these hypotheses, we prove that the Markov process generated by the restriction of solutions to the instants of time proportional to the period possesses a unique s…
We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup $H$. We further assume that $H$ is not consisting only of lifts with respect to any one covering. Then we prove that the probability that such a random walk gives a non-minimal mapping class in its fibered commensurability class decays exponentially. As an application of the minimality, we prove that for the case where a surface has at least one puncture, the probability that a ran…
In this paper we show how to apply classical probabilistic tools for partial sums $\sum_{j=0}^{n-1}φ\circτ^j$ generated by a skew product $τ$, built over a sufficiently well mixing base map and a random expanding dynamical system. Under certain regularity assumptions on the observable $φ$, we obtain a central limit theorem (CLT) with rates, a functional CLT, an almost sure invariance principle (ASIP), a moderate deviations principle, several exponential concentration inequalities and Rosenthal type moment estimates for skew products with $α, ϕ$ or $ψ$ mixing base maps and expanding on the aver…
Exponential random graph models have become increasingly important in the study of modern networks ranging from social networks, economic networks, to biological networks. They seek to capture a wide variety of common network tendencies such as connectivity and reciprocity through local graph properties. Sampling from these exponential distributions is crucial for parameter estimation, hypothesis testing, as well as understanding the features of the network in question. We inspect the efficiency of a popular sampling technique, the Glauber dynamics, for vertex-weighted exponential random graph…
