Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the ${\sf N}=6$ solution

• URL: http://arxiv.org/abs/2412.15364v1
• Date: Thu, 19 Dec 2024 19:51:02 GMT
• Title: Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the ${\sf N}=6$ solution
• Authors: Temple He, Veronika E. Hubeny, Massimiliano Rota,
• Abstract summary: We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy inequality. For the final 6 orbits, it remains an open question whether they are holographic.
• Score: 0.0
• License:
• Abstract: We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy inequality. For the remaining 156 orbits, which do not violate any such inequalities, we construct holographic graph models for 150 of them. For the final 6 orbits, it remains an open question whether they are holographic. Consistent with the strong form of the conjecture in \cite{Hernandez-Cuenca:2022pst}, 148 of these graph models are trees. However, 2 of the graphs contain a "bulk cycle", leaving open the question of whether equivalent models with tree topology exist, or if these extreme rays are counterexamples to the conjecture. The paper includes a detailed description of the algorithm used for the computation, which is presented in a general framework and can be applied to any situation involving a polyhedral cone defined by a set of linear inequalities and a partial order among them to find extreme rays corresponding to down-sets in this poset.

Related papers

• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• 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)
• Learning Graphical Factor Models with Riemannian Optimization [70.13748170371889]
  This paper proposes a flexible algorithmic framework for graph learning under low-rank structural constraints. The problem is expressed as penalized maximum likelihood estimation of an elliptical distribution. We leverage geometries of positive definite matrices and positive semi-definite matrices of fixed rank that are well suited to elliptical models.
  arXiv  Detail & Related papers  (2022-10-21T13:19:45Z)
• Causal Bandits for Linear Structural Equation Models [58.2875460517691]
  This paper studies the problem of designing an optimal sequence of interventions in a causal graphical model. It is assumed that the graph's structure is known and has $N$ nodes. Two algorithms are proposed for the frequentist (UCB-based) and Bayesian settings.
  arXiv  Detail & Related papers  (2022-08-26T16:21:31Z)
• A non-graphical representation of conditional independence via the neighbourhood lattice [24.187900567260577]
  We show that this decomposition exists in any compositional graphoid and can be computed efficiently and consistently in high-dimensions. We also discuss various special cases such as graphical models and projection lattices, each of which has intuitive interpretations.
  arXiv  Detail & Related papers  (2022-06-12T19:59:09Z)
• Heterogeneous manifolds for curvature-aware graph embedding [6.3351090376024155]
  Graph embeddings are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space matches that of the graph.
  arXiv  Detail & Related papers  (2022-02-02T18:18:35Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• 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)
• Testing correlation of unlabeled random graphs [18.08210501570919]
  We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes. This is formalized as a hypothesis testing problem, where under the null hypothesis, the two graphs are independently generated. Under the alternative, the two graphs are edge-correlated under some latent node correspondence, but have the same marginal distributions as the null.
  arXiv  Detail & Related papers  (2020-08-23T19:19:45Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Superbalance of Holographic Entropy Inequalities [0.0]
  We prove that all non-redundant holographic entropy inequalities are superbalanced. This is tantamount to proving that besides subadditivity, all non-redundant holographic entropy inequalities are superbalanced.
  arXiv  Detail & Related papers  (2020-02-11T17:24:44Z)

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.