Related papers: Curvature and local matchings of conference graphs…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
Recently, deep learning based methods have demonstrated promising results on the graph matching problem, by relying on the descriptive capability of deep features extracted on graph nodes. However, one main limitation with existing deep…
We give a discrete Bonnet Myers type theorem for the effective diameter assuming positive Ollivier curvature. We prove that this diameter bound is attained if and only if the graph is a cocktail party graph, a Johnson graph, a halved cube,…
We study Hamilton cycles and perfect matchings in a uniform attachment graph. In this random graph, vertices are added sequentially, and when a vertex $t$ is created, it makes $k$ independent and uniform choices from $\{1,\dots,t-1\}$ and…
We consider the motion by mean curvature of an $n$-dimensional graph over a time-dependent domain in $\mathbb{R}^n$, intersecting $\mathbb{R}^n$ at a constant angle. In the general case, we prove local existence for the corresponding…
We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem proven by Gurvits and…
We give necessary and sufficient conditions on the parameters of a regular graph $\Gamma$ (with or without loops) such that $E(\Gamma)=E(\overline \Gamma)$. We study complementary equienergetic cubic graphs obtaining classifications up to…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
We study matchings on sparse random graphs by means of the cavity method. We first show how the method reproduces several known results about maximum and perfect matchings in regular and Erdos-Renyi random graphs. Our main new result is the…
We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…
We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…
In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\"os-R\'enyi random graphs in a random environment. We show that the expected number of…
This paper investigates the combinatorial $\alpha$-curvature for vertex scaling of piecewise hyperbolic metrics on polyhedral surfaces, which is a parameterized generalization of the classical combinatorial curvature. A discrete…
It is known that the curvature of the feasible set in convex optimization allows for algorithms with better convergence rates, and there has been renewed interest in this topic both for offline as well as online problems. In this paper,…
In this article we prove that antitrees with suitable growth properties are examples of infinite graphs exhibiting strictly positive curvature in various contexts: in the normalized and non-normalized Bakry-\'Emery setting as well in the…
In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameters $d_1 \leq d_2$, there exists a coupling of $G(n,d_1)$ and…
Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…