相关论文: Mean-field approach to Random Apollonian Packing
We present the first study of disordered jammed hard-sphere packings in four-, five- and six-dimensional Euclidean spaces. Using a collision-driven packing generation algorithm, we obtain the first estimates for the packing fractions of the…
We introduce a family of complex networks that interpolates between the Apollonian network and its binary version, recently introduced in [Phys. Rev. E \textbf{107}, 024305 (2023)], via random removal of nodes. The dilution process allows…
We introduce a model for a sandpile, with N sites, critical height N and each site connected to every other site. It is thus a mean-field model in the spin-glass sense. We find an exact solution for the steady state probability distribution…
We propose a mean-field method to calculate approximately the spacing distribution functions $p^{(n)}(s)$ in 1D classical many-particle systems. We compare our method with two other commonly used methods, the independent interval…
Randomly branching polymers with {\em annealed} connectivity are model systems for ring polymers and chromosomes. In this context, the branched structure represents transient folding induced by topological constraints. Here we present…
The methods of determining the fractal dimension and irregularity scale in simulated galaxy catalogs and the application of these methods to the data of the 2dF and 6dF catalogs are analyzed. Correlation methods are shown to be correctly…
The stochastic models investigated in this paper describe the evolution of a set of $F_N$ identical balls scattered into $N$ urns connected by an underlying symmetrical graph with constant degree $h_N$. After some random amount of time {\em…
A circle of curvature $n\in\mathbb{Z}^+$ is a part of finitely many primitive integral Apollonian circle packings. Each such packing has a circle of minimal curvature $-c\leq 0$, and we study the distribution of $c/n$ across all primitive…
We study the asymptotic behavior of least-squares cross-validation bandwidth selection in kernel density estimation on the $d$-dimensional hypersphere, $d\geq 1$. We show that the exact rate of convergence with respect to the optimal…
We derive exact statistical properties of a class of recursive fragmentation processes. We show that introducing a fragmentation probability 0<p<1 leads to a purely algebraic size distribution in one dimension, P(x) ~ x^{-2p}. In d…
In this letter, we used a combination of DEM and the multi-sphere method to investigate the random packing dynamics of $\Sigma_{2v}(2\pi/3)$-triplets. These triplets consist of three overlapping primary spheres, forming a bent structure…
We study the ballistic adsorption of a polydisperse mixture of spheres onto a line. Within a mean-field approximation, the problem can be analytically solved by means of a kinetic equation for the gap distribution. In the mean-field…
Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. In Euclidean space it is possible for every circle in such a packing to have integer radius of curvature,…
The aim of the study presented here was the analysis of packings generated according to random sequential adsorption protocol consisting of identical Platonic and Archimedean solids. The computer simulations performed showed, that the…
Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information…
The aim of this paper is to review and discuss qualitatively some results on the properties of amorphous packings of hard spheres that were recently obtained by means of the replica method. The theory gives predictions for the equation of…
Through extensive Monte Carlo simulations, we systematically study the effect of chain stiffness on the packing ability of linear polymers composed of hard spheres in extremely confined monolayers, corresponding effectively to 2D films.…
This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…
Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…
The concepts of spread and spread dimension of a metric space were introduced by Willerton in the context of quantifying biodiversity of ecosystems. This paper develops practical applications of spread dimension in the context of machine…