Classical and quantum random-walk centrality measures in multilayer networks
Multilayer network analysis is a useful approach for studying networks of entities that interact
with each other via multiple relationships. Classifying the importance of nodes and node …
with each other via multiple relationships. Classifying the importance of nodes and node …
Kernels on graphs as proximity measures
Kernels and, broadly speaking, similarity measures on graphs are extensively used in graph-
based unsupervised and semi-supervised learning algorithms as well as in the link …
based unsupervised and semi-supervised learning algorithms as well as in the link …
[HTML][HTML] Similarities on graphs: Kernels versus proximity measures
We analytically study proximity and distance properties of various kernels and similarity
measures on graphs. This helps to understand the mathematical nature of such measures …
measures on graphs. This helps to understand the mathematical nature of such measures …
[HTML][HTML] Moore–Penrose inverse of the incidence matrix of a distance regular graph
A Azimi, RB Bapat - Linear Algebra and its Applications, 2018 - Elsevier
Moore–Penrose inverse of the incidence matrix of a distance regular graph - ScienceDirect
Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View …
Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View …
Relating Eulerian and Lagrangian spatial models for vector-host disease dynamics through a fundamental matrix
We explore the relationship between Eulerian and Lagrangian approaches for modeling
movement in vector-borne diseases for discrete space. In the Eulerian approach we account …
movement in vector-borne diseases for discrete space. In the Eulerian approach we account …
Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
The absorption inverse, studied in Jacobsen and Tien (2018)[13], is a generalized inverse
specifically introduced for the analysis of graphs with absorption. In this paper we consider …
specifically introduced for the analysis of graphs with absorption. In this paper we consider …
Host movement, transmission hot spots, and vector-borne disease dynamics on spatial networks
We examine how spatial heterogeneity combines with mobility network structure to influence
vector-borne disease dynamics. Specifically, we consider a Ross-Macdonald-type disease …
vector-borne disease dynamics. Specifically, we consider a Ross-Macdonald-type disease …
[HTML][HTML] The Moore–Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs
A Azimi, RB Bapat - Discrete Mathematics, 2019 - Elsevier
The Moore–Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs -
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …
Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
We consider the computation of generalized inverses of the graph Laplacian for both
undirected and directed graphs, with a focus on the group inverse and the closely related …
undirected and directed graphs, with a focus on the group inverse and the closely related …
Dissecting graph measure performance for node clustering in LFR parameter space
Graph measures that express closeness or distance between nodes can be employed for
graph nodes clustering using metric clustering algorithms. There are numerous measures …
graph nodes clustering using metric clustering algorithms. There are numerous measures …