Skip to Main content Skip to Navigation
Conference papers

Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex

Abstract : In this paper, we are concerned with random sampling of an n dimensional integral point on an $(n-1)$ dimensional simplex according to a multivariate discrete distribution. We employ sampling via Markov chain and propose two "hit-and-run'' chains, one is for approximate sampling and the other is for perfect sampling. We introduce an idea of alternating inequalities and show that a logarithmic separable concave function satisfies the alternating inequalities. If a probability function satisfies alternating inequalities, then our chain for approximate sampling mixes in $\textit{O}(n^2 \textit{ln}(Kɛ^{-1}))$, namely $(1/2)n(n-1) \textit{ln}(K ɛ^{-1})$, where $K$ is the side length of the simplex and $ɛ (0<ɛ<1)$ is an error rate. On the same condition, we design another chain and a perfect sampler based on monotone CFTP (Coupling from the Past). We discuss a condition that the expected number of total transitions of the chain in the perfect sampler is bounded by $\textit{O}(n^3 \textit{ln}(Kn))$.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184209
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 13, 2015 - 1:34:21 PM
Last modification on : Monday, May 17, 2021 - 12:00:04 PM
Long-term archiving on: : Saturday, November 14, 2015 - 10:21:57 AM

File

dmAD0135.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Shuji Kijima, Tomomi Matsui. Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.371-382, ⟨10.46298/dmtcs.3374⟩. ⟨hal-01184209⟩

Share

Metrics

Record views

42

Files downloads

401