Related papers: Separations inside a cube
We examine the integrated squared difference, also known as the L2 distance (L2D), between two probability densities. Such a distance metric allows for comparison of differences between pairs of distributions or changes in a distribution…
We investigate the problem of ballistically controlled reactions where particles either annihilate upon collision with probability $p$, or undergo an elastic shock with probability $1-p$. Restricting to homogeneous systems, we provide in…
Two qubits is the simplest system where the notions of separable and entangled states and entanglement witnesses first appear. We give a three dimensional geometric description of these notions. This description however carries no…
Diffusion in an evolving environment is studied by continuos-time Monte Carlo simulations. Diffusion is modelled by continuos-time random walkers on a lattice, in a dynamic environment provided by bubbles between two one-dimensional…
The paper proposes Monte Carlo algorithms for the computation of the information rate of two-dimensional source/channel models. The focus of the paper is on binary-input channels with constraints on the allowed input configurations. The…
The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…
Stochastic separation theorems play important role in high-dimensional data analysis and machine learning. It turns out that in high dimension any point of a random set of points can be separated from other points by a hyperplane with high…
In this paper using the concept of the extended Hamming code we give a construction for dense packing of points at distance at least one in such unit cubes which dimension are a power of two.
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…
The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is…
In the open circular billiard particles are placed initially with a uniform distribution in their positions inside a planar circular vesicle. They all have velocities of the same magnitude, whose initial directions are also uniformly…
We study the probability of two Brownian particles to meet before one of them exits a finite interval. We obtain an explicit expression for the probability as a function of the initial distance of the two particles using the Weierstrass…
We describe two distinct approaches to obtaining cloud point densities and coexistence properties of polydisperse fluid mixtures by Monte Carlo simulation within the grand canonical ensemble. The first method determines the chemical…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
We investigate large deviations for the empirical measure of the position and momentum of a particle traveling in a box with hot walls. The particle travels with uniform speed from left to right, until it hits the right boundary. Then it is…
The problem of sampling according to the probability distribution minimizing a given free energy, using interacting particles unadjusted kinetic Langevin Monte Carlo, is addressed. In this setting, three sources of error arise, related to…
In this paper, some equations are derived to describe the out-of-equilibrium thermodynamics of colloidal suspensions. These results are obtained assuming that the properties of the colloids essentially come from their surfaces which are…
We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…
We give separability criteria for general multi-qubit states in terms of diagonal and anti-diagonal entries. We define two numbers which are obtained from diagonal and anti-diagonal entries, respectively, and compare them to get criteria.…
For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…