arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0005267math.PRmath.CO
收藏

随机单调性和可实现单调性

Stochastic monotonicity and realizable monotonicity

James Allen Fill, Motoya Machida

摘要:

本文讨论了公共有限偏序集(偏序集)S上的概率测度系统的单调性的两个概念:随机性和可实现性,并将它们联系起来。我们给出反例表明,这两个概念并不总是等价的,但对于各种大类的S,我们也提出了条件的偏序集A是必要的和充分的等价。当A = S时,S的覆盖图没有圈的条件是等价的充要条件。这种情况下出现在比较适用性的完美的抽样算法Propp和威尔逊和本论文的第一作者。

英文摘要:

We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples to show that the two notions are not always equivalent, but for various large classes of S we also present conditions on the poset A that are necessary and sufficient for equivalence. When A = S, the condition that the cover graph of S have no cycles is necessary and sufficient for equivalence. This case arises in comparing applicability of the perfect sampling algorithms of Propp and Wilson and the first author of the present paper.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