相关论文: Bias-free simulation of diffusion-limited aggregat…
We extend the conformal mapping approach elaborated for the radial Diffusion Limited Aggregation model (DLA) to the cylindrical geometry. We introduce in particular a complex function which allows to grow a cylindrical cluster using as…
We employ the recently introduced conformal iterative construction of Diffusion Limited Aggregates (DLA) to study the multifractal properties of the harmonic measure. The support of the harmonic measure is obtained from a dynamical process…
We present dla-ideal-solver, a high-performance framework for simulating two-dimensional Diffusion-Limited Aggregation (DLA) using Numba-accelerated Python. By leveraging just-in-time (JIT) compilation, we achieve computational throughput…
We revisit Kesten's argument for the upper bound on the growth rate of DLA. We are able to make the argument robust enough so that it applies to many graphs, where only control of the heat kernel is required. We apply this to many examples…
The growth of a diffusion limited aggregation (DLA) cluster with mass $M$ and radius of gyration $R$ is described by a set of growth probabilities $\{ p_i\}$, where $p_i$ is the probability that the perimeter site $i$ will be the next to…
In this manuscript we investigate the capabilities of the Discrete Dipole Approximation (DDA) to simulate scattering from particles that are much larger than the wavelength of the incident light, and describe an optimized publicly available…
We study internal diffusion limited aggregation (DLA) on the two dimensional comb lattice. The comb lattice is a spanning tree of the euclidean lattice, and internal DLA is a random growth model, where simple random walks, starting one at a…
Diffusion limited aggregation is studied from the perspective of computational complexity. A parallel algorithm is exhibited that requires a number of steps that scales as the depth of the tree defined by the cluster. The existence of this…
For real world systems, nonuniform medium is ubiquitous. Therefore, we investigate the diffusion-limited-aggregation process on a two dimensional directed small-world network instead of regular lattice. The network structure is established…
A qubit lattice algorithm (QLA) is developed for Maxwell equations in a two-dimensional Cartesian geometry. In particular, the initial value problem of electromagnetic pulse scattering off a localized 2D dielectric object is considered. A…
In previous works, we showed that the internal DLA cluster on \Z^d with t particles is a.s. spherical up to a maximal error of O(\log t) if d=2 and O(\sqrt{\log t}) if d > 2. This paper addresses "average error": in a certain sense, the…
(Abridged) We quantify the bias and scatter in galaxy cluster masses and concentrations derived from an idealised mock weak gravitational lensing (WL) survey, and their effect on the cluster mass-concentration relation. For this, we…
Internal Diffusion Limited Aggregation (IDLA) is a model that describes the growth of a random aggregate of particles from the inside out. Shellef proved that IDLA processes on supercritical percolation clusters of integer-lattices fill…
Internal diffusion limited aggregation (IDLA) is a random aggregation model on a graph $G$, whose clusters are formed by random walks started in the origin (some fixed vertex) and stopped upon visiting a previously unvisited site. On the…
What is the scaling limit of diffusion limited aggregation (DLA) in the plane? This is an old and famously difficult question. One can generalize the question in two ways: first, one may consider the {\em dielectric breakdown model}…
Internal diffusion-limited aggregation (IDLA) is a stochastic growth model on a graph $G$ which describes the formation of a random set of vertices growing from the origin (some fixed vertex) of $G$. Particles start at the origin and…
Internal DLA (IDLA) is an internal aggregation model in which particles perform random walks from the origin, in turn, and stop upon reaching an unoccupied site. Levine and Peres showed that, when particles start instead from fixed…
We propose a simple model of columnar growth through {\it diffusion limited aggregation} (DLA). Consider a graph $G_N\times\N$, where the basis has $N$ vertices $G_N:=\{1,\dots,N\}$, and two vertices $(x,h)$ and $(x',h')$ are adjacent if…
We discuss the scaling of characteristic lengths in diffusion limited aggregation (DLA) clusters in light of recent developments using conformal maps. We are led to the conjecture that the apparently anomalous scaling of lengths is due to…
A Dyson map explicitly determines the appropriate basis of electromagnetic fields which yields a unitary representation of the Maxwell equations in an inhomogeneous medium. A qubit lattice algorithm (QLA) is then developed perturbatively to…