Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 102 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 25 tok/s
GPT-5 High 35 tok/s Pro
GPT-4o 99 tok/s
GPT OSS 120B 472 tok/s Pro
Kimi K2 196 tok/s Pro
2000 character limit reached

Capacities on a finite lattice (1105.1395v1)

Published 6 May 2011 in math.PR

Abstract: In his influential work Choquet systematically studied capacities on Boolean algebras in a topological space, and gave a probabilistic interpretation for completely monotone (and completely alternating) capacities. Beyond complete monotonicity we can view a capacity as a marginal condition for probability distribution over the distributive lattice of dual order ideals. In this paper we discuss a combinatorial approach when capacities are defined over a finite lattice, and investigate Fr\'{e}chet bounds given the marginal condition, probabilistic interpretation of difference operators, and stochastic inequalities with completely monotone capacities.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)