Related papers: Effective Resistance Preserving Directed Graph Sym…
Electrical grids are large-sized complex systems that require strong computing power for monitoring and analysis. Kron reduction is a general reduction method in graph theory and is often used for electrical circuit simplification. In this…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
Large-scale graphs are widely used to represent object relationships in many real world applications. The occurrence of large-scale graphs presents significant computational challenges to process, analyze, and extract information. Graph…
Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and…
We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of an associated asymmetric transition probability matrix, extending the classical spectral inequality to the asymmetric setting. As an application, we…
This paper considers the problem of estimating high dimensional Laplacian constrained precision matrices by minimizing Stein's loss. We obtain a necessary and sufficient condition for existence of this estimator, that consists on checking…
A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…
We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an $n^{c}$-separator theorem for some $c<1$. We give a fully dynamic algorithm that maintains…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
In graph signal processing, many studies assume that the underlying network is undirected. Although the digraph model is rarely adopted, it is more appropriate for many applications, especially for real world networks. In this paper, we…
We define and study two new kinds of "effective resistances" based on hubs-biased -- hubs-repelling and hubs-attracting -- models of navigating a graph/network. We prove that these effective resistances are squared Euclidean distances…
A signed directed graph is a graph with sign and direction information on the edges. Even though signed directed graphs are more informative than unsigned or undirected graphs, they are more complicated to analyze and have received less…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problems posed on undirected graphs. However, Euclidean distances…
In this paper, we present two new matrices, namely the resistance Laplacian and resistance signless Laplacian matrix of a connected graph. We provide a generalized form of these matrices for different classes of graphs, including the…
The \emph{resistance matrix} of a simple connected graph $G$ is denoted by $R$, and is defined by $R =(r_{ij})$, where $r_{ij}$ is the resistance distance between the vertices $i$ and $j$ of $G$. In this paper, we consider the resistance…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail…
In this paper we investigated the possibility to use the magnetic Laplacian to characterize directed graphs (a.k.a. networks). Many interesting results are obtained, including the finding that community structure is related to rotational…