Related papers: Equivalent spectral theory for fundamental graph c…
Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer parameter $L>0$, an {\em $L$-bounded cut} is a subset $F$ of edges (vertices) such that the every path between $s$ and $t$ in $G\setminus F$ has length more…
Graph-cuts are widely used in computer vision. In order to speed up the optimization process and improve the scalability for large graphs, Strandmark and Kahl introduced a splitting method to split a graph into multiple subgraphs for…
We study partition problems based on two ostensibly different kinds of energy functionals defined on $k$-partitions of metric graphs: Cheeger-type functionals whose minimisers are the $k$-Cheeger cuts of the graph, and the corresponding…
We study the spectral convergence of a symmetrized Graph Laplacian matrix induced by a Gaussian kernel evaluated on pairs of embedded data, sampled from a manifold with boundary, a sub-manifold of $\mathbb{R}^m$. Specifically, we deduce the…
In recent years, hypergraph generalizations of many graph cut problems have been introduced and analyzed as a way to better explore and understand complex systems and datasets characterized by multiway relationships. Recent work has made…
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…
Finding a simple path of even length between two designated vertices in a directed graph is a fundamental NP-complete problem known as the EvenPath problem. Nedev proved in 1999, that for directed planar graphs, the problem can be solved in…
Given an undirected graph, the Densest-k-Subgraph problem (DkS) seeks to find a subset of k vertices such that the sum of the edge weights in the corresponding subgraph is maximized. The problem is known to be NP-hard, and is also very…
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…
We investigate combinatorial properties of certain configurations of a graph partition which are related to the minimality of a cut. We show that such configurations are related to the third eigenvector of the Laplacian matrix. It is well…
Finding coarse representations of large graphs is an important computational problem in the fields of scientific computing, large scale graph partitioning, and the reduction of geometric meshes. Of particular interest in all of these fields…
In this paper, we use graph theory to solve wave scattering problems in the discrete dipole approximation. As a key result of this work, in the presence of active scatterers, we present a systematic method to find arbitrary large-order zero…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
The second eigenvalue of the Laplacian matrix and its associated eigenvector are fundamental features of an undirected graph, and as such they have found widespread use in scientific computing, machine learning, and data analysis. In many…
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…
Recent spectral graph sparsification research allows constructing nearly-linear-sized subgraphs that can well preserve the spectral (structural) properties of the original graph, such as the first few eigenvalues and eigenvectors of the…
We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a specified subset $X$ of vertices (terminals) into two parts.…
For a graph $G$ on $n$ vertices with normalized Laplacian eigenvalues $0 = \lambda_1(G) \leq \lambda_2(G) \leq \cdots \leq \lambda_n(G)$ and graph complement $G^c$, we prove that \begin{equation*} \max\{\lambda_2(G),\lambda_2(G^c)\}\geq…
This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods based on equitable and orbit partitions can be complex. Our…
We give an improved branch-and-bound solver for the multiterminal cut problem, based on the recent work of Henzinger et al.. We contribute new, highly effective data reduction rules to transform the graph into a smaller equivalent instance.…