Related papers: Generalized Resistance Geometry from Kron Reductio…
The paper defines a positive semidefinite operator called $\epsilon-$repelling Laplacian on a positive connected signed graph where $\epsilon$ is an arbitrary positive number less than a constant $\epsilon_0$ related to the graph's…
Effective resistance, which originates from the field of circuits analysis, is an important graph distance in spectral graph theory. It has found numerous applications in various areas, such as graph data mining, spectral graph…
This paper challenges the convention of using graph-theoretic shortest distance in stress-based graph drawing. We propose a new paradigm based on resistance distance, derived from the graph Laplacian's spectrum, which better captures global…
The average effective resistance of a graph is a relevant performance index in many applications, including distributed estimation and control of network systems. In this paper, we study how the average resistance depends on the graph…
Let $G$ be a connected graph with $n$ vertices. The resistance distance $\Omega_{G}(i,j)$ between any two vertices $i$ and $j$ of $G$ is defined as the effective resistance between them in the electrical network constructed from $G$ by…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
We propose an algebraic framework for generalized graph Laplacians which unifies the study of resistor networks, the critical group, and the eigenvalues of the Laplacian and adjacency matrices. Given a graph with boundary $G$ together with…
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…
Generalized geometry provides the framework for a systematic approach to non-symmetric metric gravity theory and naturally leads to an Einstein-Kalb-Ramond gravity theory with totally anti-symmetric contortion. The approach is related to…
Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…
The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk centrality and betweenness measures, average hitting and…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on…
We consider weighted, directed graphs with a notion of absorption on the vertices, related to absorbing random walks on graphs. We define a generalized inverse of the graph Laplacian, called the absorption inverse, that reflects both the…
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…
We propose the notion of {\it resistance of a graph} as an accompanying notion of the structure entropy to measure the force of the graph to resist cascading failure of strategic virus attacks. We show that for any connected network $G$,…
The notion of resistance distance, introduced by Klein and Randi\'c, has become a fundamental concept in spectral graph theory and network analysis, as it captures both the structural and electrical properties of a graph. The associated…
Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a…