Log-Concave Functions And Poset Probabilities
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
elements of some (finite) poset \(\), write \(\) for the probability that \(\) precedes \(\) in a random (uniform) linear extension of \(\). For \(\) define
where the infimum is over all choices of \(\) and distinct \(\).
Addressing an issue raised by Fishburn , we give the first nontrivial lower bounds on the function \(\). This is part of a more general geometric result, the exact determination of the function
where the infimum is over \(\) chosen uniformly from some compact convex subset of a Euclidean space.
These results are mainly based on the Brunn–Minkowski Theorem and a theorem of Keith Ball , which allow us to reduce to a 2-dimensional version of the problem.
Received: October 6, 1997
- Log-Concave Functions And Poset Probabilities
Volume 18, Issue 1 , pp 85-99
- Cover Date
- Print ISSN
- Online ISSN
- Bolyai Society – Springer-Verlag
- Additional Links
- AMS Subject Classification (1991) Classes: 52A40, 52C07, 06A07
- Industry Sectors