相关论文: Diffusion Limited Aggregation on a Cylinder

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Recently, the diffusion-limited cluster aggregation (DLCA) model was restudied as a real-world example of showing discontinuous percolation transitions (PTs). Because a larger cluster is less mobile in Brownian motion, it comes into contact…

We present dla-ideal-solver, a high-performance framework for simulating two-dimensional Diffusion-Limited Aggregation (DLA) using Numba-accelerated Python. By leveraging just-in-time (JIT) compilation, we achieve computational throughput…

A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence.…

Let L be a Lie group and Lambda a lattice in L. Suppose G is a non-compact simple Lie group realized as a Lie subgroup of L, and the image of G on L/Lambda is dense. Let c be a diagonalizable element of G not contained in a compact…

Theoretical models of galaxy formation predict that galaxies acquire most of their baryons via cold mode accretion. Observations of high-redshift galaxies, while showing ubiquitous outflows, have so far not revealed convincing traces of the…

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…

The effect of introducing a mass dependent diffusion rate ~ m^{-alpha} in a model of coagulation with single-particle break up is studied both analytically and numerically. The model with alpha=0 is known to undergo a nonequilibrium phase…

A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1, \dots , n$ such that $d(i,i+1) \geq k$ for $1 \leq i \leq n-1$. $DL(G)$ denotes the maximum value of $k$ such that $G$ has a…

The evolution of the interface propagation in a slowly rotating half-filled horizontal cylinder is studied using MRI. Initially, the cylinder contains two axially segregated bands of small and large particles with a sharp interface. The…

The process of galaxy cluster formation likely leaves an imprint on the properties of its individual member galaxies. Understanding this process is essential for uncovering the evolutionary connections between galaxies and cosmic…

We consider in this work a model for aggregation, where the coalescing particles initially have a certain number of potential links (called arms) which are used to perform coagulations. There are two types of arms, male and female, and two…

The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…

We investigate the diffusion limited aggregation of particles executing persistent random walks. The scaling properties of both random walks and large aggregates are presented. The aggregates exhibit a crossover between ballistic and…

We study the packing fraction of clusters in free-falling streams of spherical and irregularly shaped particles using flash X-ray radiography. The estimated packing fraction of clusters is low enough to correspond to coordination numbers…

Observations of compact groups of galaxies (CGs) indicate that their abundance has not significantly changed since $z=0.2$. This balance between the timescales for formation and destruction of CGs is challenging if the typical timescale for…

We give an elementary proof that Talagrand's sub-Gaussian concentration inequality implies a limit shape theorem for first passage percolation on any Cayley graph of Z^d, with a bound on the speed of convergence that slightly improves…

We show that every graph $G$ on $n$ vertices with $\delta(G) \geq (1/2+\varepsilon)n$ is spanned by a complete blow-up of a cycle with clusters of nearly uniform size $\Omega(\log n)$. The proof is based on a recently introduced approach…

Damped Ly alpha clouds provide information on the chemistry of distant and metal poor regions of the universe. In these clouds for observational difficulties N and O are among the last elements to be measured, and C has still to be measured…

Under special conditions bacteria excrete an attractant and aggregate. The high density regions initially collapse into cylindrical structures, which subsequently destabilize and break up into spherical aggregates. This paper presents a…