Related papers: Univariate approximations in the infinite occupanc…
The occupation time of an age-dependent branching particle system in $\Rd$ is considered, where the initial population is a Poisson random field and the particles are subject to symmetric $\alpha$-stable migration, critical binary branching…
Motivated by a transit line planning problem in transportation systems, we investigate the following capacitated assignment problem under a budget constraint. Our model involves $L$ bins and $P$ items. Each bin $l$ has a utilization cost…
Optimal quantization for mixed distributions has emerged as a compelling area of study. In this work, we have focused on a mixed distribution formed from two uniform distributions with partially overlapping supports. For this class of…
A stochastic ordering approach is applied with Stein's method for approximation by the equilibrium distribution of a birth-death process. The usual stochastic order and the more general s-convex orders are discussed. Attention is focused on…
We present a strategy for mapping the dynamics of a fermionic quantum system to a set of classical dynamical variables. The approach is based on imposing the correspondence relation between the commutator and the Poisson bracket, preserving…
A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…
We study the problem of distributional approximations to high-dimensional non-degenerate $U$-statistics with random kernels of diverging orders. Infinite-order $U$-statistics (IOUS) are a useful tool for constructing simultaneous prediction…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
We study the poor-biased model for money exchange introduced in [2]: agents are being randomly picked at a rate proportional to their current wealth, and then the selected agent gives a dollar to another agent picked uniformly at random.…
Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…
A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size and then construct a solution by combining the solutions of…
We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…
We study Boolean models on Riemannian symmetric spaces driven by homogeneous insertion- or deletion-tolerant point processes. We prove that in both the set covered by the balls (the occupied set) and its complement (the vacant set), one…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e.,…
This paper describes a class of probabilistic approximation algorithms based on bucket elimination which offer adjustable levels of accuracy and efficiency. We analyze the approximation for several tasks: finding the most probable…
Neural computations arising from myriads of interactions between spiking neurons can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this…
Probability boxes, also known as $p$-boxes, correspond to sets of probability distributions bounded by a pair of distribution functions. They fall into the class of models known as imprecise probabilities. One of the central questions…