Stochastic monotonicity and realizable monotonicity

Details Stochastic monotonicity and realizable monotonicity Stochastic monotonicity and realizable monotonicity

2000-05-27

arxiv.org/abs/math/0005267v1

Mathematics

Probability

40 pages. See also http://www.mts.jhu.edu/~fill/ and http://www.mts.jhu.edu/~machida/ . Accepted (subject to revision); will

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stochastic monotonicity and realizable monotonicity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic monotonicity and realizable monotonicity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic monotonicity and realizable monotonicity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-409927