Related papers: On large intersection and self-intersection local …
We investigate the large intersection properties of the set of points that are approximated at a certain rate by a family of affine subspaces. We then apply our results to various sets arising in the metric theory of Diophantine…
Yang et al. (2016) proved that the symmetric random walk Metropolis--Hastings algorithm for Bayesian variable selection is rapidly mixing under mild high-dimensional assumptions. We propose a novel MCMC sampler using an informed proposal…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation type algorithm, recently proposed. At each time step k, the…
For a given one-dimensional random walk $\{S_n\}$ with a subexponential step-size distribution, we present a unifying theory to study the sequences $\{x_n\}$ for which $\mathsf{P}\{S_n>x\}\sim n\mathsf{P}\{S_1>x\}$ as $n\to\infty$ uniformly…
Strong theorems are given for the maximal local time on balls and subspaces for the $d$-dimensional simple symmetric random walk.
In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is a large finite connected weighted graph, and relate it to…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting…
Consider an intersection measure $\ell_t ^{\mathrm{IS}}$ of $p$ independent (possibly different) $m$-symmetric Hunt processes up to time $t$ in a metric measure space $E$ with a Radon measure $m$. We derive a Donsker-Varadhan type large…
We obtain sharp upper and lower bounds for the moderate deviations of the volume of the range of a random walk in dimension five and larger. Our results encompass two regimes: a Gaussian regime for small deviations, and a stretched…
The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walks, time changed by a discrete quadratic variation process. One basis of this is a similar…
We give abstract versions of the large deviation theorem for the distribution of zeros of polynomials and apply them to the characteristic polynomials of Hermitian random matrices. We obtain new estimates related to the local semi-circular…
Socioeconomic segregation is considered one of the main factors behind the emergence of large-scale inequalities in urban areas, and its characterisation is an active area of research in urban studies. There are currently many available…
Suppose X and Y are two independent irreducible Markov chains on n states. We consider the intersection time, which is the first time their trajectories intersect. We show for reversible and lazy chains that the total variation mixing time…
Consider p independent Brownian motions in R^d, each running up to its first exit time from an open domain B, and their intersection local time l as a measure on B. We give a sharp criterion for the finiteness of exponential moments,…
We introduce the notion of \emph{localization at the boundary} for conditioned random walks in i.i.d. and uniformly elliptic random environment on $\mathbb{Z}^d$, in dimensions two and higher. Informally, this means that the walk spends a…