中文
相关论文

相关论文: Exchangeable Gibbs partitions and Stirling triangl…

200 篇论文

A two-parameter family of exchangeable partitions with a simple updating rule is introduced. The partition is identified with a randomized version of a standard symmetric Dirichlet species-sampling model with finitely many types. A…

概率论 · 数学 2010-01-27 Alexander Gnedin

A simple explicit construction is provided of a partition-valued fragmentation process whose distribution on partitions of $[n]=\{1,...,n\}$ at time $\theta \ge 0$ is governed by the Ewens sampling formula with parameter $\theta$. These…

概率论 · 数学 2007-05-23 Alexander Gnedin , Jim Pitman

Kingman derived the Ewens sampling formula for random partitions from the genealogy model defined by a Poisson process of mutations along lines of descent governed by a simple coalescent process. M\"ohle described the recursion which…

概率论 · 数学 2007-07-12 Rui Dong

For an integer $n\geq1$, consider a random partition $\Pi_{n}$ of $\{1,\ldots,n\}$ into $K_{n}$ partition sets with $K_{r,n}$ partition subsets of size $r=1,\ldots,n$, and assume $\Pi_{n}$ distributed according to the Ewens-Pitman model…

概率论 · 数学 2026-01-19 Bernard Bercu , Stefano Favaro

Let $S_n$ denote the set of permutations of $n$ labels. We consider a class of Gibbs probability models on $S_n$ that is a subfamily of the so-called Mallows model of random permutations. The Gibbs energy is given by a class of right…

概率论 · 数学 2024-06-28 Soumik Pal

For any partition of $\{1, 2, ..., n\}$ we define its {\it increments} $X_i, 1 \le i \le n$ by $X_i = 1$ if $i$ is the smallest element in the partition block that contains it, $X_i = 0$ otherwise. We prove that for partially exchangeable…

概率论 · 数学 2007-05-23 Serban Nacu

The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows,…

组合数学 · 数学 2017-05-24 Boris Pittel

Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…

adap-org · 物理学 2009-10-30 F F Ferreira , J F Fontanari

Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…

组合数学 · 数学 2021-07-09 Andrew V. Sills

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…

概率论 · 数学 2019-04-09 Inés Armendáriz , Pablo A. Ferrari , Nicolás Frevenza

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

概率论 · 数学 2007-05-23 Alexander Gnedin

Given a periodic point $\omega$ in a $\psi$-mixing shift with countable alphabet, the sequence $\{S_{n}\}$ of random variables counting the number of multiple returns to shrinking cylindrical neighborhoods of $\omega$ is considered.…

概率论 · 数学 2017-03-31 Ariel Rapaport

Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…

概率论 · 数学 2016-08-09 Ljuben Mutafchiev

An integer partition of $n$ is called graphical if its parts form a degree sequence of a simple graph. While unrestricted graphical partitions have been extensively studied, much less is known when the parts are restricted to a prescribed…

数论 · 数学 2026-04-02 Gilead Levy

Problem 1.5.7 from Pitman's Saint-Flour lecture notes: Does there exist for each n a fragmentation process (\Pi_{n,k}, 1 \leq k \leq n) taking values in the space of partitions of {1,2,...,n} such that \Pi_{n,k} is distributed like the…

概率论 · 数学 2007-12-05 Christina Goldschmidt , James B. Martin , Dario Spanò

Two old conjectures from problem sections, one of which from SIAM Review, concern the question of finding distributions that maximize P(Sn <= t), where Sn is the sum of i.i.d. random variables X1, ..., Xn on the interval [0,1], satisfying…

概率论 · 数学 2008-08-13 Ludolf E. Meester

Kingman derived the Ewens sampling formula for random partitions describing the genetic variation in a neutral mutation model defined by a Poisson process of mutations along lines of descent governed by a simple coalescent process, and…

概率论 · 数学 2007-05-23 Rui Dong , Alexander Gnedin , Jim Pitman

A central problem in computational statistics is to convert a procedure for sampling combinatorial from an objects into a procedure for counting those objects, and vice versa. Weconsider sampling problems coming from *Gibbs distributions*,…

概率论 · 数学 2023-08-21 David G. Harris , Vladimir Kolmogorov

The Ewens sampling formula with parameter $\alpha$ is the distribution on $S_n$ which gives each $\pi\in S_n$ weight proportional to $\alpha^{C(\pi)}$, where $C(\pi)$ is the number of cycles of $\pi$. We show that, for any fixed $\alpha$,…

群论 · 数学 2019-01-23 Sean Eberhard

A sequence of random variables is exchangeable if its joint distribution is invariant under variable permutations. We introduce exchangeable variable models (EVMs) as a novel class of probabilistic models whose basic building blocks are…

机器学习 · 计算机科学 2014-05-06 Mathias Niepert , Pedro Domingos