Related papers: Edge length dynamics on graphs with applications t…
A discrete tensegrity framework can be thought of as a graph in Euclidean n-space where each edge is of one of three types: an edge with a fixed length (bar) or an edge with an upper (cable) or lower (strut) bound on its length. Roth and…
Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…
We derive explicit formulas for the Lin-Lu-Yau curvature and the Ollivier-Ricci curvature in terms of graph parameters and an optimal assignment. Utilizing these precise expressions, we examine the relationship between the Lin-Lu-Yau…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…
We study the long scale Ollivier-Ricci curvature of graphs as a function of the chosen idleness. As in the previous work on the short scale, we show that this idleness function is concave and piecewise linear with at most $3$ linear parts.…
We study the gravitational Dirichlet problem in AdS spacetimes with a view to understanding the boundary CFT interpretation. We define the problem as bulk Einstein's equations with Dirichlet boundary conditions on fixed timelike cut-off…
With the help of Wick rotation over $p$-adic numbers $\mathbb{Q}_p$, the $p$-adic version of Euclidean $\textrm{dS}_2$ space(noted as $p\textrm{dS}_2$) is obtained based on $p\textrm{AdS}_2$($p$-adic version of Euclidean $\textrm{AdS}_2$…
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…
We develop the idea of an effective conformal theory describing the low-lying spectrum of the dilatation operator in a CFT. Such an effective theory is useful when the spectrum contains a hierarchy in the dimension of operators, and a small…
It has recently been proposed that Zamoldchikov's $T \bar{T}$ deformation of two-dimensional CFTs describes the holographic theory dual to AdS$_3$ at finite radius. In this note we use the Gauss-Codazzi form of the Einstein equations to…
We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…
When searching for interesting structures in graphs, it is often important to take into account not only the graph connectivity, but also the metadata available, such as node and edge labels, or temporal information. In this paper we are…
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
Using target space null reduction of the Polyakov action we find a novel covariant action for strings moving in a torsional Newton-Cartan geometry. Sending the string tension to zero while rescaling the Newton-Cartan clock 1-form, so as to…
We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the…
An outstanding question lying at the core of the AdS/CFT correspondence in string theory is the holographic prescription problem for Einstein metrics, which asserts that one can slightly perturb the conformal geometry at infinity of the…
We investigate the behavior of non-Euclidean plates with constant negative Gaussian curvature using the F\"oppl-von K\'arm\'an reduced theory of elasticity. Motivated by recent experimental results, we focus on annuli with a periodic…
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…