Related papers: Towards a complete classification of holographic e…
We study the entropy landscape of solutions for the bicoloring problem in random graphs, a representative difficult constraint satisfaction problem. Our goal is to classify which type of clusters of solutions are addressed by different…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons. First, there is usually no standard set of instances to benchmark performance. Second, using existing graph generators results in a…
In order to study the pseudo entropy of time-like subregions holographically, the previous smooth space-like extremal surface was recently generalized to mix space-like and time-like segments and the area becomes complex value. This paper…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
We propose a holographic formalism for a timelike entanglement entropy in non-conformal theories. This pseudoentropy is a complex-valued measure of information, which, in holographic non-conformal theories, receives contributions from a set…
We apply machine learning to understand fundamental aspects of holographic duality, specifically the entropies obtained from the apparent and event horizon areas. We show that simple features of only the time series of the pressure…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
We consider the algorithmic decision problem that takes as input an $n$-vertex $k$-uniform hypergraph $H$ with minimum codegree at least $m-c$ and decides whether it has a matching of size $m$. We show that this decision problem is fixed…
We provide a framework for a perturbative evaluation of the reduced density matrix. The method is based on a path integral in the analytically continued spacetime. It suggests an alternative to the holographic and `standard' replica trick…
Holographic duality describes gravitational theories in terms of quantum many-body systems. In holography, quantum information theory provides a crucial tool that directly connects microscopic structures of these systems to the geometries…
We review the results of refs. [1,2], in which the entanglement entropy in spaces with horizons, such as Rindler or de Sitter space, is computed using holography. This is achieved through an appropriate slicing of anti-de Sitter space and…
{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…
We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the…
Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partitioning hyperedges…
We find a covariant expression for the universal part of the holographic entanglement entropy which is valid for CFTs dual to generic higher curvature gravities in up to five bulk dimensions. We use this functional to compute universal…
In this talk we entertain the possibility that the synthesis of general covariance and quantum mechanics requires an extension of the basic kinematical setup of quantum mechanics. According to the holographic principle, regions of spacetime…
In this article, we introduce the notion of a curved absolute $\mathcal{L}_\infty$-algebra, a structure that behaves like a curved $\mathcal{L}_\infty$-algebra where all infinite sums of operations are well-defined by definition. We develop…
The Densest Subgraph Problem (DSP) is widely used to identify community structures and patterns in networks such as bioinformatics and social networks. While solvable in polynomial time, traditional exact algorithms face computational and…
Intrinsic isometric shape matching has become the standard approach for pose invariant correspondence estimation among deformable shapes. Most existing approaches assume global consistency, i.e., the metric structure of the whole manifold…