Lorenzo Ciardo
My research is focused on Matrix Theory and Combinatorics, and in particular on Spectral Graph Theory. This aims at studying properties of a graph by looking at the eigenvalues and eigenvectors of matrices such as the adjacency and the laplacian matrix. One can obtain, in this way, important information about quantities such as connectivity and centrality.
At the moment, my interests are focused on computationally efficient alternatives to the Perron value of bottleneck matrices - which can be used to obtain good approximations of the characteristic set of a tree - and on the theory of discrete convexity in graphs.
I studied at the University of Turin, at the University of Waterloo and at the University of Paderborn, where I wrote my Master's thesis in Lie Theory entitled "Maass-Selberg operators for \(SL(n,\mathbb{R})\)".
Supervisor: Prof. Geir Dahl.
PUBLICATIONS:
- Andrade, Enide; Ciardo, Lorenzo & Dahl, Geir, Combinatorial Perron parameters for trees, Linear Algebra and its Applications 566 (2019), 138-166.
- Ciardo, Lorenzo, A Fiedler center for graphs generalizing the characteristic set, Linear Algebra and its Applications 584 (2020), 197-220.
PREPRINTS:
- Ciardo, Lorenzo, The Braess' Paradox for pendant twins (2019).
TEACHING:
- MAT3100 Linear Optimization (Spring 2018, Spring 2019)
Publications
- Andrade, Enide; Ciardo, Lorenzo & Dahl, Geir (2019). Combinatorial Perron Parameters for Trees. Linear Algebra and its Applications. ISSN 0024-3795. 566, s 138- 166 . doi: 10.1016/j.laa.2018.12.028
- Dahl, Geir; Andrade, Enide & Ciardo, Lorenzo (2018). Combinatorial Perron Parameters and Trees.