相关论文: Mean-field approach to Random Apollonian Packing
Radiative transfer simulation is an important tool that allows us to generate synthetic images of various astrophysical objects. In the case of complex three-dimensional geometries, a Monte Carlo-based method that simulates photon packages…
We study the abelian sandpile model on decorated one dimensional chains. We determine the structure and the asymptotic form of distribution of avalanche-sizes in these models, and show that these differ qualitatively from the behavior on a…
Random sequential addition (RSA) models are used in a large variety of contexts to model particle aggregation and jamming. A key feature of these models is the algebraic time dependence of the asymptotic jamming coverage as $t\to\infty$.…
Random fields are useful mathematical tools for representing natural phenomena with complex dependence structures in space and/or time. In particular, the Gaussian random field is commonly used due to its attractive properties and…
We investigate equal spheres packings generated from several experiments and from a large number of different numerical simulations. The structural organization of these disordered packings is studied in terms of the network of common…
Aqueous foams are subject to coarsening, whereby gas from the bubbles diffuses through the liquid phase. Gas is preferentially transported from small to large bubbles, resulting in a gradual decrease of the number of bubbles and an increase…
Motivated by a recently identified severe discrepancy between a static and a dynamic theory of glasses, we numerically investigate the behavior of dense hard spheres in spatial dimensions 3 to 12. Our results are consistent with the static…
Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. Such packings can be described in terms of the Descartes configurations they contain. It observed…
Riemannian diffusion models draw inspiration from standard Euclidean space diffusion models to learn distributions on general manifolds. Unfortunately, the additional geometric complexity renders the diffusion transition term inexpressible…
Using methods of conformal field theory, we conjecture an exact form for the probability that n distinct clusters span a large rectangle or open cylinder of aspect ratio k, in the limit when k is large.
In this letter, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf Random Apollonian Networks}(RANs) as they can be considered…
We study random tiling models in the limit of high rotational symmetry. In this limit a mean-field theory yields reasonable predictions for the configurational entropy of free boundary rhombus tilings in two dimensions. We base our…
A new formalism is presented for analytically obtaining the probability density function, \( P_{n}(s) \), for the distance between two random points in an \( n \)-dimensional sphere of radius \( R \). Our formalism allows \( P_{n}(s) \) to…
Originally motivated by the morphogenesis of bacterial microcolonies, the aim of this article is to explore models through different scales for a spatial population of interacting, growing and dividing particles. We start from a microscopic…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…
We consider the speed of propagation of a {continuous-time continuous-space} branching random walk with the additional restriction that the birth rate at any spatial point cannot exceed $1$. The dispersion kernel is taken to have density…
We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, we build our complex dynamically in the following fashion. We introduce new…
We describe the first known mean-field study of landing probabilities for random walks on hypergraphs. In particular, we examine clique-expansion and tensor methods and evaluate their mean-field characteristics over a class of random…
The densest amorphous packing of rigid particles is known as random close packing. It has long been appreciated that higher densities are achieved by using collections of particles with a variety of sizes. The variety of sizes is often…