Related papers: A Bose-Einstein Approach to the Random Partitionin…
In 1924, S. N. Bose proposed (i) a new counting method for photons and (ii) a probabilistic law of microscopic matter-radiation interactions, treating emission and absorption as two aspects of a single, field-dependent process. While…
This paper discusses a numerical method for computing the evolution of large interacting system of quantum particles. The idea of the random batch method is to replace the total interaction of each particle with the $N-1$ other particles by…
The properties of systems with Bose-Einstein condensate in external time-independent random potentials are investigated in the frame of a self-consistent stochastic mean-field approximation. General considerations are presented, which are…
Along the line of thoughts of Berry and Robnik\cite{[1]}, we investigated the gap distribution function of systems with infinitely many independent components, and discussed the level-spacing distribution of classically integrable quantum…
We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…
We discuss the properties of an ideal relativistic gas of events possessing Bose-Einstein statistics. We find that the mass spectrum of such a system is bounded by $\mu \leq m\leq 2M/\mu _K,$ where $\mu $ is the usual chemical potential,…
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
We study four problems: put $n$ distinguishable/non-distinguishable balls into $k$ non-empty distinguishable/non-distinguishable boxes randomly. What is the threshold function $k=k(n) $ to make almost sure that no two boxes contain the same…
We construct a new sufficient conditions for boundedness or continuity of arbitrary random fields relying on the so-called partition scheme, alike in the classical majorizing measure method. We deduce also the used in the practice…
A subset $C$ of edges in a $k$-uniform hypergraph $H$ is a \emph{loose Hamilton cycle} if $C$ covers all the vertices of $H$ and there exists a cyclic ordering of these vertices such that the edges in $C$ are segments of that order and such…
Boxicity of a graph $G(V,$ $E)$, denoted by $box(G)$, is the minimum integer $k$ such that $G$ can be represented as the intersection graph of axis parallel boxes in $\mathbb{R}^k$. The problem of computing boxicity is inapproximable even…
Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…
This paper exploits the connection between the quantum many-particle density of states and the partitioning of an integer in number theory. For $N$ bosons in a one dimensional harmonic oscillator potential, it is well known that the…
These notes deal with the mean-field approximation for equilibrium states of N-body systems in classical and quantum statistical mechanics. A general strategy for the justification of effective models based on statistical independence…
For any graph consisting of $k$ vertices and $m$ edges we construct an ensemble of random pure quantum states which describe a system composed of $2m$ subsystems. Each edge of the graph represents a bi-partite, maximally entangled state.…
A common approach for designing scalable algorithms for massive data sets is to distribute the computation across, say $k$, machines and process the data using limited communication between them. A particularly appealing framework here is…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…