English
Related papers

Related papers: One-dimensional long-range diffusion-limited aggre…

200 papers

We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $\beta$. We prove…

Probability · Mathematics 2018-03-28 Nathanael Berestycki , Ariel Yadin

We calculate the diffusion coefficients of persistent random walks on lattices, where the direction of a walker at a given step depends on the memory of a certain number of previous steps. In particular, we describe a simple method which…

Statistical Mechanics · Physics 2013-02-07 Thomas Gilbert , David P. Sanders

We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…

Statistical Mechanics · Physics 2009-10-31 Roger Bidaux , Jerome Chave , Radim Vocka

We study one-dimensional multi-particle Diffusion Limited Aggregation (MDLA) at its critical density $\lambda=1$. Previous works have verified that the size of the aggregate $X_t$ at time $t$ is $t^{1/2}$ in the subcritical regime and…

Probability · Mathematics 2020-09-11 Dor Elboim , Danny Nam , Allan Sly

I present a first-principles theory of diffusion-limited aggregation in two dimensions. A renormalized mean-field approximation gives the form of the unstable manifold for branch competition, following the method of Halsey and Leibig [Phys.…

Condensed Matter · Physics 2009-10-22 Thomas C. Halsey

In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and in the Ornstein-Uhlenbeck context. Here…

Probability · Mathematics 2019-12-12 Samuel Herrmann , Nicolas Massin

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

Statistical Mechanics · Physics 2009-11-11 Tonguc Rador

A one-dimensional model on a line of the length L is investigated, which involves particle diffusion as well as single particle annihilation. There are also creation and annihilation at the boundaries. The static and dynamical behaviors of…

Mathematical Physics · Physics 2014-03-17 Mohammad Khorrami , Amir Aghamohammadi

Starting from the model of continuous time random walk, we focus our interest on random walks in which the probability distributions of the waiting times and jumps have fat tails characterized by power laws with exponent between 0 and 1 for…

Probability · Mathematics 2008-01-03 Rudolf Gorenflo , Entsar A. A. Abdel-Rehim

A scaling theory is developed for diffusion-limited cluster aggregation in a porous medium, where the primary particles and clusters stick irreversibly to the walls of the pore space as well as to each other. Three scaling regimes are…

Soft Condensed Matter · Physics 2009-11-13 Patrick B. Warren

We investigate the diffusive motion of an overdamped classical particle in a 1D random potential using the mean first-passage time formalism and demonstrate the efficiency of this method in the investigation of the large-time dynamics of…

Superconductivity · Physics 2009-10-31 D. A. Gorokhov , G. Blatter

We study internal diffusion-limited aggregation with random starting points on Z^d. In this model, each new particle starts from a vertex chosen uniformly at random on the existing aggregate. We prove that the limiting shape of the…

Probability · Mathematics 2021-10-07 Itai Benjamini , Hugo Duminil-Copin , Gady Kozma , Cyrille Lucas

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…

Probability · Mathematics 2023-11-30 Matteo Quattropani , Federico Sau

We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…

Probability · Mathematics 2015-03-04 Shirshendu Chatterjee , Partha S. Dey

Diffusion-limited aggregation (DLA) assumes that particles perform pure random walk at a finite temperature and aggregate when they come close enough and stick together. Although it is well known that DLA in two dimensions results in a…

Statistical Mechanics · Physics 2013-09-02 Li Deng , Yanting Wang , Zhong-Can Ou-Yang

We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…

Plasma Physics · Physics 2009-11-07 H. Isliker , L. Vlahos

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…

Combinatorics · Mathematics 2017-03-30 Laura Florescu , Yuval Peres , Miklos Z. Racz

In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…

Classical Analysis and ODEs · Mathematics 2007-05-23 Sabir Umarov , Stanly Steinberg

We consider the elephant random walk with general step distribution. We calculate the first four moments of the limiting distribution of the position rescaled by $n^\alpha$ in the superdiffusive regime where $\alpha$ is the memory…

Probability · Mathematics 2022-10-03 József Kiss , Bálint Vető

We consider the DLA process on a cylinder G x N. It is shown that this process "grows arms", provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most (log|G|)^(2-\eps), the time it takes…

Probability · Mathematics 2009-11-13 Itai Benjamini , Ariel Yadin