Edge length dynamics on graphs with applications to padic 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 EinsteinHilbert 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 padic AdS/CFT, where such a tree takes the place of antide Sitter space. Here, we compute simple correlators of the operator holographically dual to edge length fluctuations. This operator has dimension equal to the dimension of the boundary, and it has some features in common with the stress tensor.
 Authors:
 Princeton Univ., NJ (United States). Joseph Henry Lab.
 California Inst. of Technology (CalTech), Pasadena, CA (United States). Walter Burke Inst. for Theoretical Physics
 California Inst. of Technology (CalTech), Pasadena, CA (United States). Dept. of Mathematics
 RuprechtKarls Univ. Heidelberg, Heidelberg (Germany). Mathematisches Inst.
 Brandeis Univ., Waltham, MA (United States). Martin A. Fisher School of Physics
 Publication Date:
 Research Org.:
 Princeton Univ., NJ (United States); California Inst. of Technology (CalTech), Pasadena, CA (United States)
 Sponsoring Org.:
 USDOE; National Science Foundation (NSF)
 OSTI Identifier:
 1425489
 Grant/Contract Number:
 FG0291ER40671; SC0011632; DMS1201512; PHY1205440; SC0009987
 Resource Type:
 Journal Article: Accepted Manuscript
 Journal Name:
 Journal of High Energy Physics (Online)
 Additional Journal Information:
 Journal Name: Journal of High Energy Physics (Online); Journal Volume: 2017; Journal Issue: 6; Journal ID: ISSN 10298479
 Publisher:
 Springer Berlin
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; Lattice Models of Gravity; AdSCFT Correspondence; Classical Theories of Gravity
Citation Formats
Gubser, Steven S., Heydeman, Matthew, Jepsen, Christian, Marcolli, Matilde, Parikh, Sarthak, Saberi, Ingmar, Stoica, Bogdan, and Trundy, Brian. Edge length dynamics on graphs with applications to padic AdS/CFT. United States: N. p., 2017.
Web. doi:10.1007/JHEP06(2017)157.
Gubser, Steven S., Heydeman, Matthew, Jepsen, Christian, Marcolli, Matilde, Parikh, Sarthak, Saberi, Ingmar, Stoica, Bogdan, & Trundy, Brian. Edge length dynamics on graphs with applications to padic AdS/CFT. United States. doi:10.1007/JHEP06(2017)157.
Gubser, Steven S., Heydeman, Matthew, Jepsen, Christian, Marcolli, Matilde, Parikh, Sarthak, Saberi, Ingmar, Stoica, Bogdan, and Trundy, Brian. 2017.
"Edge length dynamics on graphs with applications to padic AdS/CFT". United States.
doi:10.1007/JHEP06(2017)157. https://www.osti.gov/servlets/purl/1425489.
@article{osti_1425489,
title = {Edge length dynamics on graphs with applications to padic AdS/CFT},
author = {Gubser, Steven S. and Heydeman, Matthew and Jepsen, Christian and Marcolli, Matilde and Parikh, Sarthak and Saberi, Ingmar and Stoica, Bogdan and Trundy, Brian},
abstractNote = {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 EinsteinHilbert 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 padic AdS/CFT, where such a tree takes the place of antide Sitter space. Here, we compute simple correlators of the operator holographically dual to edge length fluctuations. This operator has dimension equal to the dimension of the boundary, and it has some features in common with the stress tensor.},
doi = {10.1007/JHEP06(2017)157},
journal = {Journal of High Energy Physics (Online)},
number = 6,
volume = 2017,
place = {United States},
year = 2017,
month = 6
}
Web of Science

The theory of padic strings is reviewed along with some of their applications, foremost among them to the tachyon condensation problem in string theory. Some open problems are discussed, in particular that of the superstring in 10 dimensions as the endstage of the 26dimensional closed bosonic string's tachyon condensation.

pAdic dynamics
The quadratic map over padic numbers is studied in some detail. The authors prove that near almost all indifferent fixed points it is topologically conjugate to a quasiperiodic linear map. They also establish the existence of chaotic behavior and describe it using symbolic dynamics. 
Fundamental length in quantum theories with PTsymmetric Hamiltonians. II. The case of quantum graphs
PTsymmetrization of quantum graphs is proposed as an innovation where an adjustable, tunable nonlocality is admitted. The proposal generalizes the PTsymmetric squarewell models of Ref. [M. Znojil, Phys. Rev. D 80, 045022 (2009).] (with real spectrum and with a variable fundamental length {theta}) which are reclassified as the most elementary quantum qpointedstar graphs with minimal q=2. Their equilateral q=3,4,... generalizations are considered, with interactions attached to the vertices. RungeKutta discretization of coordinates simplifies the quantitative analysis by reducing our graphs to starshaped lattices of N=qK+1 points. The resulting boundstate spectra are found real in an Nindependent interval of couplings {lambda}more » 
Minimally 2edgeconnected graphs
Minimally 2edgeconnected graphs are characterized. These are graphs that are 2edgeconnected such that, when any edge is removed, the remaining graph is only 1edge connected. The graphs are finite with multiple edges allowed. Loops are not allowed, since any minimally 2edgeconnected graph could not have them anyway. Since 2edgeconnected graphs are the edge analogs of blocks, they have a theory like blocks, only simpler. 3 figures. (RWR) 
Constructing compact and effective graphs for recommender systems via node and edge aggregations
Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naive graphbased recommendation method, which operates with a heterogeneous logmetadata graph constructed from user log and content metadata databases. Although the na ve graphbased recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we proposemore »Cited by 1