Related papers: Internal DLA on Sierpinski gasket graphs
We study domain growth properties of two species of particles executing biased diffusion on a half-filled square lattice, consisting of just two lanes. Driven in opposite directions by an external ``electric'' field, the particles form…
Due to the fact that the numbers of annually published papers have witnessed a linear growth in some citation networks, a geometric model is thus proposed to predict some statistical features of those networks, in which the academic…
We prove a shape theorem for internal diffusion limited aggregation on mated-CRT maps, a family of random planar maps which approximate Liouville quantum gravity (LQG) surfaces. The limit is an LQG harmonic ball, which we constructed in a…
For understanding the nature of gaseous flows in star-forming regions of nearby galaxies it is usually utilized the relation between surface brightness in H$\alpha$ line and velocity dispersion of ionized gas known as ''surface brightness…
In this work, the transition between diffusion-limited and ballistic aggregation models was revisited using a model in which biased random walks simulate the particle trajectories. The bias is controlled by a parameter $\lambda$, which…
Galaxy groups and clusters assembled through dynamical interactions of smaller systems, resulting in the formation of a diffuse stellar halo known as the intragroup or intracluster light (IGL/ICL). By preserving the records of these…
When suitably rescaled, the distribution of the angular gaps between branches of off-lattice radial DLA is shown to approach a size-independent limit. The power-law expected from an asymptotic fractal dimension D=1.71 arises only for very…
Generative models show great promise for the inverse design of molecules and inorganic crystals, but remain largely ineffective within more complex structures such as amorphous materials. Here, we present a diffusion model that reliably…
We prove that, on the infinite Sierpinski gasket graph SG, rotor walk with random initial configuration of rotors is recurrent. We also give a necessary condition for an i.i.d. sandpile to stabilize. In particular, we prove that an i.i.d.…
We propose a revision of the classic mean-field approach of diffusion-limited aggregation (DLA) model originally introduced by Witten and Sander [Phys. Rev. Lett. 47, 1400 (1981)]. The derived nonlinear mean-field equations providing…
In this paper, we consider a non-homogeneous discrete-time Markov chain which can be seen as a toy model for the growth of the arms of the DLA (Diffusion limited aggregation) process in a sub-linear wedge. It is conjectured that in a thin…
I analyze the topological structures generated by diffusion-limited aggregation (DLA), using the recently developed "branched growth model". The computed bifurcation number B for DLA in two dimensions is B ~ 4.9, in good agreement with the…
In 1966, Konheim and Weiss [33] introduced a now classical parking protocol. The deterministic process and its resultant objects, known as parking functions, have since become a favorite object of study in enumerative combinatorics. In our…
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…
In this article we propose and validate an unsupervised probabilistic model, Gaussian Latent Dirichlet Allocation (GLDA), for the problem of discrete state discovery from repeated, multivariate psychophysiological samples collected from…
Strongly intermittent turbulence is observed in the shadow of a limiter in the Large Plasma Device (LAPD) at UCLA [W. Gekelman, H. Pfister, Z. Lucky, J. Bamber, D. Leneman, and J. Maggs, Rev. Sci. Inst. {\bfseries 62}, 2875 (1991)]. The…
This article proposes an active learning method for high dimensional data, based on intrinsic data geometries learned through diffusion processes on graphs. Diffusion distances are used to parametrize low-dimensional structures on the…
Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence $\mathcal{D}$ and with surplus $k$. We call those random graphs…
When dissipative particles are left alone, their fluctuation energy decays due to collisional interactions, clusters build up and grow with time until the system size is reached. When the effective dissipation is strong enough, this may…
This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the…