251 citations · 1.2k across the 27 of their papers we have counts for
31 papers
Fast Graph Laplacian Estimation using Effective Resistance
Christoffer Kjellson, Claudio Altafini, Emma Tegling
Inferring network topology from noisy node observations is a central problem in graph signal processing. In this paper, we consider Laplacian-constrained graph estimation for Gauss…
Minimal Input Cardinality Disturbance Decoupling of Coupled Oscillators via Output Feedback with Application to Power Networks
Luca Claude Gino Lebon, Johan Lindberg, Claudio Altafini
In this paper, we identify the smallest set of control input nodes and an associated output feedback law that achieves complete disturbance decoupling for a class of coupled oscill…
Computing frustration and near-monotonicity in deep neural networks
Joel Wendin, Erik G. Larsson, Claudio Altafini
For the signed graph associated to a deep neural network, one can compute the frustration level, i.e., test how close or distant the graph is to structural balance. For all the pre…
Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems
Luca Claude Gino Lebon, Claudio Altafini
In this paper we show how to formulate and solve disturbance decoupling problems over networks while choosing a minimal number of input and output nodes. Feedback laws that isolate…
Multi-agent consensus over time-invariant and time-varying signed digraphs via eventual positivity
Angela Fontan, Lingfei Wang, Yiguang Hong +2
Laplacian dynamics on signed digraphs have a richer behavior than those on nonnegative digraphs. In particular, for the so-called "repelling" signed Laplacians, the marginal stabil…
On the properties of Laplacian pseudoinverses
Angela Fontan, Claudio Altafini
The pseudoinverse of a graph Laplacian is used in many applications and fields, such as for instance in the computation of the effective resistance in electrical networks, in the c…