Lorenzo Zuffi

Mr. Lorenzo Zuffi

Alma Mater Studiorum - Università di Bologna

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 November 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
MBMattia Bergomi
Mattia Bergomi
Massimo FerriMassimo Ferri
Massimo Ferri
PVPietro Vertechi
Pietro Vertechi
LZLorenzo Zuffi
Lorenzo Zuffi
Persistent homology enables fast and computable comparison of topological objects. We give some instances of a recent extension of the theory of persistence, guaranteeing robustness and computability for relevant data types, like simple graphs and digraphs. We focus on categorical persistence functions that allow us to study in full generality strong kinds of connectedness—clique communities, k-vertex, and k-edge connectedness—directly on simple graphs and strong connectedness in digraphs.

14 September 2020 in arXiv
Verified
Preprint
Open access
PDF file
MBMattia Bergomi
Mattia Bergomi
Massimo FerriMassimo Ferri
Massimo Ferri
PVPietro Vertechi
Pietro Vertechi
LZLorenzo Zuffi
Lorenzo Zuffi
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to significant data types as simple graphs and quivers. We focus on categorical persistence functions that allow us to study in full generality strong kinds of connectedness such as clique communities, $k$-vertex and $k$-edge connectedness directly on simple graphs and monic coherent categories.

10 October 2018 in arXiv
Verified
Preprint
Open access
PDF file
MBMattia Bergomi
Mattia Bergomi
Massimo FerriMassimo Ferri
Massimo Ferri
LZLorenzo Zuffi
Lorenzo Zuffi
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological constructions can be used to gain information otherwise concealed by the low-dimensional nature of graphs. We do that by extending previous work of other researchers in homological persistence, by proposing novel graph-theoretical constructions. Beyond cliques, we use independent sets, neighborhoods, enclaveless sets and a Ramsey-inspired extended persistence.