Graphical Tests of Causality

• URL: http://arxiv.org/abs/2511.22552v1
• Date: Thu, 27 Nov 2025 15:40:30 GMT
• Title: Graphical Tests of Causality
• Authors: Ämin Baumeler, Eleftherios-Ermis Tselentis, Stefan Wolf,
• Abstract summary: We present analogous inequalities for any number of communicating parties under the causal constraints of static causal order, definite causal order, and bi-causal order.<n>All derived inequalities are remarkably simple. They correspond to upper bounds on the winning chance in games.
• Score: 1.1470070927586018
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bell inequalities limit the possible observations of non-communicating parties. Here, we present analogous inequalities for any number of communicating parties under the causal constraints of static causal order, definite causal order, and bi-causal order. All derived inequalities are remarkably simple. They correspond to upper bounds on the winning chance in graphical games: Given a specific directed graph over the parties, the parties are challenged to communicate along a randomly chosen arc. In the case of definite causal order, every game that we find is specified by a kefalopoda digraph. Based on this we define weakly causal correlations as those that satisfy all kefalopoda inequalities. We show that the problem of deciding whether some correlations are weakly causal is solvable in polynomial time in the number of parties.

Related papers

• Correlations and quantum circuits with dynamical causal order [0.0]
  We show that some quantum processes can have both indefinite and dynamical causal order.<n>This allows us to formalise precisely in which sense certain quantum processes can have both indefinite and dynamical causal order.
  arXiv  Detail & Related papers  (2025-07-10T17:59:12Z)
• Tsirelson bounds for quantum correlations with indefinite causal order [4.162019309587634]
  We provide a general method for bounding the violation of arbitrary causal inequalities.<n>We prove that the maximum violation is generally smaller than the algebraic maximum of the corresponding correlation.<n>Our results motivate a search for physical principles characterizing the boundary of the set of quantum correlations with indefinite causal order.
  arXiv  Detail & Related papers  (2024-03-05T08:07:10Z)
• Causal Layering via Conditional Entropy [85.01590667411956]
  Causal discovery aims to recover information about an unobserved causal graph from the observable data it generates. We provide ways to recover layerings of a graph by accessing the data via a conditional entropy oracle.
  arXiv  Detail & Related papers  (2024-01-19T05:18:28Z)
• The Möbius game and other Bell tests for relativity [0.0]
  We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order.<n>We discuss these games as device-independent tests of spacetime's dynamical nature in general relativity.
  arXiv  Detail & Related papers  (2023-09-27T16:08:13Z)
• Classifying Causal Structures: Ascertaining when Classical Correlations are Constrained by Inequalities [0.0]
  We develop methods for detecting causal scenarios that impose inequality constraints versus those which do not. Many scenarios with exclusively equality constraints can be detected via a condition articulated by Henson, Lal and Pusey. We are able to resolve all but three causal scenarios, providing evidence that the HLP condition is, in fact, exhaustive.
  arXiv  Detail & Related papers  (2023-08-04T15:23:55Z)
• Violation of Bell's inequalities in uniform random graphs [0.0]
  We demonstrate that quantum correlations can emerge from the statistical correlations of random discrete models. We investigate the correlations between the number of neighbors(degree) for pairs of vertices in Erdos-Renyi uniform random graphs.
  arXiv  Detail & Related papers  (2023-05-04T12:46:26Z)
• Bell inequalities with overlapping measurements [52.81011822909395]
  We study Bell inequalities where measurements of different parties can have overlap. This allows to accommodate problems in quantum information. The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
  arXiv  Detail & Related papers  (2023-03-03T18:11:05Z)
• Reasoning about Causality in Games [63.930126666879396]
  Causal reasoning and game-theoretic reasoning are fundamental topics in artificial intelligence. We introduce mechanised games, which encode dependencies between agents' decision rules and the distributions governing the game. We describe correspondences between causal games and other formalisms, and explain how causal games can be used to answer queries that other causal or game-theoretic models do not support.
  arXiv  Detail & Related papers  (2023-01-05T22:47:28Z)
• Active Bayesian Causal Inference [72.70593653185078]
  We propose Active Bayesian Causal Inference (ABCI), a fully-Bayesian active learning framework for integrated causal discovery and reasoning. ABCI jointly infers a posterior over causal models and queries of interest. We show that our approach is more data-efficient than several baselines that only focus on learning the full causal graph.
  arXiv  Detail & Related papers  (2022-06-04T22:38:57Z)
• Counterfactual Fairness with Partially Known Causal Graph [85.15766086381352]
  This paper proposes a general method to achieve the notion of counterfactual fairness when the true causal graph is unknown. We find that counterfactual fairness can be achieved as if the true causal graph were fully known, when specific background knowledge is provided.
  arXiv  Detail & Related papers  (2022-05-27T13:40:50Z)
• Fuzzy Stochastic Timed Petri Nets for Causal properties representation [68.8204255655161]
  Causal relations are frequently represented by directed graphs, with nodes denoting causes and links denoting causal influence. Common methods used for graphically representing causal scenarios are neurons, truth tables, causal Bayesian networks, cognitive maps and Petri Nets. We will show that, even though the traditional models are able to represent separately some of the properties aforementioned, they fail trying to illustrate indistinctly all of them.
  arXiv  Detail & Related papers  (2020-11-24T13:22:34Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.