3 citations · 15 across the 14 of their papers we have counts for
4 papers · 1 filter
Regular Partitions and Their Use in Structural Pattern Recognition
Marco Fiorucci
Recent years are characterized by an unprecedented quantity of available network data which are produced at an astonishing rate by an heterogeneous variety of interconnected sensor…
Separating Structure from Noise in Large Graphs Using the Regularity Lemma
Marco Fiorucci, Francesco Pelosin, Marcello Pelillo
How can we separate structural information from noise in large graphs? To address this fundamental question, we propose a graph summarization approach based on Szemerédi's Regulari…
Analysis of large sparse graphs using regular decomposition of graph distance matrices
Hannu Reittu, Lasse Leskelä, Tomi Räty +1
Statistical analysis of large and sparse graphs is a challenging problem in data science due to the high dimensionality and nonlinearity of the problem. This paper presents a fast…
On the Interplay between Strong Regularity and Graph Densification
Marco Fiorucci, Alessandro Torcinovich, Manuel Curado +2
In this paper we analyze the practical implications of Szemerédi's regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a h…