Related papers: Lorentzian threads as 'gatelines' and holographic …
Holographic entanglement entropy was recently recast in terms of Riemannian flows or 'bit threads'. We consider the Lorentzian analog to reformulate the 'complexity=volume' conjecture using Lorentzian flows -- timelike vector fields whose…
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…
Recent advances in holography and quantum gravity have shown that CFTs with classical gravity duals can implement nonlocal quantum computation protocols that appear local from the bulk perspective. We examine the extent to which current…
The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT…
The goal of the present work is three-fold. The first goal is to set foundational results on optimal transport in Lorentzian (pre-)length spaces, including cyclical monotonicity, stability of optimal couplings and Kantorovich duality…
Recently, an infinite class of holographic generalized complexities was proposed. These gravitational observables display the behavior required to be duals of complexity, in particular, linear growth at late times and switchback effect. In…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…
We study discretizations of Hamiltonian systems on the probability density manifold equipped with the $L^2$-Wasserstein metric. Based on discrete optimal transport theory, several Hamiltonian systems on graph (lattice) with different…
We derive several new reformulations of the Hubeny-Rangamani-Takayanagi covariant holographic entanglement entropy formula. These include: (1) a minimax formula, which involves finding a maximal-area achronal surface on a timelike…
We discuss a one-parameter family of states in two-dimensional holographic conformal field theories which are constructed via the Euclidean path integral of an effective theory on a family of hyperbolic slices in the dual bulk geometry. The…
The satisfiability problem of the branching time logic CTL is studied in terms of computational complexity. Tight upper and lower bounds are provided for each temporal operator fragment. In parallel, the minimal model size is studied with a…
The scope of this survey is to give a self-contained introduction to synthetic timelike Ricci curvature bounds for (possibly non-smooth) Lorentzian spaces via optimal transport $\&$ entropy tools, including a synthetic version of Hawking's…
Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the…
We consider states of holographic conformal field theories constructed by adding sources for local operators in the Euclidean path integral, with the aim of investigating the extent to which arbitrary bulk coherent states can be represented…
We investigate a new approach to holography in asymptotically AdS spacetimes, in which time rather than space is the emergent dimension. By making a sufficiently large T^2-deformation of a Euclidean CFT, we define a holographic theory that…
In this paper, we develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a…
The clustering problem, and more generally, latent factor discovery --or latent space inference-- is formulated in terms of the Wasserstein barycenter problem from optimal transport. The objective proposed is the maximization of the…
We consider perturbations of unitary minimal models by boundary fields. Initially we consider the models in the limit as c -> 1 and find that the relevant boundary fields all have simple interpretations in this limit. This interpretation…
We complete the project of specifying the Lorentzian AdS/CFT correspondence and its approximation by bulk semi-classical methods begun by earlier authors. At the end, the Lorentzian treatment is self-contained and requires no analytic…