Related papers: Discrete curvature and abelian groups
One of the main obstacles regarding Barky Emery curvature on graphs is that the results require a global uniform lower curvature bounds where no exception sets are allowed. We overcome this obstacle by introducing the perpetual cutoff…
We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…
The purpose of this paper is to analyze the isoperimetric inequality for symmetric log-convex probability measures on the line. Using geometric arguments we first re-prove that extremal sets in the isoperimetric inequality are intervals or…
We define a hybrid between Ollvier and Bakry Emery curvature on graphs with dependence on a variable neighborhood. The hexagonal lattice is non-negatively curved under this new curvature notion. Bonnet-Myers diameter bounds and Lichnerowicz…
We relate the nontrivial singular values $\sigma_2,\ldots,\sigma_n$ of the normalized adjacency matrix of an Eulerian directed graph to combinatorial measures of graph expansion: \\ 1. We introduce a new directed analogue of conductance…
We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to constants) isoperimetric inequality for dual systolic graphs.…
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…
In spectral graph theory, the Cheeger's inequality gives upper and lower bounds of edge expansion in normal graphs in terms of the second eigenvalue of the graph's Laplacian operator. Recently this inequality has been extended to undirected…
Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…
We provide a geometric condition which determines whether or not every point on the metric boundary of a graph with the standard path metric is a Busemann point, that is it is the limit point of a geodesic ray. We apply this and a related…
Inspired by asymptotically flat manifolds, we introduce the concept of asymptotically flat graphs and define the discrete ADM mass on them. We formulate the discrete positive mass conjecture based on the scalar curvature in the sense of…
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
We illustrate connections between differential geometry on finite simple graphs G=(V,E) and Riemannian manifolds (M,g). The link is that curvature can be defined integral geometrically as an expectation in a probability space of…
We give a new upper bound for the average graph distance in terms of the average Ollivier curvature. Here, the average Ollivier curvature is weighted with the edge betweenness centrality. Moreover, we prove that equality is attained…
By measured graphs we mean graphs endowed with a measure on the set of vertices. In this context, we explore the relations between the appropriate Cheeger constant and Poincar\'{e} inequalities. We prove that the so-called Cheeger…
We study the isoperimetric, functional and concentration properties of $n$-dimensional weighted Riemannian manifolds satisfying the Curvature-Dimension condition, when the generalized dimension $N$ is negative, and more generally, is in the…
This paper investigates the asymptotic boundary behavior of the holomorphic bisectional curvature for weighted Bergman metrics. By characterizing extremal functions via $L^2$-orthogonal projections, we establish an explicit formula for the…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
Recently, the author and Melentijevi\'c resolved the longstanding Gaussian curvature problem by proving the sharp inequality \[ |\mathcal{K}| < c_0 = \frac{\pi^2}{2} \] for minimal graphs over the unit disk, evaluated at the point of the…
The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is a NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the…