Related papers: Edge length dynamics on graphs with applications t…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
Traditionally, network analysis is based on local properties of vertices, like their degree or clustering, and their statistical behavior across the network in question. This paper develops an approach which is different in two respects. We…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant…
In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas…
The microscopic origin of black hole entropy remains one of the more intriguing open questions in theoretical physics. A subplot in this drama is the renowned Cardy-Verlinde formula, which uses two-dimensional conformal formalism to explain…
For a quantum field of arbitrary mass and spin in the static patch of de Sitter spacetime, the Euclidean partition function receives contributions from edge modes localized on the horizon, expressible in terms of the Harish-Chandra…
A holographic interpretation for some specific Ricci flat string backgrounds of the form $A_6\times C_4$ is proposed. The conjecture is that there is a Four-dimensional Euclidean Conformal Field Theory (ECFT) defined on a codimension two…
In this work, a subclass of the generalized Kerr-Schild class of spacetimes is specified, with respect to which the Ricci tensor (regardless of the position of indices) proves to be linear in the so-called profile function of the geometry.…
The graph isomorphism, subgraph isomorphism, and graph edit distance problems are combinatorial problems with many applications. Heuristic exact and approximate algorithms for each of these problems have been developed for different kinds…
We investigate the computational complexity of edge-deletion and edge-contraction problems in fuzzy graphs. For any graph property {\Pi} that is hereditary under contractions (or deletions) and determined by 3-connected components, the…
This work analyzes the convergence properties of signed networks with nonlinear edge functions. We consider diffusively coupled networks comprised of maximal equilibrium-independent passive (MEIP) dynamics on the nodes, and a general class…
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast with the static case, it is NP-hard to determine whether a given temporal graph is temporally Eulerian even if strong restrictions are placed on the…
A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…
In this paper, we consider how to formulate semiclassical problems in the context of the AdS/CFT correspondence, based on the proposal of Compere and Marolf. Our prescription involves the effective action with self-action term for boundary…
We provide a well-posedness theory for a class of nonlocal continuity equations on co-evolving graphs. We describe the connection among vertices through an edge weight function and we let it evolve in time, coupling its dynamics with the…
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…
By the Grid Minor Theorem of Robertson and Seymour, every graph of sufficiently large tree-width contains a large grid as a minor. Tree-width may therefore be regarded as a measure of 'grid-likeness' of a graph. The grid contains a long…
We consider three-dimensional Einstein gravity in Euclidean signature with a finite boundary of torus topology endowed with an induced metric of fixed conformal class and a constant trace of extrinsic curvature $K$. For vanishing, positive,…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…