Related papers: Three Distributions in the Extended Occupancy Prob…
We study critical spreading in a surface-modified directed percolation model in which the left- and right-most sites have different occupation probabilities than in the bulk. As we vary the probability for growth at an edge, the critical…
A length-$n$ random sequence $X_1,\ldots,X_n$ in a space $S$ is finitely exchangeable if its distribution is invariant under all $n!$ permutations of coordinates. Given $N > n$, we study the extendibility problem: when is it the case that…
We model the joint distribution of choice probabilities and decision times in binary choice tasks as the solution to a problem of optimal sequential sampling, where the agent is uncertain of the utility of each action and pays a constant…
The possibility of flexibly assigning spectrum resources with channels of different sizes greatly improves the spectral efficiency of optical networks, but can also lead to unwanted spectrum fragmentation.We study this problem in a scenario…
We consider the problem of distinguishing between two arbitrary black-box distributions defined over the domain [n], given access to $s$ samples from both. It is known that in the worst case O(n^{2/3}) samples is both necessary and…
We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…
We consider a class of small-sample distribution estimators over noisy channels. Our estimators are designed for repetition channels, and rely on properties of the runs of the observed sequences. These runs are modeled via a special type of…
We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks for finding the minimum number of bins to pack all the items…
Consider a finite number of balls initially placed in $L$ bins. At each time step a ball is taken from each non-empty bin. Then all the balls are uniformly reassigned into bins. This finite Markov chain is called Repeated Balls-into-Bins…
We derive functional equations for distributions of six classical statistics (ascents, descents, left-to-right maxima, right-to-left maxima, left-to-right minima, and right-to-left minima) on separable and irreducible separable…
In the classical occupancy scheme, one considers a fixed discrete probability measure ${\bf p}=(p_i: {i\in{\cal I}})$ and throws balls independently at random in boxes labeled by ${\cal I}$, such that $p_i$ is the probability that a given…
We study distribution testing in the standard access model and the conditional access model when the memory available to the testing algorithm is bounded. In both scenarios, the samples appear in an online fashion and the goal is to test…
A semi-Markov process is one that changes states in accordance with a Markov chain but takes a random amount of time between changes. We consider the generalisation to semi-Markov processes of the classical Lamperti law for the occupation…
The Oslo sandpile model, or if one wants to be precise, ricepile model, is a cellular automaton designed to model experiments on granular piles displaying self-organized criticality. We present an analytic treatment that allows the…
In this article, the exponentiated discrete Lindley distribution is presented and studied. Some important distributional properties are discussed. Using the maximum likelihood method, estimation of the model parameters is investigated.…
In this paper we consider distributed allocation problems with memory constraint limits. Firstly, we propose a tractable relaxation to the problem of optimal symmetric allocations from [1]. The approximated problem is based on the Q-error…
In this paper three new characterizing theorems of exponential distribution are presented. They are based on equidistribution of some functions of order statistics. All of them include the median of sample of size three.
In this paper we propose a family of multivariate asymmetric distributions over an arbitrary subset of set of real numbers which is defined in terms of the well-known elliptically symmetric distributions. We explore essential properties,…
Brownian diffusion subject to stochastic resetting to a fixed position has been widely studied for applications to random search processes. In an unbounded domain, the mean first-passage time at a target site can be minimized for a…
We introduce a four-parameter extended family of distributions related to the wrapped Cauchy distribution on the circle. The proposed family can be derived by altering the settings of a problem in Brownian motion which generates the wrapped…