Related papers: Quenched large deviations for randomly weighted ge…
We consider the set M_n of all n-truncated power moment sequences of probability measures on [0,1]. We endow this set with the uniform probability. Picking randomly a point in M_n, we show that the upper canonical measure associated with…
Recently observation of random walks in complex environments like the cell and other glassy systems revealed that the spreading of particles, at its tails, follows a spatial exponential decay instead of the canonical Gaussian. We use the…
We study variable-speed random walks on $\mathbb Z$ driven by a family of nearest-neighbor time-dependent random conductances $\{a_t(x,x+1)\colon x\in\mathbb Z, t\ge0\}$ whose law is assumed invariant and ergodic under space-time shifts. We…
We establish large deviations properties valid for almost every sample path of a class of stationary mixing processes $(X_1,..., X_n,...)$. These properties are inherited from those of $S_n=\sum_{i=1}^nX_i$ and describe how the local…
We study continuous time random walks on $\mathbb{Z}^d$ (with $d \geq 2$) among random conductances $\{ \omega(\{x,y\}) : x,y \in \mathbb{Z}^d\}$ that permit jumps of arbitrary length. The law of the random variables $\omega(\{x,y\})$,…
We establish a large-deviations principle for the largest eigenvalue of a generalized sample covariance matrix, meaning a matrix proportional to $Z^T \Gamma Z$, where $Z$ has i.i.d. real or complex entries and $\Gamma$ is not necessarily…
The goal of these notes is to fill some gaps in the literature about random walks in the Cauchy domain of attraction, which has been in many cases left aside because of its additional technical difficulties. We prove here several results in…
We establish a strong law of large numbers for one-dimensional continuous-time random walks in dynamic random environments under two main assumptions: the environment is required to satisfy a decoupling inequality that can be interpreted as…
Geodesics become an essential element of the geometry of a semi-Riemannian manifold. In fact, their differences and similarities with the (positive definite) Riemannian case, constitute the first step to understand semi-Riemannian Geometry.…
Using coordinate-free basic operators on toy Fock spaces \cite{AP}, quantum random walks are defined following the ideas in \cite{LP,AP}. Strong convergence of quantum random walks associated with bounded structure maps is proved under…
We consider random walk with bounded jumps on a hypercubic lattice of arbitrary dimension in a dynamic random environment. The environment is temporally independent and spatially translation invariant. We study the rate functions of the…
We study a continuous time random walk, $X$, on ${\mathbb{Z}}^d$ in an environment of random conductances taking values in $(0,\infty)$. We assume that the law of the conductances is ergodic with respect to space shifts. We prove a quenched…
We show an upper large deviation bound on the scale of the mean for a symmetric random walk in the plane with finite sixth moment. This result complements the study of Van den Berg, Bolthausen and Den Hollander, where the continuum case of…
Recent works have shown that high probability metrics with stochastic gradient descent (SGD) exhibit informativeness and in some cases advantage over the commonly adopted mean-square error-based ones. In this work we provide a formal…
Geodesics escape is widely used to study the scattering of hyperbolic equations. However, there are few progresses except in a simply connected complete Riemannian manifold with nonpositive curvature. We propose a kind of complete…
Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
Floating random walk-based capacitance extraction has emerged in recent years as a tried and true approach for extracting parasitic capacitance in very large scale integrated circuits. Being a Monte Carlo method, its performance is…
We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed ("averaged")…
In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…