Related papers: Capacities on a finite lattice
Designing neural network architectures is a task that lies somewhere between science and art. For a given task, some architectures are eventually preferred over others, based on a mix of intuition, experience, experimentation and luck. For…
In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
We review briefly current interpretation of the lattice monopoles, defined within the Maximal Abelian Projection, in terms of the continuum theory. We emphasize, in particular, that the lattice data, at the presently available lattices,…
We discuss a time-harmonic inverse scattering problem for the Navier equation with compactly supported penetrable and possibly inhomogeneous scattering objects in an unbounded homogeneous background medium, and we develop a monotonicity…
We consider capacity (fuzzy measure, non-additive probability) on a compactum as a monotone cooperative normed game. We introduce topological analogues of well known class of exact games and show that these classes form subfunctors of the…
We explore the finite-dimensional part of the non-commutative Choquet boundary of an operator algebra. In other words, we seek finite-dimensional boundary representations. Such representations may fail to exist even when the underlying…
The paper is devoted to a systematic study and characterizations of notions of local maximal monotonicity and their strong counterparts for set-valued operators that appear in variational analysis, optimization, and their applications. We…
This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…
The capacitance between the origin and any other lattice site in an infinite square lattice of identical capacitors is studied. The method is generalized to infinite Simple Cubic (SC) lattice. We make use of the superposition principle and…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
We give a singular control approach to the problem of minimizing an energy functional for measures with given total mass on a compact real interval, when energy is defined in terms of a completely monotone kernel. This problem occurs both…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
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…
Lower and upper probabilities, also known as Choquet capacities, are widely used as a convenient representation for sets of probability distributions. This paper presents a graphical decomposition and exact propagation algorithm for…
This paper studies the geometry of the optimizer for the optimal transport problem with capacity constraints. We introduce the concept of c-capacity monotonicity, which is a generalization of c-cyclical monotonicity in optimal transport. We…
The Choquet integral w.r.t. a capacity can be seen in the finite case as a parsimonious linear interpolator between vertices of $[0,1]^n$. We take this basic fact as a starting point to define the Choquet integral in a very general way,…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…