Related papers: On intermediate levels of nested occupancy scheme …
We analyze the structure and stickiness in the chaotic components of generic Hamiltonian systems with divided phase space. Following the method proposed recently in Lozej and Robnik [Phys. Rev. E 98, 022220 (2018)], the sticky regions are…
With the help of Monte Carlo simulations and a mean-field theory, we investigate the ordered steady-state structures resulting from the motion of a single vacancy on a periodic lattice which is filled with two species of oppositely…
An infinite urn scheme is defined by a probability mass function $(p_j)_{j\geq1}$ over positive integers. A random allocation consists of a sample of $N$ independent drawings according to this probability distribution where $N$ may be…
In this paper we study the moment generating function and the moments of occupation time functionals of one-dimensional diffusions. Assuming, specifically, that the process lives on $\mathbb{R}$ and starts at~0, we apply Kac's moment…
Although exchangeable processes from Bayesian nonparametrics have been used as a generating mechanism for random partition models, we deviate from this paradigm to explicitly incorporate clustering information in the formulation of our…
This article studies the expected occupancy probabilities on an alphabet. Unlike the standard situation, where observations are assumed to be independent and identically distributed (iid), we assume that they follow a regime switching…
We examine a family of discrete probability distributions that describes the "spillage number" in the extended balls-in-bins model. The spillage number is defined as the number of balls that occupy their bins minus the total number of…
In [10], a `Markovian stick-breaking' process which generalizes the Dirichlet process $(\mu, \theta)$ with respect to a discrete base space ${\mathfrak X}$ was introduced. In particular, a sample from from the `Markovian stick-breaking'…
The distribution of the consecutive level-spacing ratio is now widely used as a tool to distinguish integrable from chaotic quantum spectra, mostly due to its avoiding of the numerical spectral unfolding. Similar to the use of the…
Randomized saturation designs are two-stage experiments: they first randomly assign treatment probabilities over the clusters and then randomly assign the treatment to the units within the clusters. The existing literature on randomized…
Balanced allocation of online balls-into-bins has long been an active area of research for efficient load balancing and hashing applications.There exists a large number of results in this domain for different settings, such as parallel…
We consider a supercritical branching random walk in time-inhomogeneous random environment with a random absorption barrier, i.e.,in each generation, only the individuals born below the barrier can survive and reproduce. Assume that the…
Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…
Distributed systems store data objects redundantly to balance the data access load over multiple nodes. Load balancing performance depends mainly on 1) the level of storage redundancy and 2) the assignment of data objects to storage nodes.…
We study the long-term behavior of the two-thinning variant of the classical balls-and-bins model. In this model, an overseer is provided with uniform random allocation of $m$ balls into $n$ bins in an on-line fashion. For each ball, the…
In the continuity of a recent paper ([6]), dealing with finite Markov chains, this paper proposes and analyzes a recursive algorithm for the approximation of the quasi-stationary distribution of a general Markov chain living on a compact…
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…
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 introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from (a x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of…
In this paper, we consider the subcritical branching random walk in a random environment. We assume the branching and the step jump are independent; and the branching is in random envirenment, i.e., the particles in generation $n$ produce…