Related papers: External diffusion limited aggregation on a spanni…
How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…
In this paper, we present results of extensive Monte Carlo simulations of diffusion-limited aggregation (DLA) with a seed placed on an attractive plane as a simple model in connection with the electrical double layers. We compute the…
We study the scaling limits of three different aggregation models on the integer lattice Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform…
Two dimensional loop erased random walk (LERW) is a random curve, whose continuum limit is known to be a Schramm-Loewner evolution (SLE) with parameter kappa=2. In this article we study ``off-critical loop erased random walks'', loop…
We study an energy-constrained random walker on a length-$N$ interval of the one-dimensional integer lattice, with boundary reflection. The walker consumes one unit of energy for every step taken in the interior, and energy is replenished…
The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…
In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the $n$-th generation, which may be different…
Diffusion-limited aggregation has a natural generalization to the "$\eta$-models", in which $\eta$ random walkers must arrive at a point on the cluster surface in order for growth to occur. It has recently been proposed that in spatial…
Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "\emph{controlled diffusion}" steps needed to transport a constant mass $p$ outside of the ball of radius $n$. In a step of a controlled diffusion…
In this paper, we analyze the scaling behavior of \emph{Diffusion Limited Aggregation} (DLA) simulated by Hastings-Levitov method. We obtain the fractal dimension of the clusters by direct analysis of the geometrical patterns in a good…
This work extends Roberts et al. (1997) by considering limits of Random Walk Metropolis (RWM) applied to block IID target distributions, with corresponding block-independent proposals. The extension verifies the robustness of the optimal…
A n-step Pearson-Gamma random walk in Rd starts at the origin and consists of n independent steps with gamma distributed lengths and uniform orientations. The gamma distribution of each step length has a shape parameter q>0. Constrained…
Random walks (RW) of particles adsorbed in the internal walls of porous deposits produced by ballistic-type growth models are studied. The particles start at the external surface of the deposits and enter their pores, in order to simulate…
We show that various surface parameters in two-dimensional diffusion limited aggregation (DLA) grow linearly with the number of particles. We find the ratio of the average length of the perimeter and the accessible perimeter of a DLA…
In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…
We measure the fractal dimension of loop-erased random walk (LERW) in 3 dimensions, and estimate that it is 1.62400 +- 0.00005. LERW is closely related to the uniform spanning tree and the abelian sandpile model. We simulated LERW on both…
We show that, in a broad class of continuous time random walks (CTRW), a small external field can turn diffusion from standard into anomalous. We illustrate our findings in a CTRW with trapping, a prototype of subdiffusion in disordered and…
For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…
We introduce and develop the concept of Maximal Entropy Random Walks (MERWs) on Weighted Bratteli Diagrams (WBDs), maximizing entropy production along paths as a natural criterion for choosing random walks on networks. Initially defined for…
We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the…