Related papers: Internal DLA on Sierpinski gasket graphs
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.…
We consider a model of aggregation, both diffusion-limited and ballistic, based on the Cayley tree. Growth is from the leaves of the tree towards the root, leading to non-trivial screening and branch competition effects. The model exhibits…
We study diffusion-limited coalescence, A+A<-->A, in one dimension, in the presence of a diffusing trap. The system may be regarded as a generalization of von Smoluchowski's model for reaction rates, in that: (a) it includes reactions…
Graph generative models can be classified into two prominent families: one-shot models, which generate a graph in one go, and sequential models, which generate a graph by successive additions of nodes and edges. Ideally, between these two…
After a brief historical survey, the paper introduces the notion of entropic model sets (cut and project sets), and, more generally, the notion of diffractive point sets with entropy. Such sets may be thought of as generalizations of…
Diffusion models have emerged as a powerful framework for generative tasks in deep learning. They decompose generative modeling into two computational primitives: deterministic neural-network evaluation and stochastic sampling. Current…
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
A number of recent studies have estimated the inter-galactic void probability function and investigated its departure from various random models. We study a family of parametric statistical models based on gamma distributions, which do give…
We study a class of dynamically constructed point processes in which at every step a new point (particle) is added to the current configuration with a distribution depending on the local structure around a uniformly chosen particle. This…
In galaxy clusters, hierarchical assembly predicts the formation of stellar substructures and intracluster light (ICL), a diffuse stellar component tracing the global cluster potential. Because these features are extremely faint,…
We consider a simple model of a growing cluster of points in $\Re^d,d\geq 2$. Beginning with a point $X_1$ located at the origin, we generate a random sequence of points $X_1,X_2,\ldots,X_i,\ldots,$. To generate $X_{i},i\geq 2$ we choose a…
Spectral clustering is discussed from many perspectives, by extending it to rectangular arrays and discrepancy minimization too. Near optimal clusters are obtained with singular value decomposition and with the weighted $k$-means algorithm.…
This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper…
We present the discrete infinite logistic normal distribution (DILN), a Bayesian nonparametric prior for mixed membership models. DILN is a generalization of the hierarchical Dirichlet process (HDP) that models correlation structure between…
In this article we define and study a stochastic process on Galoisian covers of compact manifolds. The successive positions of the process are defined recursively by picking a point uniformly in the Dirichlet domain of the previous one. We…
In this paper we report the results of simulations of a 2D gravity driven, dissipative granular flow through a hopper system. Measurements of impulse distributions P(I) on the simulated system show flow-velocity-invariant behavior of the…
Extensive numerical simulation are reported for the structure and dynamics of large clusters on metal(100) surfaces. Different types of perimeter hopping processes makes center-of-mass of the cluster to follow a a random walk trajectory.…
Graph is a prevalent discrete data structure, whose generation has wide applications such as drug discovery and circuit design. Diffusion generative models, as an emerging research focus, have been applied to graph generation tasks.…
In this paper we propose algorithms for allocating $n$ sequential balls into $n$ bins that are interconnected as a $d$-regular $n$-vertex graph $G$, where $d\ge3$ can be any integer.Let $l$ be a given positive integer. In each round $t$,…
We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…