Related papers: Edge length dynamics on graphs with applications t…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
We consider the Mielke-Baekler model of three-dimensional AdS gravity with torsion, which has gravitational and translational Chern-Simons terms in addition to the usual Einstein-Hilbert action with cosmological constant. It is shown that…
The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…
This work places the invariant $ds^2$ at the center of the gravitational interaction, interpreting it not as a purely geometric object but as the differential of proper time, endowed with direct physical meaning. Starting from the extension…
We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most $3$ linear parts, with at most $2$ linear parts in the case of a regular…
In the AdS/CFT correspondence one encounters theories that are not invariant under diffeomorphisms. In the boundary theory this is a gravitational anomaly, and can arise in 4k+2 dimensions. In the bulk, there can be gravitational…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…
The spectral dimension $d_s$ of a weighted graph is an exponent associated with the asymptotic behavior of the random walk on the graph. The Ahlfors regular conformal dimension $\dim_\mathrm{ARC}$ of the graph distance is a quasisymmetric…
The flat/CFT dictionary between the bulk gravitational theory and boundary conformal field theory is systematically developed in this paper. Asymptotically flat spacetime is built up by asymptotically AdS hyperboloid slices in terms of…
It is hereby established that, in Euclidean spaces of finite dimension, bounded self-contracted curves have finite length. This extends the main result of Daniilidis, Ley, and Sabourau (J. Math. Pures Appl. 2010) concerning continuous…
The problem of edge coloring has been extensively studied over the years. Recently, this problem has received significant attention in the dynamic setting, where we are given a dynamic graph evolving via a sequence of edge insertions and…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
We find a Polyakov-type action for strings moving in a torsional Newton-Cartan geometry. This is obtained by starting with the relativistic Polyakov action and fixing the momentum of the string along a non-compact null isometry. For a flat…
Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…
We consider correlators for the flux of energy and charge in the background of operators with large global $U(1)$ charge in conformal field theory (CFT). It has recently been shown that the corresponding Euclidean correlators generically…
We study the Universal Difference Property (UDP) introduced by Alt{\i}nok, Anders, Arreola, Asencio, Ireland, Sar{\i}o\u{g}lan, and Smith, focusing on the relationship between the structural properties of a graph and UDP. We present…
Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the…
In this paper, we relate the seemingly unrelated concepts of treewidth and boxicity. Our main result is that, for any graph G, boxicity(G) <= treewidth(G) + 2. We also show that this upper bound is (almost) tight. Our result leads to…
Motivated by microscopic traffic modeling, we analyze dynamical systems which have a piecewise linear concave dynamics not necessarily monotonic. We introduce a deterministic Petri net extension where edges may have negative weights. The…