Related papers: Maximum gaps in one-dimensional hard-core models
Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…
We analyse the asymptotic behaviour of random instances of the Maximum Set Packing (MSP) optimization problem, also known as Maximum Matching or Maximum Strong Independent Set on Hypergraphs. We give an analytical prediction of the MSPs…
We compute the survival probability $<|S|^{2}>$ of large rapidity gaps (LRG) in a QCD based eikonal model with a dynamical gluon mass, where this dynamical infrared mass scale represents the onset of nonperturbative contributions to the…
We study a system of hard rods of finite size in one space dimension, which move by Brownian noise while avoiding overlap. We consider a scaling in which the number of particles tends to infinity while the volume fraction of the rods…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
A common challenge in computer experiments and related fields is to efficiently explore the input space using a small number of samples, i.e., the experimental design problem. Much of the recent focus in the computer experiment literature,…
We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded and bounded away from zero weights. We show that the rescaled passage time $\widetilde{\mathbf T}_{n,X}$ restricted to a compact set $X$ satisfies a…
The problem of optimizing over random structures emerges in many areas of science and engineering, ranging from statistical physics to machine learning and artificial intelligence. For many such structures finding optimal solutions by means…
We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width $W$ with infinite height. The objective is to find a packing of these items into the strip, which…
A one dimensional exclusion process is introduced where particles hop to a neighbouring vacant site with a rate that depends on the size of the block they belong to. This model is equivalent to a zero range process (ZRP) and shares the same…
By combining computer simulations and a unit cell model approach, we study the apparent bimodality of local structural ordering in a system of confined hard disks. It is shown that a two-dimensional (2D) array of hard disks confined…
We show that in the point process limit of the bulk eigenvalues of $\beta$-ensembles of random matrices, the probability of having no eigenvalue in a fixed interval of size $\lambda$ is given by \[\bigl(\…
In this talk we review the models describing the hard diffractive production of jets or more generally high-mass states in presence of rapidity gaps in hadron-hadron and lepton-hadron collisions. By rapidity gaps we mean regions on the lego…
This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…
In optimal control, extending the class of admissible controls is a common strategy to guarantee the existence of optimal solutions. However, such extensions may introduce a gap between the infimum of the original problem and the minimum of…
We investigate certain large deviation asymptotics concerning random interlacements in Z^d, d bigger or equal to 3. We find the principal exponential rate of decay for the probability that the average value of some suitable non-decreasing…
Maximum Mean Discrepancy (MMD) has been widely used in the areas of machine learning and statistics to quantify the distance between two distributions in the $p$-dimensional Euclidean space. The asymptotic property of the sample MMD has…
We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…
We prove new bounds on the additive gap between the value of a random integer program $\max c^Tx,\ Ax\leq b,\ x\in\{0,1\}^n$ with $m$ constraints and that of its linear programming relaxation for a wide range of distributions on $(A,b,c)$ .…
We study dense packings of disks and related Gibbs distributions representing high-density phases in the hard-core model on unit triangular, honeycomb and square lattices. The model is characterized by a Euclidean exclusion distance $D>0$…