Related papers: Edge length dynamics on graphs with applications t…
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its operation. However, in the real world, links may fail…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
Maximum cardinality matching in bipartite graphs is an important and well-studied problem. The fully dynamic version, in which edges are inserted and deleted over time has also been the subject of much attention. Existing algorithms for…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We establish the existence and uniqueness of discrete Einstein metrics on trees under Lin-Lu-Yau Ricci curvature using Perron-Frobenius theory. We establish a sharp upper bound for the largest eigenvalue of the associated Ricci matrix in…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
A graph operator is a mapping $\phi$ which maps every graph $G$ from some class of graphs to a new graph $\phi(G)$. In this paper, we introduce and study the properties of the mincut operator, specifically the effects of iteration of the…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
We examine the fundamental question whether a random discrete structure with the minimal number of restrictions can converge to continuous metric space. We study the geometrical properties such as the dimensionality and the curvature…
We consider the entanglement entropy in the dS/CFT correspondence.In Einstein gravity on de Sitter spacetime we propose the holographic entanglement entropy as the analytic continuation of the extremal surface in Euclidean anti-de Sitter…
Elasticity theory provides an accurate description of the long-wavelength vibrational dynamics of homogeneous crystalline solids, and with supplemental boundary conditions on the displacement field can also be applied to abrupt…
A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
We generalize the $T\overline{T}$ deformation of CFT$_2$ to higher-dimensional large-$N$ CFTs, and show that in holographic theories, the resulting effective field theory matches semiclassical gravity in AdS with a finite radial cutoff. We…
Following Penrose, we introduce a family of graph functions defined in terms of contractions of certain products of symmetric tensors along the edges of a graph. Special cases of these functions enumerate edge colorings and cycles of…
We consider long wavelength solutions to the Einstein-dilaton system with negative cosmological constant which are dual, under the AdS/CFT correspondence, to solutions of the conformal relativistic Navier-Stokes equations with a…
We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…
Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…
In this paper, we show that the Ricci curvature lower bound in Ollivier's Wasserstein metric sense of a continuous time jumping Markov process on a graph can be characterized by some optimal coupling generator and provide the construction…
We use the holographic language to show the existence of the $a$-theorem for even dimensional CFTs, dual to the AdS space in general quadratic curvature gravity. We find the Wess-Zumino action which is originated from the spontaneous…