Related papers: Internal Diffusion-Limited Aggregation: Parallel A…
In a recent paper (Bogoyavlenskiy V A 2002 \JPA \textbf{35} 2533), an algorithm aiming to generate isotropic clusters of the on-lattice diffusion-limited aggregation (DLA) model was proposed. The procedure consists of aggregation…
In the Diffusion Limited Aggregation (DLA) process on on $\mathbb{Z}^2$, or more generally $\mathbb{Z}^d$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a…
We develop the skeleton algorithm to define the number of main branches $N_b$ of diffusion-limited aggregation (DLA) clusters. The skeleton algorithm provides a systematic way to remove dangling side branches of the DLA cluster and has…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
We introduce a method for sparsifying distributed algorithms and exhibit how it leads to improvements that go past known barriers in two algorithmic settings of large-scale graph processing: Massively Parallel Computation (MPC), and Local…
We present new results for LambdaCC and MotifCC, two recently introduced variants of the well-studied correlation clustering problem. Both variants are motivated by applications to network analysis and community detection, and have…
Predicting urban growth is important for practical reasons, and also for the challenge it presents to theoretical frameworks for cluster dynamics. Recently, the model of diffusion limited aggregation (DLA) has been applied to describe urban…
We consider a parallel system of $m$ identical machines prone to unpredictable crashes and restarts, trying to cope with the continuous arrival of tasks to be executed. Tasks have different computational requirements (i.e., processing time…
One of the challenges of high granularity calorimeters, such as that to be built to cover the endcap region in the CMS Phase-2 Upgrade for HL-LHC, is that the large number of channels causes a surge in the computing load when clustering…
The problem of automatically clustering data is an age old problem. People have created numerous algorithms to tackle this problem. The execution time of any of this algorithm grows with the number of input points and the number of cluster…
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…
Decoupling approach presents a novel solution/alternative to the highly time-consuming fluid-thermal-structural simulation procedures when thermal effects and resultant displacements on machine tools are analyzed. Using high dimensional…
We study internal diffusion limited aggregation on $\mathbb{Z}$, where a cluster is grown incrementally by adding, for each random walk dispatched from the origin, the first site it reaches outside the cluster. We assume that the increment…
Parallelization techniques have become ubiquitous for accelerating inference and training of deep neural networks. Despite this, several operations are still performed in a sequential manner. For instance, the forward and backward passes…
Given a graph with positive and negative edge labels, the correlation clustering problem aims to cluster the nodes so to minimize the total number of between-cluster positive and within-cluster negative edges. This problem has many…
A diffusion-limited aggregation process, in which clusters coalesce by means of 3-particle reaction, A+A+A->A, is investigated. In one dimension we give a heuristic argument that predicts logarithmic corrections to the mean-field asymptotic…
We consider the following problem in one-dimensional diffusion-limited aggregation (DLA). At time $t$, we have an "aggregate" consisting of $\Bbb{Z}\cap[0,R(t)]$ [with $R(t)$ a positive integer]. We also have $N(i,t)$ particles at $i$,…
We develop a general theory of transport-limited aggregation phenomena occurring on curved surfaces, based on stochastic iterated conformal maps and conformal projections to the complex plane. To illustrate the theory, we use stereographic…
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…
We consider the problem of clustering in the learning-augmented setting, where we are given a data set in $d$-dimensional Euclidean space, and a label for each data point given by an oracle indicating what subsets of points should be…