English
Related papers

Related papers: Multiset Bisimulations as a Common Framework for O…

200 papers

The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our…

Strongly Correlated Electrons · Physics 2021-09-29 Juan Carrasquilla , Di Luo , Felipe Pérez , Ashley Milsted , Bryan K. Clark , Maksims Volkovs , Leandro Aolita

Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…

Artificial Intelligence · Computer Science 2024-08-09 Oliver Broadrick , Honghua Zhang , Guy Van den Broeck

There is a lot of research on probabilistic transition systems. There are not many studies in probabilistic process models. The lack of investigation into the interactive aspect of probabilistic processes is mainly due to the difficulty…

Logic in Computer Science · Computer Science 2019-06-25 Yuxi Fu

Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…

Methodology · Statistics 2025-03-26 Beatrice Franzolini , Maria De Iorio , Johan Eriksson

Bidirectional transformations (bx) support principled consistency maintenance between data sources. Each data source corresponds to one perspective on a composite system, manifested by operations to 'get' and 'set' a view of the whole from…

Programming Languages · Computer Science 2017-09-12 Faris Abou-Saleh , James Cheney , Jeremy Gibbons , James McKinna , Perdita Stevens

This paper argues that the ideas underlying the renormalization group technique used to characterize phase transitions in condensed matter systems could be useful for distinguishing computational complexity classes. The paper presents a…

Computational Complexity · Computer Science 2007-05-23 S. N. Coppersmith

FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata. A…

Logic in Computer Science · Computer Science 2015-09-30 Diego Latella , Mieke Massink , Erik de Vink

An abstract mathematical framework is presented in this paper as a unification of several deformed or generalized algebra proposed recently in the context of generalized statistical theories intended to treat certain complex thermodynamic…

Statistical Mechanics · Physics 2020-10-20 Aziz El Kaabouchi , Laurent Nivanen , Qiuping A. Wang , Jean-Pierre Badiali , Alain Le Méhauté

In this paper we present a framework for modelling \emph{reward-sensitive bisimulations}, that is, bisimulations that account for quantitative differences such as accumulated rewards. To capture both qualitative and quantitative aspects…

Logic in Computer Science · Computer Science 2026-04-02 Pedro H. Azevedo de Amorim , Mayuko Kori , Koko Muroya

Estimating nonlinear functionals of probability distributions from samples is a fundamental statistical problem. The "plug-in" estimator obtained by applying the target functional to the empirical distribution of samples is biased.…

Statistics Theory · Mathematics 2026-02-20 Florian Schäfer

We present a computational framework for efficient learning, sampling, and distribution of general Bayesian posterior distributions. The framework leverages a machine learning approach for the construction of normalizing flows for the…

Nuclear Theory · Physics 2023-10-10 Yukari Yamauchi , Landon Buskirk , Pablo Giuliani , Kyle Godbey

Given a universe of discourse $U$, a {\em multiset} can be thought of as a function $M$ from $U$ to the natural numbers ${\bf N}$. In this paper, we define a {\em hybrid set} to be any function from the universe $U$ to the integers ${\bf…

Combinatorics · Mathematics 2009-09-25 S. Anelli , Ernesto Damiani , Ottavio D'Antona , Daniel E. Loeb

The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a…

Logic · Mathematics 2021-03-29 Jordan Mitchell Barrett , Valentino Vito

We study bisimulation and context equivalence in a probabilistic $\lambda$-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the…

Programming Languages · Computer Science 2013-11-08 Ugo Dal Lago , Davide Sangiorgi , Michele Alberti

In group representations several inductions given by tensoring with appropriate bimodules may be reconstructed via homology of $G$-posets with $G$-equivariant coefficients. For this purpose, we need various local categories of a finite…

Representation Theory · Mathematics 2018-10-23 Fei Xu

The relationships between various equivalences on configuration structures, including interleaving bisimulation (IB), step bisimulation (SB) and hereditary history-preserving (HH) bisimulation, have been investigated by van Glabbeek and…

Logic in Computer Science · Computer Science 2010-02-16 Iain Phillips , Irek Ulidowski

We introduce a framework uniting algorithmic randomness with exchangeable credences to address foundational questions in philosophy of probability and philosophy of science. To demonstrate its power, we show how one might use the framework…

History and Philosophy of Physics · Physics 2025-10-29 Jeffrey A. Barrett , Eddy Keming Chen

We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state…

Computer Science and Game Theory · Computer Science 2023-06-22 Benjamin Bisping , David N. Jansen , Uwe Nestmann

We study the problem of conditional two-sample testing, which aims to determine whether two populations have the same distribution after accounting for confounding factors. This problem commonly arises in various applications, such as…

Machine Learning · Statistics 2026-05-05 Seongchan Lee , Suman Cha , Ilmun Kim

Selection bias arises when the probability that an observation enters a dataset depends on variables related to the quantities of interest, leading to systematic distortions in estimation and uncertainty quantification. For example, in…

‹ Prev 1 3 4 5 6 7 10 Next ›