Related papers: Edge length dynamics on graphs with applications t…
Given a directed graph E, we construct for each real number l a quiver whose vertex space is the topological realisation of E, and whose edges are directed paths of length l in the vertex space. These quivers are not topological graphs in…
A common feature of tree-level holography is that a correlator in one theory can serve as a generating function for correlators in another theory with less continuous symmetry. This is the case for a family of 4d CFTs with eight…
We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed…
Basic aspects of the AdS/CFT correspondence are studied in the framework of 3-dimensional gravity with torsion. After choosing a consistent holographic ansatz, we formulate an improved approach to the Noether--Ward identities for the…
Directions of graphs were originally introduced in the study of a cops-and-robbers kind of game, while the study of end spaces has been used to generalize classical graph-theoretical results to infinite graphs, such as Halin's…
We continue our study of string correlators on Euclidean $\text{AdS}_3$ with pure NS-NS flux. The worldsheet and spacetime correlators have a rich analytic structure, which we analyse completely for genus 0 four-point functions. We show…
Let $G$ be a graph. Its laplacian matrix $L(G)$ is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been intensively used in spectral partitioning problems due to their good…
We give arguments for a conjecture made in a previous paper, that one has to use only the gauged sugra action for the calculation of correlators of certain operators via the AdS-CFT correspondence. The existence of consistent truncations…
A graph is called Ricci-flat if its Ricci-curvatures vanish on all edges. Here we use the definition of Ricci-cruvature on graphs given in [Lin-Lu-Yau, Tohoku Math., 2011], which is a variation of [Ollivier, J. Funct. Math., 2009]. In this…
Connectivity query processing is a fundamental problem in graph processing. Given an undirected graph and two query vertices, the problem aims to identify whether they are connected via a path. Given frequent edge updates in real graph…
We consider ($d+n+1$)-dimensional solutions of Einstein gravity with constant negative curvature. Regular solutions of this type are expected to be dual to the ground states of ($d+n$)-dimensional holographic CFTs on $AdS_d\times S^n$.…
In this work we introduce a topological method for the search of fixed points and periodic points for continuous maps defined on generalized rectangles in finite dimensional Euclidean spaces. We name our technique "Stretching Along the…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
Analytic torsion is a functional on graphs which only needs linear algebra to be defined. In the continuum it corresponds to the Ray-Singer analytic torsion. We have formulas for analytic torsion if the graph is contractible or if it is a…
We study the existence of solutions of Ricci flow equations of Ollivier-Lin-Lu-Yau curvature defined on weighted graphs. Our work is motivated by\cite{NLLG} in which the discrete time Ricci flow algorithm has been applied successfully as a…
One of the main obstacles regarding Barky Emery curvature on graphs is that the results require a global uniform lower curvature bounds where no exception sets are allowed. We overcome this obstacle by introducing the perpetual cutoff…
Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
We investigate the principles of quantum field theory using a stiff de Sitter space. We demonstrate that a non-unitary Lagrangian on a Euclidean AdS geometry can produce the perturbative expansion of late-time correlation functions to all…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…