Related papers: Resistance Distances in Directed Graphs: Definitio…
Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on…
Graphs are fundamental mathematical structures used in various fields to represent data, signals and processes. In this paper, we propose a novel framework for learning/estimating graphs from data. The proposed framework includes (i)…
Kemeny's constant quantifies a graph's connectivity by measuring the average time for a random walker to reach any other vertex. We introduce two concepts of the directional derivative of Kemeny's constant with respect to an edge and use…
A vertex $w$ resolves two vertices $u$ and $v$ in a directed graph $G$ if the distance from $w$ to $u$ is different to the distance from $w$ to $v$. A set of vertices $R$ is a resolving set for a directed graph $G$ if for every pair of…
Let $G=(V(G),E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The resistance distance $R_G(x,y)$ between two vertices $x,y$ of $G$ is defined to be the effective resistance between the two vertices in the corresponding…
Most of the analyses concerning signed networks have focused on the balance theory, hence identifying frustration with undirected, triadic motifs having an odd number of negative edges; much less attention has been paid to their directed…
The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip planning. Increasingly, there is interest in using…
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.…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…
M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
We are given the adjacency matrix of a geometric graph and the task of recovering the latent positions. We study one of the most popular approaches which consists in using the graph distances and derive error bounds under various…
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…
The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph and a positive integer $d$, what is the minimum number of arc…
For a connected graph $G$ on $n$ vertices, recall that the distance signless Laplacian matrix of $G$ is defined to be $\mathcal{Q}(G)=Tr(G)+\mathcal{D}(G)$, where $\mathcal{D}(G)$ is the distance matrix, $Tr(G)=diag(D_1, D_2, \ldots, D_n)$…
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…
Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure…
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…