2017
DOI: 10.1007/jhep06(2017)157
|View full text |Cite
|
Sign up to set email alerts
|

Edge length dynamics on graphs with applications to p-adic AdS/CFT

Abstract: We formulate a Euclidean theory of edge length dynamics based on a notion of Ricci curvature on graphs with variable edge lengths. In order to write an explicit form for the discrete analog of the Einstein-Hilbert action, we require that the graph should either be a tree or that all its cycles should be sufficiently long. The infinite regular tree with all edge lengths equal is an example of a graph with constant negative curvature, providing a connection with p-adic AdS/CFT, where such a tree takes the place … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

8
93
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 61 publications
(101 citation statements)
references
References 15 publications
8
93
0
Order By: Relevance
“…Therefore a tensor network based on the Bruhat-Tits tree would have much more symmetry than its counterpart living on a regular tessellation. This is inspired by recent proposals for the p-adic AdS/CFT correspondence [26][27][28], which generalize the AdS/CFT dictionary to the situation where the boundary theory lives…”
Section: Jhep01(2018)139mentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore a tensor network based on the Bruhat-Tits tree would have much more symmetry than its counterpart living on a regular tessellation. This is inspired by recent proposals for the p-adic AdS/CFT correspondence [26][27][28], which generalize the AdS/CFT dictionary to the situation where the boundary theory lives…”
Section: Jhep01(2018)139mentioning
confidence: 99%
“…28 In this subsection we will mostly focus on the case with boundary dimension d = 1. 29 The normalizations of our smearing function and the bulk-bulk kernel will be fixed later using two-point correlation functions and will turn out to be consistent with this identification.…”
Section: Reconstruction Kernel Vs Propagatormentioning
confidence: 99%
See 1 more Smart Citation
“…Indeed, it turns out, the problem of various higher-point blocks is relatively easily addressed over the p-adics [27], and owing to the close ties with the usual AdS/CFT setup (see, e.g., Refs. [25,26,6,28,29,30,31,32,33,34,35]) we are able to extract key new insights into the analogous calculation over reals. The p-adic results generalize the result of Ref.…”
Section: Introductionmentioning
confidence: 99%
“…D 2∆−1 is the 1-dim 2∆ − 1-th order Vladimirov derivative operator [9] up to a factor depending on ∆.…”
Section: The Partition Function Of the Boundary Theorymentioning
confidence: 99%