Caterina De Bacco

Dr. Caterina De Bacco

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
24 April 2017 in Physical Review E
Verified
Journal Article
Closed access
PDF file
CBCaterina De Bacco
Caterina De Bacco
EPEleanor A. Power
Eleanor A. Power
DLDaniel B. Larremore
Daniel B. Larremore
CMCristopher Moore
Cristopher Moore
Complex systems are often characterized by distinct types of interactions between the same entities. These can be described as a multilayer network where each layer represents one type of interaction. These layers may be interdependent in complicated ways, revealing different kinds of structure in the network. In this work we present a generative model, and an efficient expectation-maximization algorithm, which allows us to perform inference tasks such as community detection and link prediction in this setting. Our model assumes overlapping communities that are common between the layers, while allowing these communities to affect each layer in a different way, including arbitrary mixtures of assortative, disassortative, or directed structure. It also gives us a mathematically principled way to define the interdependence between layers, by measuring how much information about one layer helps us predict links in another layer. In particular, this allows us to bundle layers together to compress redundant information and identify small groups of layers which suffice to predict the remaining layers accurately. We illustrate these findings by analyzing synthetic data and two real multilayer networks, one representing social support relationships among villagers in South India and the other representing shared genetic substring material between genes of the malaria parasite.

1 August 2016 in Journal of Statistical Mechanics: Theory and Experiment
Verified
Journal Article
Closed access
PDF file
UBUttam Bhat
Uttam Bhat
CBCaterina De Bacco
Caterina De Bacco
SRS Redner
S Redner
We investigate a stochastic search process in one, two, and three dimensions in which N diffusing searchers that all start at x 0 seek a target at the origin. Each of the searchers is also reset to its starting point, either with rate r , or deterministically, with a reset time T . In one dimension and for a small number of searchers, the search time and the search cost are minimized at a non-zero optimal reset rate (or time), while for sufficiently large N , resetting always hinders the search. In general, a single searcher leads to the minimum search cost in one, two, and three dimensions. When the resetting is deterministic, several unexpected feature arise for N searchers, including the search time being independent of T for 1 / T → 0 and the search cost being independent of N over a suitable range of N . Moreover, deterministic resetting typically leads to a lower search cost than in Poisson resetting.

24 November 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
MCMartina Contisciani
Martina Contisciani
FBFederico Battiston
Federico Battiston
CBCaterina De Bacco
Caterina De Bacco
Hypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks. Here we propose a framework based on statistical inference to characterize the structural organization of hypergraphs. The method allows to infer missing hyperedges of any size in a principled way, and to jointly detect overlapping communities in presence of higher-order interactions. Furthermore, our model has an efficient numerical implementation, and it runs faster than dyadic algorithms on pairwise records projected from higher-order data. We apply our method to a variety of real-world systems, showing strong performance in hyperedge prediction tasks, detecting communities well aligned with the information carried by interactions, and robustness against addition of noisy hyperedges. Our approach illustrates the fundamental advantages of a hypergraph probabilistic model when modeling relational systems with higher-order interactions.

6 July 2018 in Science Advances
Verified
Journal Article
Open access
PDF file
CBCaterina De Bacco
Caterina De Bacco
DLDaniel B. Larremore
Daniel B. Larremore
CMCristopher Moore
Cristopher Moore
A simple physical model enables rapid detection and extraction of linear hierarchies in large networks.

14 July 2023 in Science Advances
Verified
Journal Article
Open access
NRNicolò Ruggeri
Nicolò Ruggeri
MCMartina Contisciani
Martina Contisciani
FBFederico Battiston
Federico Battiston
CBCaterina De Bacco
Caterina De Bacco
Hypergraphs, describing networks where interactions take place among any number of units, are a natural tool to model many real-world social and biological systems. Here, we propose a principled framework to model the organization of higher-order data. Our approach recovers community structure with accuracy exceeding that of currently available state-of-the-art algorithms, as tested in synthetic benchmarks with both hard and overlapping ground-truth partitions. Our model is flexible and allows capturing both assortative and disassortative community structures. Moreover, our method scales orders of magnitude faster than competing algorithms, making it suitable for the analysis of very large hypergraphs, containing millions of nodes and interactions among thousands of nodes. Our work constitutes a practical and general tool for hypergraph analysis, broadening our understanding of the organization of real-world higher-order systems.

25 September 2020 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MCMartina Contisciani
Martina Contisciani
EPEleanor A. Power
Eleanor A. Power
CBCaterina De Bacco
Caterina De Bacco
Community detection in networks is commonly performed using information about interactions between nodes. Recent advances have been made to incorporate multiple types of interactions, thus generalizing standard methods to multilayer networks. Often, though, one can access additional information regarding individual nodes, attributes, or covariates. A relevant question is thus how to properly incorporate this extra information in such frameworks. Here we develop a method that incorporates both the topology of interactions and node attributes to extract communities in multilayer networks. We propose a principled probabilistic method that does not assume any a priori correlation structure between attributes and communities but rather infers this from data. This leads to an efficient algorithmic implementation that exploits the sparsity of the dataset and can be used to perform several inference tasks; we provide an open-source implementation of the code online. We demonstrate our method on both synthetic and real-world data and compare performance with methods that do not use any attribute information. We find that including node information helps in predicting missing links or attributes. It also leads to more interpretable community structures and allows the quantification of the impact of the node attributes given in input.