activity
20202026
most citedSTruD: Truss Decomposition of Simplicial Complexes

15 citations · 32 across the 10 of their papers we have counts for

collaborators

12 papers

cs.SI2026

HyDRA: Lossless Hypergraph Summarization via Co-Clustering

Giulia Preti, Aris Anagnostopoulos, Francesco Bonchi

Hypergraphs are a powerful representation for higher-order interactions but their scale and complexity pose significant data management and analysis challenges. While summarization…

cs.SI2025

DSP: A Statistically-Principled Structural Polarization Measure

Giulia Preti, Matteo Riondato, Aristides Gionis +1

Social and information networks may become polarized, leading to echo chambers and political gridlock. Accurately measuring this phenomenon is a critical challenge. Existing measur…

cs.SI2025★ 1 cited

Alice and the Caterpillar: A more descriptive null model for assessing data mining results

Giulia Preti, Gianmarco De Francisci Morales, Matteo Riondato

We introduce novel null models for assessing the results obtained from observed binary transactional and sequence datasets, using statistical hypothesis testing. Our null models ma…

cs.SI2024★ 2 cited

Polaris: Sampling from the Multigraph Configuration Model with Prescribed Color Assortativity

Giulia Preti, Matteo Riondato, Aristides Gionis +1

We introduce Polaris, a network null model for colored multi-graphs that preserves the Joint Color Matrix. Polaris is specifically designed for studying network polarization, where…

cs.SI2024★ 3 cited

Higher-order null models as a lens for social systems

Giulia Preti, Adriano Fazzone, Giovanni Petri +1

Despite the widespread adoption of higher-order mathematical structures such as hypergraphs, methodological tools for their analysis lag behind those for traditional graphs. This w…

cs.SI2023★ 2 cited

An impossibility result for Markov Chain Monte Carlo sampling from micro-canonical bipartite graph ensembles

Giulia Preti, Gianmarco De Francisci Morales, Matteo Riondato

Markov Chain Monte Carlo (MCMC) algorithms are commonly used to sample from graph ensembles. Two graphs are neighbors in the state space if one can be obtained from the other with…