Detectability Transition in the Problem of Network Alignment

Identifier:  TFG:9483

Handle: https://hdl.handle.net/20.500.11797/TFG9483

Authors:  Sarró Sánchez, Pablo

Abstract:
Network alignment is a fundamental problem in network science, with applications spanning various domains, including neuroscience, biology and information technology. It involves finding a meaningful mapping between the nodes of two or more networks, which may represent different observations of the same underlying system. One of the most critical challenges in this field is detectability, the ability to correctly infer the alignment given noisy or incomplete information. Understanding the limits of detectability is essential, as it determines whether an alignment can be recovered with high confidence or if the problem is fundamentally unsolvable.