Related papers: Finite-sample frequency distributions originating …

We present a method for the approximate propagation of mean and covariance of a probability distribution through ordinary differential equations (ODE) with discontinous right-hand side. For piecewise affine systems, a normalization of the…

Let $\mathbf{a}_{ij}$, $1\leq i\leq j\leq n$, be independent random variables and $\mathbf{a}_{ji}=\mathbf{a}_{ij}$, for all $i,j$. Suppose that every $\mathbf{a}_{ij}$ is bounded, has zero mean, and its variance is given by…

We consider the urn setting with two different objects, ``good'' and ``bad'', and analyze the number of draws without replacement until a good object is picked. Although the expected number of draws for this setting is a standard textbook…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

First order stochastic dominance and monotone likelihood ratio are two partial orders on the $n$-probability simplex that play an important role in the establishment of structural results for MDPs and POMDPs. We study the strength of those…

Given a sequence of $n$ identically distributed random variables with common distribution $F$, the \emph{fragility distribution of order $m$}, represented by $\FD$, is the limit conditional distribution of the number of exceedances given…

In Bayesian inference, we seek to compute information about random variables such as moments or quantiles on the basis of {available data} and prior information. When the distribution of random variables is {intractable}, Monte Carlo (MC)…

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…

Trait allocations are a class of combinatorial structures in which data may belong to multiple groups and may have different levels of belonging in each group. Often the data are also exchangeable, i.e., their joint distribution is…

For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas…

We consider the problem of sequential sampling from a finite number of independent statistical populations to maximize the expected infinite horizon average outcome per period, under a constraint that the expected average sampling cost does…

Unnormalized probability distributions are central to modeling complex physical systems across various scientific domains. Traditional sampling methods, such as Markov Chain Monte Carlo (MCMC), often suffer from slow convergence, critical…

We consider distributions of ordered random vectors with given one-dimensional marginal distributions. We give an elementary necessary and sufficient condition for the existence of such a distribution with finite entropy. In this case, we…

We compute the full probability distribution of the spectral form factor in the self-dual kicked Ising model by providing an exact lower bound for each moment and verifying numerically that the latter is saturated. We show that at large…

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the…

Let $\mathcal{P}_n$ be the set of all probability mass functions (PMFs) $(p_1,p_2,\ldots,p_n)$ that satisfy $p_i>0$ for $1\leq i \leq n$. Define the minimum expected length function $\mathcal{L}_D :\mathcal{P}_n \rightarrow \mathbb{R}$ such…

We take an $L_1$-dense class of functions $\Cal F$ on a measurable space $(X,\Cal X)$ together with a sequence of independent, identically distributed $X$-space valued random variables $\xi_1,\dots,\xi_n$ and give a good estimate on the…

The estimation of categorical distributions under marginal constraints summarizing some sample from a population in the most-generalizable way is key for many machine-learning and data-driven approaches. We provide a parameter-agnostic…

Distributed consensus and other linear systems with system stochastic matrices $W_k$ emerge in various settings, like opinion formation in social networks, rendezvous of robots, and distributed inference in sensor networks. The matrices…