Related papers: Numerical calculation of granular entropy
Robustly determining the optimal number of clusters in a data set is an essential factor in a wide range of applications. Cluster enumeration becomes challenging when the true underlying structure in the observed data is corrupted by…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information transmission above which a given compact subset of the state…
We consider the Kolmogorov-Sinai entropy for dilute gases of $N$ hard disks or spheres. This can be expanded in density as $h_{\mathrm{KS}} \propto n N [\ln n a^d+ B + O(n a^d)+O(1/N)]$, with $a$ the diameter of the sphere or disk, $n$ the…
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this…
We propose an improved viscosity model accounting for experiments of emulsions of two immiscible liquids at arbitrary volume fractions and low shear rates. The model is based on a recursive-differential method formulated in terms of the…
There are three ways to conceptualize entropy: entropy as an extensive thermodynamic quantity of physical systems (Clausius, Boltzmann, Gibbs), entropy as a measure for information production of ergodic sources (Shannon), and entropy as a…
We extend our theory of amorphous packings of hard spheres to binary mixtures and more generally to multicomponent systems. The theory is based on the assumption that amorphous packings produced by typical experimental or numerical…
We study the build up of complexity on the example of 1 kg matter in different forms. We start on the simplest example of ideal gases, and then continue with more complex chemical, biological, life and social and technical structures. We…
As first shown by H. S. Green in 1952, the entropy of a classical fluid of identical particles can be written as a sum of many-particle contributions, each of them being a distinctive functional of all spatial distribution functions up to a…
We numerically simulate mechanically stable packings of soft-core, frictionless, bidisperse disks in two dimensions, above the jamming packing fraction $\phi_J$. For configurations with a fixed isotropic global stress tensor, we compute the…
We study the surface growth generated by the random deposition of particles of different sizes. A model is proposed where the particles are aggregated on an initially flat surface, giving rise to a rough interface and a porous bulk. By…
Mixture distributions are a workhorse model for multimodal data in information theory, signal processing, and machine learning. Yet even when each component density is simple, the differential entropy of the mixture is notoriously hard to…
Consider a system consisting of $n$ $d$-dimensional quantum particles and arbitrary pure state $\Psi$ of the whole system. Suppose we simultaneously perform complete von Neumann measurements on each particle. One can ask: what is the…
We study the (near or close to) ground state distribution of N softly repelling particles trapped in the interior of a spherical box. The charges mutually interact via an inverse power law potential of the form $1/r^\gamma$. We study three…
We perform numerical simulations of purely repulsive soft colloidal particles interacting via a generalized elastic potential and constrained to a two-dimensional plane and to the surface of a spherical shell. For the planar case, we…
We study the statistical mechanics of a closed random manifold of fixed area and fluctuating volume, encapsulating a fixed number of noninteracting particles. Scaling analysis yields a unified description of such swollen manifolds,…
What particle shape will generate the highest packing fraction when randomly poured into a container? In order to explore and navigate the enormous search space efficiently, we pair molecular dynamics simulations with artificial evolution.…
The Cluster Variation Method known in statistical mechanics and condensed matter is revived for weighted bipartite networks. The decomposition of a Hamiltonian through a finite number of components, whence serving to define variable…
We report an extension of the smoothed profile method (SPM)[Y. Nakayama, K. Kim, and R. Yamamoto, Eur. Phys. J. E {\bf 26}, 361(2008)], a direct numerical simulation method for calculating the complex modulus of the dispersion of particles,…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…