Related papers: Edge length dynamics on graphs with applications t…
The AdS/CFT correspondence between string theory in AdS space and conformal field theories in physical space-time leads to an analytic, semi-classical model for strongly-coupled QCD which has scale invariance and dimensional counting at…
Postulating a minimal discrete quantum of action $S=\hbar$ and a simple rule for the growth of an oriented graph, we construct a strict hierarchy of temporal layers $C N$ with discrete periods $\tau_N=N\hbar/E$. Each layer is specified by…
Given a dynamic network, where edges appear and disappear over time, we are interested in finding sets of edges that have similar temporal behavior and form a dense subgraph. Formally, we define the problem as the enumeration of the maximal…
Motivated by a low-energy effective description of gauge theory/string theory duality, we conjecture that the dynamics of $SO(4)$-invariant states in a large class of four-dimensional conformal gauge theories on $S^3$ with non-equal central…
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a…
We consider Einstein gravity in AdS in the presence of a deformed conformal boundary metric, in the limit of large spacetime dimension. At leading order we find a new set of effective near-horizon equations. These can be understood as…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…
A solvable irrelevant deformation of AdS$_3$/CFT$_2$ correspondence leading to a theory with Hagedorn spectrum at high energy has been recently proposed. It consists of a single trace deformation of the boundary theory, which is inspired by…
We present a Euclidean quantum gravity model in which random graphs dynamically self-assemble into discrete manifold structures. Concretely, we consider a statistical model driven by a discretisation of the Euclidean Einstein-Hilbert…
We focus on evolution equations on co-evolving, infinite, graphs and establish a rigorous link with a class of nonlinear continuity equations, whose vector fields depend on the graphs considered. More precisely, weak solutions of the…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…
In this work we reason that there is a universal picture for several different holographic toy model constructions, and a gravity-like bulk field theory that gives rise it. First, we observe that the perfect tensor-networks and hyperbolic…
With a view to understanding extended-BMS symmetries in the framework of the $AdS_4/CFT_3$ correspondence, asymptotically AdS geometries are constructed with null impulsive shockwaves involving a discontinuity in superrotation parameters.…
We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-\'Emery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative…
The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…
We describe a new class of boundary conditions for AdS_{d+1} under which the boundary metric becomes a dynamical field. The key technical point is to show that contributions from boundary counter-terms in the bulk gravitational action…
The vertex-random graphs called proximity catch digraphs (PCDs) have been introduced recently and have applications in pattern recognition and spatial pattern analysis. A PCD is a random directed graph (i.e., digraph) which is constructed…
We extend recent remarkable progress in the comparison of the dynamical energy spectrum of rotating closed strings in AdS_5xS^5 and the scaling weights of the corresponding non-near-BPS operators in planar N=4 supersymmetric gauge theory.…
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every…