Related papers: Towards a complete classification of holographic e…
We construct a graph model for holographic entropies in general time-dependent spacetimes. In static settings, such models arise from Ryu-Takayanagi surfaces on a common Cauchy slice and imply that the holographic entropy cone is…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
In this work, we study the holographic entanglement entropy of two dimensional $T\bar{T}$-deformed conformal field theory. We compute the correction due to the deformation up to the leading order of the deformation parameter in the…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
Using the proposal for holographic entanglement entropy in higher derivative gravities, we compute holographic entanglement entropy for the conformal gravity in four dimensions which turns out to be finite. However, if one subtracts the…
Subgraph isomorphism, also known as subgraph matching, is typically regarded as an NP-complete problem. This complexity is further compounded in practical applications where edge weights are real-valued and may be affected by measurement…
We provide a derivation of holographic entanglement entropy for spherical entangling surfaces. Our construction relies on conformally mapping the boundary CFT to a hyperbolic geometry and observing that the vacuum state is mapped to a…
Topological correctness plays a critical role in many image segmentation tasks, yet most networks are trained using pixel-wise loss functions, such as Dice, neglecting topological accuracy. Existing topology-aware methods often lack robust…
We provide new complexity information for the convergence of the Hybrid Steepest Descent Method for solving the Variational Inequality Problem for a strict contraction on Hilbert space over a closed convex set C given either as the fixed…
Contraction analysis establishes exponential incremental convergence of a nonlinear system by solving a linear matrix inequality for a contraction metric, and has become a standard resource for solving problems in nonlinear control and…
We present a simple derivation of the entanglement entropy for a region made up of a union of disjoint intervals in 1+1 dimensional quantum field theories using holographic techniques. This generalizes the results for 1+1 dimensional…
We calculate the holographic entanglement entropy for the holographic QCD phase diagram considered in [Knaute, Yaresko, K\"ampfer (2017), arXiv:1702.06731] and explore the resulting qualitative behavior over the temperature-chemical…
In this note we address the discrepancy found by Hung, Myers and Smolkin between the holographic calculation of entanglement entropy (using the Jacobson-Myers functional for the holographic minimal surface) and the CFT trace anomaly…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
In this note we calculate the holographic entanglement entropy in the presence of a conformal interface for a geometric configuration in which the entangling region ${\cal A}$ lies on one side of the interface. For the supersymmetric Janus…
Recently it was shown that if a given state fulfils the reduction criterion it must also satisfy the known entropic inequalities. Now the questions arises whether on the assumption that stronger criteria based on positive but not completely…
Biclustering, also known as co-clustering or two-way clustering, simultaneously partitions the rows and columns of a data matrix to reveal submatrices with coherent patterns. Incorporating background knowledge into clustering to enhance…
We explore the structure of holographic entropy relations (associated with 'information quantities' given by a linear combination of entanglement entropies of spatial sub-partitions of a CFT state with geometric bulk dual). Such entropy…
To calculate the entropy of a subalgebra or of a channel with respect to a state, one has to solve an intriguing optimalization problem. The latter is also the key part in the entanglement of formation concept, in which case the subalgebra…