Related papers: Circle radius distributions determine random close…
The structural properties of dense random packings of identical hard spheres (HS) are investigated. The bond order parameter method is used to obtain detailed information on the local structural properties of the system for different…
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
This paper presents general relativistic numerical simulations of uniformly rotating polytropes. Equations are developed using MSQI coordinates, but taking a logarithm of the radial coordinate. The result is relatively simple elliptical…
Granular packings display a wealth of mechanical features which are of widespread significance. One of these features is creep: the slow deformation under applied stress. Creep is common for many other amorphous materials such as many…
\cite{tsagris2025a} proposed the generalized circular projected Cauchy (GCPC) distribution, whose special case is the wrapped Cauchy distribution. In this paper we first derive the relationship with the wrapped Cauchy distribution, and then…
We study concentration properties of random vectors of the form $AX$, where $X = (X_1, ..., X_n)$ has independent coordinates and $A$ is a given matrix. We show that the distribution of $AX$ is well spread in space whenever the…
Computing marginal distributions of discrete or semidiscrete Markov random fields (MRFs) is a fundamental, generally intractable problem with a vast number of applications in virtually all fields of science. We present a new family of…
We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing…
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…
(Abridged) We examine the radial entropy distribution and its scaling using 31 nearby galaxy clusters from the Representative XMM-Newton Cluster Structure Survey (REXCESS). The entropy profiles are robustly measured at least out to R_1000…
In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…
This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…
We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…
We determine the density expansion of the radius of gyration, of the hydrodynamic radius, and of the end-to-end distance for a monodisperse polymer solution in good-solvent conditions. We consider the scaling limit (large degree of…
The nature of randomness in disordered packings of frictional and frictionless spheres is investigated using theory and simulations of identical spherical grains. The entropy of the packings is defined through the force and volume ensemble…
The random packing fraction of binary particles in D-dimensional Euclidean space R^D is studied using a geometric approach. First, the binary packing fraction of assemblies with small size difference are studied, using the excluded volume…
It is well known that estimating the expectation of any given bounded random variable with values in $[-B, B]$ has a sample complexity of $\mathrm{O}(B^2/\epsilon^2)$ that is independent of the underlying probability measure. We show that…
We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…
We use a sample of 53 galaxy clusters at 0.03 < z < 0.1 with available masses derived from the caustic technique and with velocity dispersions computed using 208 galaxies on average per cluster, in order to investigate the scaling between…
We consider density estimators based on the nearest neighbors method applied to discrete point distibutions in spaces of arbitrary dimensionality. If the density is constant, the volume of a hypersphere centered at a random location is…