Related papers: Random walks, diffusion limited aggregation in a w…
Conventional wisdom in the sampling literature, backed by a popular diffusion scaling limit, suggests that the mixing time of the Metropolis-Adjusted Langevin Algorithm (MALA) scales as $O(d^{1/3})$, where $d$ is the dimension. However, the…
Coagulation-flocculation, the physicochemical process widely used for purification a wastewater, is affected both by chemical details of involved polymers and by the statistics of their conformations on a large scale. The latter aspect is…
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…
In this paper we study the structure of the limit aggregate $A_\infty = \bigcup_{n\geq 0} A_n$ of the one-dimensional long range diffusion limited aggregation process defined in [AABK09]. We show (under some regularity conditions) that for…
We introduce a discrete numerical method based on the diffusion-limited aggregation (DLA) approach to simulate two-fluid Hele-Shaw flow subject to the Saffman-Taylor interfacial instability, in the case where the displaced fluid is…
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…
Cylindrical lattice Diffusion Limited Aggregation (DLA), with a narrow width N, is solved using a Markovian matrix method. This matrix contains the probabilities that the front moves from one configuration to another at each growth step,…
Diffusive random walks feature the surprising property that the average length of all possible random trajectories that enter and exit a finite domain is determined solely by the domain boundary. Changes in the diffusion constant or the…
Though classical random walks have been studied for many years, research concerning their quantum analogues, quantum random walks, has only come about recently. Numerous simulations of both types of walks have been run and analyzed, and are…
We repeat the numerical experiments for diffusion limited aggregation (DLA) and show that there is a potentially infinite set of conserved quantities for the long time asymptotics. We connect these observations with the exact integrability…
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…
We consider random walks on comb- and brush-like graphs consisting of a base (of fractal dimension $D$) decorated with attached side-groups. The graphs are also characterized by the fractal dimension $D_a$ of a set of anchor points where…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
In this paper, we study the $\alpha$-cluster tree ($\alpha$-tree) under both singular and nonsingular measures. The $\alpha$-tree uses probability contents within a level set to construct a cluster tree so that it is well-defined for…
The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubiquitously observed across large real-world networks. This…
We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understanding of clustering…
We discuss here in detail a new analytical random walk approach to calculating the phase-diagram for spatially extended systems with multiplicative noise. We use the Anderson localization problem as an example. The transition from…
We address the question of distance record-setting by a random walker in the presence of measurement error, $\delta$, and additive noise, $\gamma$ and show that the mean number of (upper) records up to $n$ steps still grows universally as…
The ensemble properties and time-averaged observables of a memory-induced diffusive-superdiffusive transition are studied. The model consists in a random walker whose transitions in a given direction depend on a weighted linear combination…
We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…