Searcharxiv⌕ Search

arXiv subjects

Jay Rosen

Publications and source records attributed to Jay Rosen.

51 records · Page 3Linked to original sources

$L^p$ moduli of continuity of Gaussian processes and local times of symmetric Lévy processes

Let $X=\{X(t),t\in R_+\}$ be a real-valued symmetric Lévy process with continuous local times $\{L^x_t,(t,x)\in R_+\times R\}$ and characteristic function $Ee^{iλX(t)}=e^{-tψ(λ)}$. Let \[σ^2_0(x-y)=\frac{4}π\int^{\infty}_0\frac{\sin^2({λ(x- y)}/{2})}{ψ(λ)} dλ.\] If $σ^2_0(h)$ is concave, and satisfies some additional very weak regularity conditions, then for any $p\ge1$, and all $t\in R_+$, \[\lim_{h\downar row0}\int_a^b\biggl|{\frac{L^{x+h}_t-L^x_t}{σ_0(h)}}\biggr|^p dx =2^{p/2}E|η|^p\int_a^b|L^x_t|^{p/2} dx\] for all $a,b$ in the extended real line almost surely, and also in $L^m$, $m\ge1$. (Here $η$ is a normal random variable with mean zero and variance one.) This result is obtained via the Eisenbaum Isomorphism Theorem and depends on the related result for Gaussian processes with stationary increments, $\{G(x),x\in R^1\}$, for which $E(G(x)-G(y))^2=σ_0^2(x-y)$; \[\lim_{h\to0}\int_a^b\biggl|\frac{G (x+h)-G(x)}{σ_0(h)}\biggr|^p dx=E|η|^p(b-a)\] for all $a,b\in R^1$, almost surely.

math.PR↗

How large a disc is covered by a random walk in n steps?

We show that the largest disc covered by a simple random walk (SRW) on $\mathbb{Z}^2$ after n steps has radius n^{1/4+o(1)}, thus resolving an open problem of Révész [Random Walk in Random and Non-Random Environments (1990) World Scientific, Teaneck, NJ]. For any fixed $\ell$, the largest disc completely covered at least $\ell$ times by the SRW also has radius n^{1/4+o(1)}. However, the largest disc completely covered by each of $\ell$ independent simple random walks on $\mathbb{Z}^2$ after $n$ steps is only of radius $n^{1/(2+2\sqrt{\ell})+o(1)}$. We complement this by showing that the radius of the largest disc completely covered at least a fixed fraction $α$ of the maximum number of visits to any site during the first $n$ steps of the SRW on $\mathbb{Z}^2$, is $n^{(1-\sqrtα)/4+o(1)}$. We also show that almost surely, for infinitely many values of $n$ it takes about $n^{1/2+o(1)}$ steps after step n for the SRW to reach the first previously unvisited site (and the exponent 1/2 is sharp). This resolves a problem raised by Révész [Ann. Probab. 21 (1993) 318--328].

math.PR↗

CLT for L^{p} moduli of continuity of Gaussian processes

Let G=\{G(x),x\in R^1\} be a mean zero Gaussian processes with stationary increments and set \si ^2(|x-y|)= E(G(x)-G(y))^2. Let f be a symmetric function with Ef(η)<\ff, where η=N(0,1). When \si^2(s) is concave or when \si^2(s)=s^r$, $1<r\leq 3/2 we have \lim_{h\downarrow 0}{\int_a^b f(\frac{G(x+h)-G(x)}{\si (h)}) dx - (b-a)Ef(η)\over \sqrt{Φ(h,\si(h),f,a,b)}}= N(0,1) in law where Φ(h,\si(h),f,a,b) is the variance of the numerator. This result continues to hold when \si^2(s)=s^r, 3/2<r<2, for certain functions f, depending on the nature of the coefficients in their Hermite polynomial expansion. The asymptotic behavior of Φ(h,\si(h),f,a,b) at zero, is described in a very large number of cases.

math.PR↗

Frequent points for random walks in two dimensions

For a symmetric random walk in $Z^2$ which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erdős-Taylor conjecture and obtain the asymptotics for the number of visits to the most visited site. We also obtain the asymptotics for the number of points which are visited very frequently by time $n$. Among the tools we use are Harnack inequalities and Green's function estimates for random walks with unbounded jumps; some of these are of independent interest.

math.PR↗

Late points for random walks in two dimensions

Let $\mathcal{T}_n(x)$ denote the time of first visit of a point $x$ on the lattice torus $\mathbb {Z}_n^2=\mathbb{Z}^2/n\mathbb{Z}^2$ by the simple random walk. The size of the set of $α$, $n$-late points $\mathcal{L}_n(α)=\{x\in \mathbb {Z}_n^2:\mathcal{T}_n(x)\geq α\frac{4}π(n\log n)^2\}$ is approximately $n^{2(1-α)}$, for $α\in (0,1)$ [$\mathcal{L}_n(α)$ is empty if $α>1$ and $n$ is large enough]. These sets have interesting clustering and fractal properties: we show that for $β\in (0,1)$, a disc of radius $n^β$ centered at nonrandom $x$ typically contains about $n^{2β(1-α/β^2)}$ points from $\mathcal{L}_n(α)$ (and is empty if $β<\sqrtα $), whereas choosing the center $x$ of the disc uniformly in $\mathcal{L}_n(α)$ boosts the typical number of $α, n$-late points in it to $n^{2β(1-α)}$. We also estimate the typical number of pairs of $α$, $n$-late points within distance $n^β$ of each other; this typical number can be significantly smaller than the expected number of such pairs, calculated by Brummelhuis and Hilhorst [Phys. A 176 (1991) 387--408]. On the other hand, our results show that the number of ordered pairs of late points within distance $n^β$ of each other is larger than what one might predict by multiplying the total number of late points, by the number of late points in a disc of radius $n^β$ centered at a typical late point.

