相关论文: Upper bounds on the growth rate of Diffusion Limit…
We consider (a variant of) the external multi-particle diffusion-limited aggregation (MDLA) process of Rosenstock and Marquardt on the plane. Based on the recent findings of [11], [10] in one space dimension it is natural to conjecture that…
Diffusion-Limited Aggregation (DLA), the canonical model for non-equilibrium fractal growth, emerges from the simple rule of irreversible attachment by random walkers. Despite four decades of study, a unified computational framework…
We consider skew extensions of expanding maps by compact Lie groups. For a class of natural invariant measures, we prove an explicit lower bound on the rate of (exponential) mixing involving topological pressure. Proof uses representation…
We show that Internal Diffusion Limited Aggregation (IDLA) on $\mathbb{Z}^d$ has near optimal Cheeger constant when the growing cluster is large enough. This implies, through a heat kernel lower bound derived previously in [H], that simple…
In the classical model of Diffusion Limited Aggregation (DLA), introduced by Witten and Sander, the process begins with a single particle cluster placed at the origin of a space, and then, one at a time, particles make a random walk from…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
In this paper, we introduce the stationary harmonic measure in the upper half plane. By bounding this measure, we are able to define both the discrete and continuous time diffusion limit aggregation (DLA) in the upper half plane with…
We investigate the number of maximal independent set queries required to reconstruct the edges of a hidden graph. We show that randomised adaptive algorithms need at least $\Omega(\Delta^2 \log(n / \Delta) / \log \Delta)$ queries to…
Diffusion Limited Aggregation (DLA) is a model of fractal growth that had attained a paradigmatic status due to its simplicity and its underlying role for a variety of pattern forming processes. We present a convergent calculation of the…
We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…
We consider continuous time simple random walks with arbitrary speed measure $\theta$ on infinite weighted graphs. Write $p_t(x,y)$ for the heat kernel of this process. Given on-diagonal upper bounds for the heat kernel at two points…
We study the structure and growth of a difusion-limited aggregate (DLA) for which the constitutive units remain mobile during the aggregation process. Contrary to DLA where far from equilibrium conditions are the prevalent factor for…
We study how far a diffusion process on a graph can deviate from a designed starting pattern when the pattern is generated via Laplacian regularisation. Under standard stability conditions for undirected, entrywise nonnegative graphs, we…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
We propose a new proof technique that aims to be applied to the same problems as the Lov\'asz Local Lemma or the entropy-compression method. We present this approach in the context of non-repetitive colorings and we use it to improve…
In this paper, we construct an infinite stationary Diffusion Limited Aggregation (SDLA) on the upper half planar lattice, growing from an infinite line, with local growth rate proportional to the stationary harmonic measure. We prove that…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.
We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspired by a conjecture of the first author and Kang and a…
We consider internal diffusion limited aggregation in dimension larger than or equal to two. This is a random cluster growth model, where random walks start at the origin of the d-dimensional lattice, one at a time, and stop moving when…
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}…