English
Related papers

Related papers: Capacities on a finite lattice

200 papers

We consider the lattice, $\mathcal{L}$, of all subsets of a multidimensional contingency table and establish the properties of monotonicity and supermodularity for the marginalization function, $n(\cdot)$, on $\mathcal{L}$. We derive from…

Statistics Theory · Mathematics 2017-11-21 Caroline Uhler , Donald Richards

In this paper we develop a capacities theory connected with the fractional Sobolev spaces with variable exponents. Two kinds of capacities are studied: Sobolev capacity and relative capacity. Basic properties of capacities, including…

Functional Analysis · Mathematics 2024-10-15 Azeddine Baalal , Mohamed Berghout

We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability measures. Capacities on lattices address the general case where…

Discrete Mathematics · Computer Science 2007-11-14 Aoi Honda , Michel Grabisch

We investigate the problem of finding upper and lower bounds for a Choquet risk measure of a nonlinear function of two risk factors, when the marginal distributions of the risk factors are ambiguous and represented by nonadditive measures…

Probability · Mathematics 2023-05-19 Mario Ghossoub , David Saunders , Kelvin Shuangjian Zhang

We present results for Choquet integrals with minimal assumptions on the monotone set function through which they are defined. They include the equivalence of sublinearity and strong subadditivity independent of regularity assumptions on…

Functional Analysis · Mathematics 2023-02-24 Augusto C. Ponce , Daniel Spector

Given a probability measure over a state space, a partial collection (sub-$\sigma$-algebra) of events whose probabilities are known, induces a capacity over the collection of all possible events. The \emph{induced capacity} of an event $F$…

Classical Analysis and ODEs · Mathematics 2007-11-16 Roee Teper

Choquet capacities and integrals are central concepts in decision making under ambiguity or model uncertainty, pioneered by Schmeidler. Motivated by risk optimization problems for quantiles under ambiguity, we study the subclass of Choquet…

Risk Management · Quantitative Finance 2024-12-30 Peng Liu , Tiantian Mao , Ruodu Wang

We investigate the influence of the granularity of the lattice on the potential between monopoles. Using the flux definition of monopoles we introduce their centers of mass and are able to realize continuous shifts of the monopole…

High Energy Physics - Lattice · Physics 2016-09-01 H. Bozkaya , M. Faber , P. Koppensteiner , M. Pitschmann

If $Au=-div(a(x,Du))$ is a monotone operator defined on the Sobolev space $W^{1,p}(R^n)$, $1<p<+\infty$, with $a(x,0)=0$ for a.e. $x\in R^n$, the capacity $C_A(E,F)$ relative to $A$ can be defined for every pair $(E,F)$ of bounded sets in…

funct-an · Mathematics 2008-02-03 G. Dal Maso , I. V. Skrypnik

We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…

Logic in Computer Science · Computer Science 2015-07-01 Douglas Cenzer , Paul Brodhead , Ferit Toska , Sebastian Wyman

The paper deals with the theory of inner (outer) capacities on locally compact spaces with respect to general function kernels, the main emphasis being placed on the establishment of alternative characterizations of inner (outer) capacities…

Classical Analysis and ODEs · Mathematics 2022-02-07 Natalia Zorii

We consider a totally monotone capacity on a Polish space and a sequence of bounded p.i.i.d. random variables. We show that, on a full set, any cluster point of empirical averages lies between the lower and the upper Choquet integrals of…

Probability · Mathematics 2007-05-23 Fabio Maccheroni , Massimo Marinacci

We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets…

Logic in Computer Science · Computer Science 2010-06-03 Douglas Cenzer , Paul Brodhead

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

Information Theory · Computer Science 2015-12-18 Jihad Fahs , Ibrahim Abou-Faycal

This paper explores the distribution of indistinguishable balls into distinct urns with varying capacity constraints, a foundational issue in combinatorial mathematics with applications across various disciplines. We present a comprehensive…

Probability · Mathematics 2025-02-07 Jingwei Li , Thomas G. Robertazzi

Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing models such…

Discrete Mathematics · Computer Science 2007-11-15 Michel Grabisch , Christophe Labreuche

When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one to consider. The development of possibilistic decision theory has lead to a series…

Artificial Intelligence · Computer Science 2012-02-20 Helene Fargier , Nahla Ben Amor , Wided Guezguez

We study the strong disorder regime of Floquet topological systems in dimension two, that describe independent electrons on a lattice subject to a periodic driving. In the spectrum of the Floquet propagator we assume the existence of an…

Mathematical Physics · Physics 2019-06-26 Jacob Shapiro , Clément Tauber

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

Representation Theory · Mathematics 2017-01-17 Peng He , Xue-ping Wang

We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…

Combinatorics · Mathematics 2024-10-10 Yongle Luo , Baptiste Rognerud
‹ Prev 1 2 3 10 Next ›