Related papers: Covering a compact space by fixed-radius or growin…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
We study the approximation of a Markov chain on a reduced state space, for both discrete- and continuous-time Markov chains. In this context, we extend the existing theory of formal error bounds for the approximated transient distributions.…
In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…
The Euclidean concentration inequality states that, among sets with fixed volume, balls have $r$-neighborhoods of minimal volume for every $r>0$. On an arbitrary set, the deviation of this volume growth from that of a ball is shown to…
Consider a discrete time, ergodic Markov chain with finite state space which is started from stationarity. Fill and Lyzinski (2014) showed that, in some cases, the hitting time for a given state may be represented as a sum of a geometric…
We study branching Markov chains on a countable state space (space of types) $\mathscr{X}$, with the focus on the qualitative aspects of the limit behaviour of the evolving empirical population distributions. No conditions are imposed on…
In this paper, we are interested in investigating the perturbation bounds for the stationary distributions for discrete-time or continuous-time Markov chains on a countable state space. For discrete-time Markov chains, two new norm-wise…
We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice [Phys. Rev. E, \textbf{87} 052107 (2013)],…
Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…
We introduce a solvable model of randomly growing systems consisting of many independent subunits. Scaling relations and growth rate distributions in the limit of infinite subunits are analysed theoretically. Various types of scaling…
We revisit a version of the classic occupancy scheme, where balls are thrown until almost all boxes receive a given number of balls. Special cases are widely known as coupon-collectors and dixie cup problems. We show that as the number of…
We present a new step in our systematic effort to develop self-consistent dynamical models with a finite radial extent. The focus is on models with simple analytical density profiles allowing for analytical calculations of many dynamical…
From the smallest biological systems to the largest cosmological structures, spatial domains undergo expansion and contraction. Within these growing domains, diffusive transport is a common phenomenon. Mathematical models have been widely…
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
In this work, we solve an open problem mentioned in Xiao (2010) and provide sharp bounds on the rate of growth of maximal moments for stationary symmetric stable random fields using structure theorem of finitely generated abelian groups and…
We consider point clouds obtained as random samples of a measure on a Euclidean domain. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. Our goal is to…
Characteristic functions that are radially symmetric have a dual interpretation, as they can be used as the isotropic correlation functions of spatial random fields. Extensions of isotropic correlation functions from balls into…
In the metric multi-cover problem (MMC), we are given two point sets $Y$ (servers) and $X$ (clients) in an arbitrary metric space $(X \cup Y, d)$, a positive integer $k$ that represents the coverage demand of each client, and a constant…
We describe a general strategy for sampling configurations from a given distribution, NOT based on the standard Metropolis (Markov chain) strategy. It uses the fact that nontrivial problems in statistical physics are high dimensional and…
We investigate lower asymptotic bounds of number variances for invariant locally square-integrable random measures on Euclidean and real hyperbolic spaces. In the Euclidean case we show that there are subsequences of radii for which the…