Related papers: Contextuality in multipartite pseudo-telepathy gra…
Despite the recent progress of generative adversarial networks (GANs) at synthesizing photo-realistic images, producing complex urban scenes remains a challenging problem. Previous works break down scene generation into two consecutive…
In a graphical game agents play with their neighbors on a graph to achieve an appropriate state of equilibrium. Here relevant problems are characterizing the equilibrium set and discovering efficient algorithms to find such an equilibrium…
Contextuality is central to both the foundations of quantum theory and to the novel information processing tasks. Although it was recognized before Bell's nonlocality, despite some recent proposals, it still faces a fundamental problem: how…
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…
We introduce the Graph Mixture Density Networks, a new family of machine learning models that can fit multimodal output distributions conditioned on graphs of arbitrary topology. By combining ideas from mixture models and graph…
Contextuality is a natural generalization of nonlocality which does not need composite systems or spacelike separation and offers a wider spectrum of interesting phenomena. Most notably, in quantum mechanics there exist scenarios where the…
Contextuality is a fundamental feature of quantum theory and a necessary resource for quantum computation and communication. It is therefore important to investigate how large contextuality can be in quantum theory. Linear contextuality…
Two-stage stochastic programs (2SPs) are important tools for making decisions under uncertainty. Decision-makers use contextual information to generate a set of scenarios to represent the true conditional distribution. However, the number…
The notions of symmetry and anonymity in strategic games have been formalized in different ways in the literature. We propose a combinatorial framework to analyze these notions, using group actions. Then, the same framework is used to…
Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…
We give a topological simulation for tensor networks that we call the two-string model. In this approach we give a new way to design protocols, and we discover a new multipartite quantum communication protocol. We introduce the notion of…
Network games provide a natural machinery to compactly represent strategic interactions among agents whose payoffs exhibit sparsity in their dependence on the actions of others. Besides encoding interaction sparsity, however, real networks…
As quantum contextuality proves to be a necessary resource for universal quantum computation, we present a general method for vector generation of Kochen-Specker (KS) contextual sets in the form of hypergraphs. The method supersedes all…
Semantic communications (SC) is an emerging communication paradigm in which wireless devices can send only relevant information from a source of data while relying on computing resources to regenerate missing data points. However, the…
Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_\alpha$-graph states, which are constructed from either unweighted or…
Building on previous work, this paper extends the modeling of political structures from simplicial complexes to hypergraphs. This allows the analysis of more complex political dynamics where agents who are willing to form coalitions contain…
Capacitated network bargaining games are popular combinatorial games that involve the structure of matchings in graphs. We show that it is always possible to stabilize unit-weight instances of this problem (that is, ensure that they admit a…
We introduce a search game for two players played on a "scenario" consisting of a ground set together with a collection of feasible partitions. This general setting allows us to obtain new characterisations of many width parameters such as…
Recent findings in neuroscience suggest that the human brain represents information in a geometric structure (for instance, through conceptual spaces). In order to communicate, we flatten the complex representation of entities and their…
Graph-based representations such as Scene Graphs enable localization in structured indoor environments by matching a locally observed graph, constructed from sensor data, to a prior map. This process is particularly challenging in…