Related papers: A Bose-Einstein Approach to the Random Partitionin…
We study the empirical measure associated to a sample of size $n$ and modified by $N$ iterations of the raking-ratio method. This empirical measure is adjusted to match the true probability of sets in a finite partition which changes each…
The entanglement between spatial regions in an interacting Bose-Einstein condensate is investigated using a quantum field theoretic formalism. Regions that are small compared to the healing length are governed by a non-relativistic quantum…
We apply a Boltzmann approach to the kinetic regime of a relativistic Bose-Einstein condensate of scalar bosons by decomposing the one-particle distribution function in a condensate part and a non-zero momentum part of excited modes,…
In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and…
Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets from F, covering U with k sets from F, and packing k…
We investigate by means of numerical simulations the possibilities of tomographic techniques applied to a Bose-Einstein condensate in order to reconstruct its ground state. Essentially, two scenarios are considered for which the density…
We describe boson sampling of interacting atoms from the noncondensed fraction of Bose-Einstein-condensed (BEC) gas confined in a box trap as a new platform for studying computational #P-hardness and quantum supremacy of many-body systems.…
We investigate the Bose-Einstein Condensation on nonhomogeneous amenable networks for the model describing arrays of Josephson junctions. The resulting topological model, whose Hamiltonian is the pure hopping one given by the opposite of…
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add…
Given a tree $T$ on $n$ vertices, and $k, b, s_1, \ldots, s_b \in N$, the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting components can be grouped into $b$ groups such that the number of…
We propose a one-dimensional nonintegrable spin model with local interactions that covers Dyson's three symmetry classes (classes A, AI, and AII) depending on the values of parameters. We show that the nearest-neighbor spacing distribution…
We present ${\rm poly\log\log n}$-round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into $k$ parts such that a node of degree $d(u)$ has $\approx d(u)/k$ neighbors in each part. Our…
For many-particle systems, quantum information in base n can be defined by partitioning the set of states according to the outcomes of n-ary (joint) observables. Thereby, k particles can carry k nits. With regards to the randomness of…
It is generally hard to count, or even estimate, how many integer points lie in a polytope P. Barvinok and Hartigan have approached the problem by way of information theory, showing how to efficiently compute a random vector which samples…
Out of thermal equilibrium, bosonic quantum systems can Bose-condense away from the ground state, featuring a macroscopic occupation of an excited state or even of multiple states in the so-called Bose-selection scenario. In previous work,…
In this work, we investigate a symmetric deformed random matrix, which is obtained by perturbing the diagonal elements of the Wigner matrix. The eigenvector $\mathbf{x}_{\rm min}$ of the minimal eigenvalue $\lambda_{\rm min}$ of the…
We consider the problem of finding the $k^{th}$ highest element in a totally ordered set of $n$ elements (select), and partitioning a totally ordered set into the top $k$ and bottom $n-k$ elements (partition) using pairwise comparisons.…
This review describes quantum systems of bosonic particles moving on a lattice. These models are relevant in statistical physics, and have natural ties with probability theory. The general setting is recalled and the main questions about…
A stochastic algorithm is proposed, finding some elements from the set of intrinsic $p$-mean(s) associated to a probability measure $\nu$ on a compact Riemannian manifold and to $p\in[1,\infty)$. It is fed sequentially with independent…
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…