Related papers: Maximum gaps in one-dimensional hard-core models
Fix $t \geq 2$. We first give an asymptotic formula for certain sums of the number of $t$-cores. We then use this result to compute the distribution of the size of the $t$-core of a uniformly random partition of an integer $n$. We show that…
This paper studies the extreme gaps between eigenvalues of random matrices. We give the joint limiting law of the smallest gaps for Haar-distributed unitary matrices and matrices from the Gaussian unitary ensemble. In particular, the kth…
We consider hard-disc mixtures with disc sizes within ratio $\sqrt{2}-1$, that is, the small disc exactly fits in the hole between four large discs. For each prescribed stoichiometry of large and small discs, the densest packings are…
We study cluster sizes in supercritical $d$-dimensional inhomogeneous percolation models with long-range edges -- such as long-range percolation -- and/or heavy-tailed degree distributions -- such as geometric inhomogeneous random graphs…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
A quantum Monte Carlo simulation of a system of hard rods in one dimension is presented and discussed. The calculation is exact since the analytical form of the wavefunction is known, and is in excellent agreement with predictions obtained…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We consider linear arrays of cells of volume $V_\mathrm{c}$ populated by monodisperse rods of size $\sigma V_\mathrm{c}$, $\sigma=1,2,\ldots$, subject to hardcore exclusion interaction. Each rod experiences a position-dependent external…
The maximum likelihood estimation of the left-truncated log-logistic distribution with a given truncation point is analyzed in detail from both mathematical and numerical perspectives. These maximum likelihood equations often do not possess…
We consider inference for high-dimensional separately and jointly exchangeable arrays where the dimensions may be much larger than the sample sizes. For both exchangeable arrays, we first derive high-dimensional central limit theorems over…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…
We present here a variational method for maximizing the bandgap in a one-dimensional system where the potential is subject to given constraints. Two specific examples are studied in detail. In the first, we show that if the potential is…
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of…
We consider the model of random sequential adsorption, with depositing objects, as well as those already at the surface, decreasing in size according to a specified time dependence, from a larger initial value to a finite value in the large…
We use variational convergence to derive a hierarchy of one-dimensional rod theories, starting out from three-dimensional models in nonlinear elasticity subject to local volume-preservation. The densities of the resulting $\Gamma$-limits…
We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge…
We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…