Simplicial complexes are generalizations of classical graphs. Their homology groups are
widely used to characterize the structure and the topology of data in eg chemistry …

As an indicator of the stability of spectral clustering of an undirected weighted graph into k
clusters, the k th spectral gap of the graph Laplacian is often considered. The kth spectral …

Spectral clustering is a well-known technique which identifies k clusters in an undirected
graph, with n vertices and weight matrix W∈ R n× n, by exploiting its graph Laplacian L (W) …

In this article, we consider eigenvector centrality for the nodes of a graph and study the
robustness (and stability) of this popular centrality measure. For a given weighted graph $\G …

We study problems of robustness of linear stability under structured matrix perturbations.
Perturbations are restricted to lie in a prescribed structure space, which can be an arbitrary …

Relational data exhibiting the underlying structure of interactions of agents in the system is
present in virtually every area of research such as biology, neurology, chemistry …

Graph Topological Stability via Matrix Di erential Equations Page 1 Graph Topological Stability
via Matrix Di erential Equations Anton Savostianov, anton.savostianov@gssi.it Gran Sasso …

A Complete Bibliography of Publications in the SIAM Journal on Matrix Analysis and
Applications Page 1 A Complete Bibliography of Publications in the SIAM Journal on Matrix …