Related papers: Exchangeable Gibbs partitions and Stirling triangl…

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

We construct an infinitely exchangeable process on the set $\cate$ of subsets of the power set of the natural numbers $\mathbb{N}$ via a Poisson point process with mean measure $\Lambda$ on the power set of $\mathbb{N}$. Each $E\in\cate$…

We obtain distribution-free bounds for various fundamental quantities used in probability theory by solving optimization problems that search for extreme distributions among all distributions with the same mean and dispersion. These…

We define a deterministic family of permutations generated by an alternating center-edge extraction process on the ordered set [n] = {1,2,...,n}. Starting from the ordered list (1,2,...,n), one repeatedly removes the median element or…

Based on previous work of Paul Ressel and myself, I show that the space of all "continuous" exchangeable probability measures on a certain set of order processes is a Bauer simplex.

Hausel and Rodriguez-Villegas recently observed that work of G\"ottsche, combined with a classical result of Erd\H{o}s and Lehner on integer partitions, implies that the limiting Betti distribution for the Hilbert schemes…

We study Dorfman's classical group testing protocol in a novel setting where individual specimen statuses are modeled as exchangeable random variables. We are motivated by infectious disease screening. In that case, specimens which arrive…

Consider a haploid population of fixed finite size with a finite number of allele types and having Cannings exchangeable genealogy with neutral mutation. The stationary distribution of the Markov chain of allele counts in each generation is…

We consider a general class of round-robin tournament models of equally strong players. In these models, each of the $n$ players competes against every other player exactly once. For each match between two players, the outcome is a value…

We introduce the notion of almost realizability, an arithmetic generalization of realizability for integer sequences, which is the property of counting periodic points for some map. We characterize the intersection between the set of…

We study the problem of sampling weighted partial triangulations of a convex polygon. We consider the distribution where each partial triangulation $\sigma$ is chosen with probability proportional to $\lambda^{|\sigma|}$, where $\lambda>0$…

An exchangeable pair approach is commonly taken in the normal and non-normal approximation using Stein's method. It has been successfully used to identify the limiting distribution and provide an error of approximation. However, when the…

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

We consider the product of \(k_{n}\) independent \(n\times n\) complex Ginibre matrices and denote its eigenvalues by \(Z_{1},\ldots ,Z_{n}\). Let \(\alpha = \lim_{n\to\infty} n / k_{n}\). Using the determinantal point process method, we…

We study sequences of partitions of a non decreasing sequence I n of intervals into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according…

G. Edelman, O. Sporns, and G. Tononi have introduced the neural complexity of a family of random variables, defining it as a specific average of mutual information over subfamilies. We show that their choice of weights satisfies two natural…

Ewens-Pitman's partition structure arises as a system of sampling consistent probability distributions on set partitions induced by the Pitman-Yor process. It is widely used in statistical applications, particularly in species sampling…

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

This paper investigates what can be inferred about an arbitrary continuous probability distribution from a finite sample of $N$ observations drawn from it. The central finding is that the $N$ sorted sample points partition the real line…