Related papers: The Cheeger Cut and Cheeger Problem in Metric Grap…
We examine the total mixed scalar curvature of a fixed distribution as a functional of a pseudo-Riemannian metric. We develop variational formulas for quantities of extrinsic geometry of the distribution to find the critical points of this…
We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications.
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that $2$-respects (cuts two edges of) a spanning tree $T$ of a graph $G$. This procedure can be used in place of the…
In this paper, we use various versions of Lov\'asz extension to systematically derive continuous formulations of problems from discrete mathematics. This will take place in the following context: (1) For combinatorial optimization problems…
The hypergraph minimum cut problem aims to partition its vertices into two blocks while minimizing the total weight of the cut hyperedges. This fundamental problem arises in network reliability, VLSI design, and community detection. We…
In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…
Differential equations on metric graphs can describe many phenomena in the physical world but also the spread of information on social media. To efficiently compute the solution is a hard task in numerical analysis. Solving a design…
We study the limit of first eigenfunctions of (discrete) $p$-Laplacian on a finite subset of a graph with Dirichlet boundary condition, as $p\to 1.$ We prove that up to a subsequence, they converge to a summation of characteristic functions…
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…
For a self--adjoint Laplace operator on a finite, not necessarily compact, metric graph lower and upper bounds on each of the negative eigenvalues are derived. For compact finite metric graphs Poincar\'{e} type inequalities are given.
We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger-Buser inequality for graphons, which relates the gap between $2$ and the top of the spectrum of the Laplacian of a graphon with its bipartiteness ratio.…
Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data reduction techniques do not work well. To be more precise,…
In this paper, we reformulate the Bakry-\'Emery curvature on a weighted graph in terms of the smallest eigenvalue of a rank one perturbation of the so-called curvature matrix using Schur complement. This new viewpoint allows us to show…
In this paper, we establish Buser type inequalities, i.e., upper bounds for eigenvalues in terms of Cheeger constants. We prove the Buser's inequality for an infinite but locally finite connected graph with Ricci curvature lower bounds.…
The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized framework for weighted directed graphs, where edge weight can be…