We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already known results about the convex hull of a single Gaussian random walk and the $d$-dimensional Gaussian polytope with or without the origin.
We study random convex cones defned as positive hulls of $d$-dimensional random walks and bridges. We compute expectations of various geometric functionals of these cones such as the number of $k$-dimensional faces and the sums of conic quermassintegrals of their $k$-dimensional faces. These expectations are expressed in terms of Stirling numbers of both kinds and their $B$-analogues.
We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped with the Hausdorff distance, towards the convex hull spanned by a path of the limit stable Lévy process. As an application, we establish convergence of (expected) intrinsic volumes under some mild moment/structure assumptions posed on the random walk.
We consider a random walk in the plane which takes steps uniformly distributed on the unit circle centered around the walker's current position but avoids the convex hull of its past positions. This model has been introduced by Angel, Benjamini and Virag. We show a large deviation estimate for the distance of the walker from the origin, which implies that the walker has positive lim inf speed.
We introduce planar random walk conditioned to avoid its past convex hull, and we show that it escapes at a positive limsup speed. Experimental results show that fluctuations from a limiting direction are on the order of n^(3/4). This behavior is also observed for the extremal investor, a natural financial model related to the planar walk.
For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random walks with drift (for the area) and walks with no drift (for both area and perimeter length) under mild moments assumptions on the increments. These results complement and contrast with previous work which showed that the perimeter length in the case with drift satisfies a central limit theorem. We deduce these results from weak convergence statements for the c…
We study the convex hull of the first $n$ steps of a planar random walk, and present large-$n$ asymptotic results on its perimeter length $L_n$, diameter $D_n$, and shape. In the case where the walk has a non-zero mean drift, we show that $L_n / D_n \to 2$ a.s., and give distributional limit theorems and variance asymptotics for $D_n$, and in the zero-drift case we show that the convex hull is infinitely often arbitrarily well-approximated in shape by any unit-diameter compact convex set containing the origin, and then $\liminf_{n \to \infty} L_n/D_n =2$ and $\limsup_{n \to \infty} L_n /D_n = …
We prove large deviations principles (LDPs) for the perimeter and the area of the convex hull of a planar random walk with finite Laplace transform of its increments. We give explicit upper and lower bounds for the rate function of the perimeter in terms of the rate function of the increments. These bounds coincide and thus give the rate function for a wide class of distributions which includes the Gaussians and the rotationally invariant ones. For random walks with such increments, large deviations of the perimeter are attained by the trajectories that asymptotically align into line segments.…
Denote by $L_n$ the length of the perimeter of the convex hull of $n$ steps of a planar random walk whose increments have finite second moment and non-zero mean. Snyder and Steele showed that $n^{-1} L_n$ converges almost surely to a deterministic limit, and proved an upper bound on the variance $Var [ L_n] = O(n)$. We show that $n^{-1} Var [L_n]$ converges and give a simple expression for the limit, which is non-zero for walks outside a certain degenerate class. This answers a question of Snyder and Steele. Furthermore, we prove a central limit theorem for $L_n$ in the non-degenerate case.
For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to random walks both with drift (the mean of random walk increments) and with no drift under mild moments assumptions on the increments. Assuming increments of the random walk have finite second moment and non-zero mean, Snyder and Steele showed that $n^{-1} L_n$ converges almost surely to a deterministic limit, and proved an upper bound on the variance Var$[ L_n…
Let $S_k$ be a random walk in $R^d$ such that its distribution of increments does not assign mass to hyperplanes. We study the probability $p_n$ that the convex hull $conv (S_1, \ldots , S_n)$ of the first $n$ steps of the walk does not include the origin. By providing an explicit formula, we show that for planar symmetrically distributed random walks, $p_n$ does not depend on the distribution of increments. This extends the well known result by Sparre Andersen (1949) that a one-dimensional random walk satisfying the above continuity and symmetry assumptions stays positive with a distribution-…
We give an explicit formula for the probability that the convex hull of an $n$-step random walk in $R^d$ does not contain the origin, under the assumption that the distribution of increments of the walk is centrally symmetric and puts no mass on affine hyperplanes. This extends the formula by Sparre Andersen (1949) for the probability that such random walk in dimension one stays positive. Our result is distribution-free, that is, the probability does not depend on the distribution of increments. This probabilistic problem is shown to be equivalent to either of the two geometric ones: 1) Find t…
Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified position. One-dimensional reflected random walk is quite well understood from work in 7 decades, but the multidimensional model presents several new difficulties. Here we investigate recurrence questions.
We connect this question to a problem of estimating the probability that the image of certain random matrices does not intersect with a subset of the unit sphere $\mathbb{S}^{n-1}$. In this way, the case of a discretized Brownian motion is related to Gordon's escape theorem dealing with standard Gaussian matrices. The approach allows us to prove that with high probability, the $π/2$-covering time of certain random walks on $\mathbb{S}^{n-1}$ is of order $n$. For certain spherical simplices on $\mathbb{S}^{n-1}$, we extend the "escape" phenomenon to a broad class of random matrices; as an appli…
Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$, but conditioned that the line segment from $X_n$ to $X_{n+1}$ intersects the convex hull of $\{0, X_{n-k}, \ldots, X_n\}$ only at $X_n$. For $k = \infty$ this is a version of the model introduced by Angel et al., which is conjectured to be ballistic, i.e., to have a limiting speed and a limiting direction. We establish ballisticity for the finite-$k$ model, a…
We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we obtain a functional limit theorem to Gaussian vectors. In superdiffusive, we obtain strong convergence to a non-Gaussian random vector and characterize its moments.
Fluctuations for diameter and perimeter of convex hulls of multiple random walks
Institute of Mathematics, University of Wrocław(弗罗茨瓦夫大学数学研究所);University of Zagreb Faculty of Science(萨格勒布大学理学院);University of Zagreb Faculty of Electrical Engineering and Computing(萨格勒布大学电气工程和计算学院);Department of Mathematical Sciences, Durham University(杜伦大学数学科学系);Department of Mathematics, The University of Hong Kong(香港大学数学系)
We develop a criterion for transience for a general model of branching Markov chains. In the case of multi-dimensional branching random walk in random environment (BRWRE) this criterion becomes explicit. In particular, we show that \emph{Condition L} of Comets and Popov is necessary and sufficient for transience as conjectured. Furthermore, the criterion applies to two important classes of branching random walks and implies that the critical branching random walk is transient resp. dies out locally.
Let $ξ_1,ξ_2,\ldots$ be a sequence of independent copies of a random vector in $\mathbb R^d$ having an absolutely continuous distribution. Consider a random walk $S_i:=ξ_1+\cdots+ξ_i$, and let $C_{n,d}:=\text{conv}(0,S_1,S_2,\ldots,S_n)$ be the convex hull of the first $n+1$ points it has visited. The polytope $C_{n,d}$ is called $k$-neighborly if for every indices $0\leq i_0 <\cdots < i_k\leq n$ the convex hull of the $k+1$ points $S_{i_0},\ldots, S_{i_k}$ is a $k$-dimensional face of $C_{n,d}$. We study the probability that $C_{n,d}$ is $k$-neighborly in various high-dimensional asymptotic r…
Symmetric heavily tailed random walks on $Z^d, d\geq 1,$ are considered. Under appropriate regularity conditions on the tails of the jump distributions, global (i.e., uniform in $x,t, |x|+t\to\infty,$) asymptotic behavior of the transition probability $p(t,0,x)$ is obtained. The examples indicate that the regularity conditions are essential.
Crystal lattices are known to be one of the generalizations of classical periodic lattices which can be embedded into some Euclidean spaces properly. As to make a wide range of multidimensional discrete distributions on Euclidean spaces more treatable, multidimensional Euler products and multidimensional Shintani zeta functions on crystal lattices are introduced. They are completely different from existing Ihara zeta functions on graphs in that our zeta functions are defined on crystal lattices directly. Via a concept of periodic realizations of crystal lattices, we make it possible to provide…
In this work, we discuss the smoothly amnesia-reinforced multidimensional elephant random walk (MARW). The scaling limit of the MARW is shown to exist in the diffusive, critical and superdiffusive regimes. We also establish the almost sure convergence in all of the three regimes. The quadratic strong law is displayed in the diffusive regime as well as in the critical regime. The mean square convergence towards a non-Gaussian random variable is established in the superdiffusive regime. Similar results for the barycenter process are also derived. Finally, the last two Sections are devoted to a d…
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience, depending only on the support of the environmental law. We give sufficient conditions for recurrence and for transience. In the recurrent case, we study the asymptotics of the tail of the distribution of the hitting times and prove a shape theorem for the set of lattice sites which are visited up to a large time.
In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call a random walk 'polygonally recurrent' (resp. transient) if a.s. infinitely many (resp. finitely many) of the straight lines between two consecutive sites hit a given bounded set. The above estimate implies that three-dimensional random walks with independent components are polygonally transient. Similarly a directionally reinforced random walk on Z^3 in the…
We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. We prove an invariance principle (functional central limit theorem) under almost every fixed environment. The assumptions are nonnestling, at least two spatial dimensions, and a $2+ε$ moment for the step of the walk uniformly in the environment. The main point behind the invariance principle is that the quenched mean of the walk behaves subdiffusively.
We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and the laws of the holding times are randomly distributed over the integer lattice. Our main result is a quenched large deviation principle for the position of the random walk. The rate function is given by the Legendre transform of the so-called Lyapunov exponents for the Laplace transform of the first passage time. By using this representation, we derive some…
We take the point of view of the particle in a multidimensional nearest neighbor random walk in random environment (RWRE). We prove a quenched large deviation principle and derive a variational formula for the quenched rate function. Most of the previous results in this area rely on the subadditive ergodic theorem. We employ a different technique which is based on a minimax theorem. Large deviation principles for RWRE have been proven for i.i.d. nestling environments subject to a moment condition and for ergodic uniformly elliptic environments. We assume only that the environment is ergodic an…
Consider a sequence of partial sums $S_i= ξ_1+\dots+ξ_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $ξ_1,\dots,ξ_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull $C_n:=\mathrm{Conv}(S_0,S_1,\dots,S_n)$. Assuming that the tuple $(ξ_1,\dots,ξ_n)$ is exchangeable and a certain general position condition holds, we prove that the expected number of $k$-dimensional faces of $C_n$ is given by the formula $$ \mathbb E [f_k(C_n)] = \frac{2\cdot k!}{n!} \sum_{l=0}^{\infty}\genfrac{[}{]}{0pt}{}{n+1}{d-2l} \genfrac{\{}{\}}{0pt}{}{d-2l}{…
In this paper we consider a d-dimensional scenery seen along a simple symmetric branching random walk, where at each time each particle gives the color record it is seeing. We show that we can a.s. reconstruct the scenery up to equivalence from the color record of all the particles. For this we assume that the scenery has at least 2d + 1 colors which are i.i.d. with uniform probability. This is an improvement in comparison to [22] where the particles needed to see at each time a window around their current position. In [11] the reconstruction is done for d = 2 with only one particle instead of…
Random walks conditioned to stay positive are a prominent topic in fluctuation theory. One way to construct them is as a random walk conditioned to stay positive up to time $n$, and let $n$ tend to infinity. A second method is conditioning instead to stay positive up to an independent geometric time, and send its parameter to zero. The multidimensional case (condition the components of a $d$-dimensional random walk to be ordered) was solved in [EK08] using the first approach, but some moment conditions need to be imposed. Our approach is based on the second method, which has the advantage to r…
We study branching random walks in random environment on the $d$-dimensional square lattice, $d \geq 1$. In this model, the environment has finite range dependence, and the population size cannot decrease. We prove limit theorems (laws of large numbers) for the set of lattice sites which are visited up to a large time as well as for the local size of the population. The limiting shape of this set is compact and convex, though the local size is given by a concave growth exponent. Also, we obtain the law of large numbers for the logarithm of the total number of particles in the process.
A Lindley process arises from classical studies in queueing theory and it usually reflects waiting times of customers in single server models. In this note we study recurrence of its higher dimensional counterpart under some mild assumptions on the tail behaviour of the underlying random walk. There are several links between the Lindley process and the associated random walk and we build upon such relations. We apply a method related to discrete subordination for random walks on the integer lattice together with various facts from the theory of fluctuations of random walks.
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{é}vy walks for which the persistence times depend on some internal Markov chain: they admit Markov random walk skeletons. A recurrence versus transience dichotomy is highlighted. We first give a sufficient Fourier criterion for the recurrence, close to the usual Chung-Fuchs one, assuming in addition the positive recurrence of the driving chain and a series criterion is derived. The key tool is the Nagaev-Guivarc'h method. Fina…
We survey some geometrical properties of trajectories of $d$-dimensional random walks via the application of functional limit theorems. We focus on the functional law of large numbers and functional central limit theorem (Donsker's theorem). For the latter, we survey the underlying weak convergence theory, drawing heavily on the exposition of Billingsley, but explicitly treat the multidimensional case. Our two main applications are to the convex hull of a random walk and the centre of mass process associated to a random walk. In particular, we establish the limit sets of the convex hull in the…
We consider a continuous-time branching random walk on a multidimensional lattice with two types of particles and an infinite number of initial particles. The main results are devoted to the study of the generating function and the limiting behavior of the moments of subpopulations generated by a single particle of each type. We assume that particle types differ from each other not only by the laws of branching, as in multi-type branching processes, but also by the laws of walking. For a critical branching process at each lattice point and recurrent random walk of particles, the effect of limi…
For a supercritical catalytic branching random walk on Z^d (d is positive integer) with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. Namely, we divide by t the position coordinates of each particle existing at time t and then let t tend to infinity. It is shown that in the limit there are a.s. no particles outside the closed convex surface in R^d which we call the propagation front and, under condition of infinite number of visits of the catalysts set, a.s. there exist particles on the propagation front. We also demonstrate that the p…
Let $(S_n)_n$ be a $R^d$-valued random walk ($d\geq2$). Using Babillot's method [2], we give general conditions on the characteristic function of $S_n$ under which $(S_n)_n$ satisfies the same renewal theorem as the classical one obtained for random walks with i.i.d. non-centered increments. This statement is applied to additive functionals of strongly ergodic Markov chains under the non-lattice condition and (almost) optimal moment conditions.
Let K be the convex hull of the path of a standard brownian motion B(t) in R^n, taken at time 0 < t < 1. We derive formulas for the expected volume and surface area of K. Moreover, we show that in order to approximate K by a discrete version of K, namely by the convex hull of a random walk attained by taking B(t_n) at discrete (random) times, the number of steps that one should take in order for the volume of the difference to be relatively small is of order n^3. Next, we show that the distribution of facets of K is in some sense scale invariant: for any given family of simplices (satisfying s…
Let $\{\boldsymbol{X}_n\}$ be a discrete-time $d$-dimensional process on $\mathbb{Z}_+^d$ with a supplemental (background) process $\{J_n\}$ on a finite set and assume the joint process $\{\boldsymbol{Y}_n\}=\{(\boldsymbol{X}_n,J_n)\}$ to be Markovian. Then, the process $\{\boldsymbol{X}_n\}$ can be regarded as a kind of reflecting random walk (RRW for short) in which the transition probabilities of the RRW are modulated according to the state of the background process $\{J_n\}$; we assume this modulation is space-homogeneous inside $\mathbb{Z}_+^d$ and on each boundary face of $\mathbb{Z}_+^d…
Consider a random walk $S_i= ξ_1+\ldots+ξ_i$, $i\in\mathbb N$, whose increments $ξ_1,ξ_2,\ldots$ are independent identically distributed random vectors in $\mathbb R^d$ such that $ξ_1$ has the same law as $-ξ_1$ and $\mathbb P[ξ_1\in H] = 0$ for every affine hyperplane $H\subset \mathbb R^d$. Our main result is the distribution-free formula $$ \mathbb E \left[\sum_{1\leq i_1 < \ldots < i_k\leq n} 1_{\{0\notin \text{conv}(S_{i_1},\ldots, S_{i_k})\}}\right] = 2 \binom n k \frac {B(k, d-1) + B(k, d-3) +\ldots} {2^k k!}, $$ where the $B(k,j)$'s are defined by their generating function $$ (t+1) (t+…
We study a continuous-time branching random walk on the lattice $\mathbb{Z}^{d}$, $d\in \mathbb{N}$, with a single source of branching, that is the lattice point where the birth and death of particles can occur. The random walk is assumed to be homogeneous, symmetric and irreducible but, in contrast to previous investigations, the random walk transition intensities $a(x,y)$ decrease as $|y-x|^{-(d+α)}$ for $|y-x|\to \infty$, where $α\in(0,2)$, that leads to an infinite variance of the random walk jumps. The~mechanism of the birth and death of particles at the source is governed by a continuous…
This paper studies the asymptotic behavior of the Green function of a multidimensional random walk killed when leaving a convex cone with smooth boundary. Our results imply uniqueness, up to a multiplicative factor, of the positive harmonic function for the killed random walk.
A catalytic branching random walk on a multidimensional lattice, with arbitrary finite number of catalysts, is studied in supercritical regime. The dynamics of spatial spread of the particles population is examined, upon normalization. The components of the vector random walk jump are assumed independent (or close to independent) and have semi-exponential distributions with, possibly, different parameters. A limit theorem on the almost sure normalized positions of the particles at the population ``front'' is established. Contrary to the case of the random walk increments with ``light'' distrib…
We study the set of directions asymptotically explored by a spatially homogeneous random walk in $d$-dimensional Euclidean space. We survey some pertinent results of Kesten and Erickson, make some further observations, and present some examples. We also explore links to the asymptotics of one-dimensional projections, and to the growth of the convex hull of the random walk.
We consider a supercritical catalytic branching random walk (CBRW) on a multidimensional lattice Z^d (d is positive integer). The main subject of study is the behavior of particles cloud in space and time. For CBRW on an integer line, Carmona and Hu (2014) examined the asymptotical behavior of the maximal coordinate M_n of the particles at time n. They proved that M_n/n converges to μalmost surely (on a set of local non-degeneracy of CBRW), as n tends to infinity, where μ>0 is a certain constant. Under additional assumption of a single catalyst in CBRW they also investigated the fluctuations o…
We consider multidimensional discrete valued random walks with nonzero drift killed when leaving general cones of the euclidian space. We find the asymptotics for the exit time from the cone and study weak convergence of the process conditioned on not leaving the cone. We get quasistationarity of its limiting distribution. Finally we construct a version of the random walk conditioned to never leave the cone.