activity
20042020
most citedA measure of similarity between graph vertices

12 citations · 13 across the 6 of their papers we have counts for

collaborators

6 papers

cs.SI2020

Community Detection by a Riemannian Projected Proximal Gradient Method

Meng Wei, Wen Huang, Kyle A. Gallivan +1

Community detection plays an important role in understanding and exploiting the structure of complex systems. Many algorithms have been developed for community detection using modu…

math.OC2020

Structured backward errors for eigenvalues of linear port-Hamiltonian descriptor systems

Volker Mehrmann, Paul Van Dooren

When computing the eigenstructure of matrix pencils associated with the passivity analysis of perturbed port-Hamiltonian descriptor system using a structured generalized eigenvalue…

math.NA2019

Local Linearizations of Rational Matrices with Application to Rational Approximations of Nonlinear Eigenvalue Problems

Froilán M. Dopico, Silvia Marcaida, María C. Quintana +1

This paper presents a definition for local linearizations of rational matrices and studies their properties. This definition allows us to introduce matrix pencils associated to a r…

math.OC2019

Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis

Daniel Bankmann, Volker Mehrmann, Yurii Nesterov +1

In this paper formulas are derived for the analytic center of the solution set of linear matrix inequalities (LMIs) defining passive transfer functions. The algebraic Riccati equat…

cs.SI2017★ 1 cited

Role model detection using low rank similarity matrix

Sibo Cheng, Adissa Laurent, Paul Van Dooren

Computing meaningful clusters of nodes is crucial to analyse large networks. In this paper, we apply new clustering methods to improve the computational time. We use the properties…

cs.IR2004★ 12 cited

A measure of similarity between graph vertices

Vincent Blondel, Anahi Gajardo, Maureen Heymans +2

We introduce a concept of similarity between vertices of directed graphs. Let G_A and G_B be two directed graphs. We define a similarity matrix whose (i, j)-th real entry expresses…