Related papers: On nested infinite occupancy scheme in random envi…
We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…
We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost…
We establish limit theorems for re-scaled occupation time fluctuations of a sequence of branching particle systems in $\R^d$ with anisotropic space motion and weakly degenerate splitting ability. In the case of large dimensions, our limit…
It is a common impression that by only setting the maximum occupation number to infinity, which is the demand of the indistinguishability of bosons, one can achieve the statistical distribution that bosons obey -- the Bose-Einstein…
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…
Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…
New method is developed for calculation of single-particle occupation numbers in finite Fermi systems of interacting particles. It is more accurate than the canonical distribution method and gives the Fermi-Dirac distribution in the limit…
Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…
We investigate a specific infinite urn scheme first considered by Karlin (1967). We prove functional central limit theorems for the total number of urns with at least k balls for different k.
It is the intention of this paper to rigorously clarify the role of the occupation numbers in the current practical applications of the density functional formalism. In these calculations one has to decide how to distribute a given, fixed…
The work continues the author's many-year research in theory of maximal branching processes, which are obtained from classical branching processes by replacing the summation of descendant numbers with taking the maximum. One can say that in…
We consider a system of interacting Fisher-Wright diffusions with seed-bank. Individuals carry type one of two types, live in colonies, and are subject to resampling and migration as long as they are active. Each colony has a structured…
Policy-makers are often faced with the task of distributing a limited supply of resources. To support decision-making in these settings, statisticians are confronted with two challenges: estimands are defined by allocation strategies that…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
Motivated by a neuroscience application we study the problem of statistical estimation of a high-dimensional covariance matrix with a block structure. The block model embeds a structural assumption: the population of items (neurons) can be…
We analyze systems of clusters and interacting upon colliding---a collision between two clusters may lead to merging or fragmentation---and we also investigate the influence of additional spontaneous fragmentation events. We consider both…
The classical double bubble theorem characterizes the minimizing partitions of $\mathbb{R}^n$ into three chambers, two of which have prescribed finite volume. In this paper we prove a variant of the double bubble theorem in which two of the…
We consider the problem of capacitated kinetic clustering in which $n$ mobile terminals and $k$ base stations with respective operating capacities are given. The task is to assign the mobile terminals to the base stations such that the…
We consider recurrent diffusive random walks on a strip. We present constructive conditions on Green functions of finite sub-domains which imply a Central Limit Theorem with polynomial error bound, a Local Limit Theorem, and mixing of…
We develop a new theoretical framework for describing steady-state quantum transport phenomena, based on the general maximum-entropy principle of non-equilibrium statistical mechanics. The general form of the many-body density matrix is…