math.PR↗

Moderate deviations for the range of planar random walks

Given a symmetric random walk in $Z^2$ with finite second moments, let $R_n$ be the range of the random walk up to time $n$. We study moderate deviations for $R_n -E R_n$ and $E R_n -R_n$. We also derive the corresponding laws of the iterated logarithm.

math.PR↗

Moderate deviations and laws of the iterated logarithm for the renormalized self-intersection local times of planar random walks

Let B_n be the number of self-intersections of a symmetric random walk with finite second moments in the integer planar lattice. We obtain moderate deviation estimates for B_n - E B_n and E B_n- B_n, which are given in terms of the best constant of a certain Gagliardo-Nirenberg inequality. We also prove the corresponding laws of the iterated logarithm.

math.PR↗

A random walk proof of the Erdos-Taylor conjecture

For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.

math.PR↗

Frequently visited sets for random walks

We study the occupation measure of various sets for a symmetric transient random walk in $Z^d$ with finite variances. Let $μ^X_n(A)$ denote the occupation time of the set $A$ up to time $n$. It is shown that $\sup_{x\in Z^d}μ_n^X(x+A)/\log n$ tends to a finite limit as $n\to\infty$. The limit is expressed in terms of the largest eigenvalue of a matrix involving the Green's function of $X$ restricted to the set $A$. Some examples are discussed and the connection to similar results for Brownian motion is given.

math.PR↗

An almost sure invariance principle for renormalized intersection local times

Let β_k(n) be the number of self-intersections of order k, appropriately renormalized, for a mean zero random walk X_n in Z^2 with 2+δmoments. On a suitable probability space we can construct X_n and a planar Brownian motion W_t such that for each k\geq 2, |β_k(n)-γ_k(n)|=O(n^{-a}), a.s. for some a>0 where γ_k(n) is the renormalized self-intersection local time of order k at time 1 for the Brownian motion W_{nt}/\sqrt n.

math.PR↗

An almost sure invariance principle for the range of planar random walks

For a symmetric random walk in $Z^2$ with $2+δ$ moments, we represent $|\mathcal{R}(n)|$, the cardinality of the range, in terms of an expansion involving the renormalized intersection local times of a Brownian motion. We show that for each $k\geq 1$ \[ (\log n)^k [ \frac{1}{n} |\mathcal{R}(n)| +\sum_{j=1}^k (-1)^j (\textstyle{\frac1{2π}}\log n +c_X)^{-j} γ_{j,n}]\to 0, \qquad a.s. \] where $W_t$ is a Brownian motion, $W^{(n)}_t=W_{nt}/\sqrt n$, $γ_{j,n}$ is the renormalized intersection local time at time 1 for $W^{(n)}$, and $c_X$ is a constant depending on the distribution of the random walk.

math.PR↗

Cover Times for Brownian Motion and Random Walks in Two Dimensions

Let T(x,r) denote the first hitting time of the disc of radius r centered at x for Brownian motion on the two dimensional torus. We prove that sup_{x} T(x,r)/|log r|^2 --> 2/pi as r --> 0. The same applies to Brownian motion on any smooth, compact connected, two-dimensional, Riemannian manifold with unit area and no boundary. As a consequence, we prove a conjecture, due to Aldous (1989), that the number of steps it takes a simple random walk to cover all points of the lattice torus Z_n^2 is asymptotic to (2n log n)^2/pi. Determining these asymptotics is an essential step toward analyzing the fractal structure of the set of uncovered sites before coverage is complete; so far, this structure was only studied non-rigorously in the physics literature. We also establish a conjecture, due to Kesten and Revesz, that describes the asymptotics for the number of steps needed by simple random walk in Z^2 to cover the disc of radius n.

math.PR↗

Thick points for intersections of planar sample paths

Let $L_n^{X}(x)$ denote the number of visits to $x \in {\bf Z}^2$ of the simple planar random walk $X$, up till step $n$. Let $X'$ be another simple planar random walk independent of $X$. We show that for any $0<b<1/(2 π)$, there are $n^{1-2πb+o(1)}$ points $x \in {\bf Z}^2$ for which $L_n^{X}(x)L_n^{X'}(x)\geq b^2 (\log n)^4$. This is the discrete counterpart of our main result, that for any $a<1$, the Hausdorff dimension of the set of {\it thick intersection points} $x$ for which $\limsup_{r \to 0} {\mathcal I}(x,r)/(r^2|\log r|^4)=a^2$, is almost surely $2-2a$. Here ${\mathcal I}(x,r)$ is the projected intersection local time measure of the disc of radius $r$ centered at $x$ for two independent planar Brownian motions run till time 1. The proofs rely on a `multi-scale refinement' of the second moment method. In addition, we also consider analogous problems where we replace one of the Brownian motions by a transient stable process, or replace the disc of radius $r$ centered at $x$ by $x+rK$ for general sets $K$.

math.PR↗