8,475 research outputs found
Belief functions on lattices
We extend the notion of belief function to the case where the underlying
structure is no more the Boolean lattice of subsets of some universal set, but
any lattice, which we will endow with a minimal set of properties according to
our needs. We show that all classical constructions and definitions (e.g., mass
allocation, commonality function, plausibility functions, necessity measures
with nested focal elements, possibility distributions, Dempster rule of
combination, decomposition w.r.t. simple support functions, etc.) remain valid
in this general setting. Moreover, our proof of decomposition of belief
functions into simple support functions is much simpler and general than the
original one by Shafer
Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs
Belief propagation -- a powerful heuristic method to solve inference problems
involving a large number of random variables -- was recently generalized to
quantum theory. Like its classical counterpart, this algorithm is exact on
trees when the appropriate independence conditions are met and is expected to
provide reliable approximations when operated on loopy graphs. In this paper,
we benchmark the performances of loopy quantum belief propagation (QBP) in the
context of finite-tempereture quantum many-body physics. Our results indicate
that QBP provides reliable estimates of the high-temperature correlation
function when the typical loop size in the graph is large. As such, it is
suitable e.g. for the study of quantum spin glasses on Bethe lattices and the
decoding of sparse quantum error correction codes.Comment: 5 pages, 4 figure
A Formal Model for Trust in Dynamic Networks
We propose a formal model of trust informed by the Global Computing scenario and focusing on the aspects of trust formation, evolution, and propagation. The model is based on a novel notion of trust structures which, building on concepts from trust management and domain theory, feature at the same time a trust and an information partial order
The Many Faces of Rationalizability
The rationalizability concept was introduced in \cite{Ber84} and
\cite{Pea84} to assess what can be inferred by rational players in a
non-cooperative game in the presence of common knowledge. However, this notion
can be defined in a number of ways that differ in seemingly unimportant minor
details. We shed light on these differences, explain their impact, and clarify
for which games these definitions coincide. Then we apply the same analysis to
explain the differences and similarities between various ways the iterated
elimination of strictly dominated strategies was defined in the literature.
This allows us to clarify the results of \cite{DS02} and \cite{CLL05} and
improve upon them. We also consider the extension of these results to strict
dominance by a mixed strategy. Our approach is based on a general study of the
operators on complete lattices. We allow transfinite iterations of the
considered operators and clarify the need for them. The advantage of such a
general approach is that a number of results, including order independence for
some of the notions of rationalizability and strict dominance, come for free.Comment: 39 pages, appeared in The B.E. Journal of Theoretical Economics: Vol.
7 : Iss. 1 (Topics), Article 18. Available at:
http://www.bepress.com/bejte/vol7/iss1/art1
Lattices from Codes for Harnessing Interference: An Overview and Generalizations
In this paper, using compute-and-forward as an example, we provide an
overview of constructions of lattices from codes that possess the right
algebraic structures for harnessing interference. This includes Construction A,
Construction D, and Construction (previously called product
construction) recently proposed by the authors. We then discuss two
generalizations where the first one is a general construction of lattices named
Construction subsuming the above three constructions as special cases
and the second one is to go beyond principal ideal domains and build lattices
over algebraic integers
- …