Black holes play a central role in our understanding of quantum gravity, but identifying their precise counterparts in a dual QFT remains a tricky business. These states are heavy, chaotic, and encode various universal aspects — but are also notoriously hard to characterise. In this talk, we’ll explore how supersymmetric field theories provide a controlled setting to study black hole states. In particular, we’ll introduce the idea of fortuitous states as a useful criterion for identifying BPS black hole states. We’ll then illustrate this concept with concrete examples, including the (supersymmetric) SYK model and the D1-D5 CFT.

The discussion will be based on the following recent papers:
arXiv:2402.10129, arXiv:2412.06902, and arXiv:2501.05448.

Networks provide a powerful language to model interacting systems by representing their units as nodes and the interactions between them as links. Interactions can be connotated in several ways, such as binary/weighted, undirected/directed, etc. In the present talk, we focus on the positive/negative connotation - modelling trust/distrust, alliance/enmity, friendship/conflict, etc. - by considering the so-called signed networks. Rooted in the psychological framework of the balance theory, the study of signed networks has found application in fields as different as biology, ecology, economics. Here, we approach it from the perspective of statistical physics by extending the framework of Exponential Random Graph Models to the class of binary un/directed signed networks and employing it to assess the significance of frustrated patterns in real-world networks. As our results reveal, it critically depends on i) the considered system and ii) the employed benchmark. For what concerns binary directed networks, instead, we explore the relationship between frustration and reciprocity and suggest an alternative interpretation of balance in the light of directionality. Finally,  leveraging the ERGMs framework, we propose an unsupervised algorithm to obtain statistically validated projections of bipartite signed networks, according to which any, two nodes sharing a statistically significant number of concordant (discordant) motifs are connected by a positive (negative) edge, and we investigate signed structures at the mesoscopic scale by evaluating the tendency of a configuration to be either `traditionally' or `relaxedly' balanced.

While the brain has long been conceptualized as a network of neurons connected by synapses, attempts to describe the connectome using established models in network science have yielded conflicting outcomes, leaving the architecture of neural networks unresolved. Here, we analyze eight experimentally mapped connectomes, finding that the degree and the strength distribution of the underlying networks cannot be described by random nor scale-free models. Rather, the node degrees and strengths are well approximated by lognormal distributions, whose emergence lacks a mechanistic model in the context of networks. Acknowledging the fact that the brain is a physical network, whose architecture is driven by the spatially extended nature of its neurons, we analytically derive the multiplicative process responsible for the lognormal neuron length distribution, arriving to a series of empirically falsifiable predictions and testable relationships that govern the degree and the strength of individual neurons. The lognormal network characterizing the connectome represents a novel architecture for network science, that bridges critical gaps between neural structure and function, with unique implications for brain dynamics, robustness, and synchronization.

Real-world networks have a complex topology with many interconnected elements often organized into communities. Identifying these communities helps reveal the system’s organizational and functional structure. However, network data can be noisy, with incomplete link observations, making it difficult to detect significant community structures as missing data weakens the evidence for specific solutions. Recent research shows that flow-based community detection methods can highlight spurious communities in sparse networks with incomplete link observations. To address this issue, these methods require regularization. In this talk, I will show how a Bayesian approach can be used to regularize flows in networks, reducing overfitting in the flow-based community detection method known as the map equation.