Related papers: Logarithmic fluctuations for internal DLA

We prove a Law of Iterated Logarithm for random walks on a family of diagonal products constructed by Brieussel and Zheng (2021). This provides a wide variety of new examples of Law of Iterated Logarithm behaviours for random walks on…

In this paper, we deal with the inner boundary of random walk range, that is, the set of those points in a random walk range which have at least one neighbor site outside the range. If $L_n$ be the number of the inner boundary points of…

The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen…

In analogy to recent results on non-universal roughening in surface growth [Lam and Sander, Phys. Rev. Lett. {\bf 69}, 3338 (1992)], we propose a variant of diffusion-limited aggregation ($DLA$) in which the radii of the particles are…

In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…

We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…

We analyze a fairly standard idealization of Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group G. It is found that, with high probability, a collision occurs in $O(\sqrt{|G|\log |G| \log \log |G|})$ steps, not far…

When a particle diffuses in a medium with spatially dependent friction coefficient $\alpha(r)$ at constant temperature $T$, it drifts toward the low friction end of the system even in the absence of any real physical force $f$. This…

Brownian motion and scaled and interpolated simple random walk can be jointly embedded in a probability space in such a way that almost surely the $n$-step walk is within a uniform distance $O(n^{-1/2}\log n)$ of the Brownian path for all…

Consider the square random matrix $A_n=(a_{ij})_{n,n}$, where $\{a_{ij}:=a_{ij}^{(n)},i,j=1,\ldots,n\}$ is a collection of independent real random variables with means zero and variances one. Under the additional moment condition…

We study the neighborhoods of a typical point $Z_n$ visited at $n$-th step of a random walk, determined by the condition that the transition probabilities stay close to $\mu^{*n}(Z_n)$. If such neighborhood contains a ball of radius $C…

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

By optimal fluctuation method, we study short-time distribution $P(\mathcal{A}=A)$ of the functionals, $\mathcal{A}=\int_{0}^{t_f} x^n(t) dt$, along constrained trajectories of random acceleration process for a given time duration $t_f$,…

Across a large range of scales, accreting sources show remarkably similar patterns of variability, most notably the log-normality of the luminosity distribution and the linear root-mean square (rms)-flux relationship. These results are…

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

We study statistics of the gaps in Random Average Process (RAP) on a ring with particles hopping symmetrically, except one tracer particle which could be driven. These particles hop either to the left or to the right by a random fraction…

For a symmetric random walk in $Z^2$ with $2+\delta$ 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…

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…

In the framework of a stochastic picture for the one-dimensional branching Brownian motion, we compute the probability density of the number of particles near the rightmost one at a time $T$, that we take very large, when this extreme…

For every positive integer N and every $\alpha\in [0,1)$, let $B(N, \alpha)$ denote the probabilistic model in which a random set $A\subset \{1,\dots,N\}$ is constructed by choosing independently every element of $\{1,\dots,N\}$ with…