Persistent homology (PH) is an operation which, loosely speaking, describes the different holes in a point cloud via a collection of intervals called a barcode. The two most frequently used variants of persistent homology for point clouds are called Čech PH and Vietoris-Rips PH. How much information is lost when we apply these kinds of PH to a point cloud? We investigate this question by studying the subspace of point clouds with the same barcodes under these operations. We establish upper and lower bounds on the dimension of this space, and find that the question of when the persistence map is identifiable has close ties to rigidity theory. For example, we show that a generic point cloud being locally identifiable under Vietoris-Rips persistence is equivalent to a certain graph being rigid on the same point cloud.

Partition diversity refers to the concept that for some networks there may be multiple, similarly plausible ways to group the nodes, rather than one single best partition. In this talk, I will present two projects that address this idea from different but complementary angles. The first introduces the benchmark stochastic cross-block model (SCBM), a generative model designed to create synthetic networks with two distinct 'ground-truth' partitions. This allows us to study the extent to which existing methods for partition detection are able to reveal the coexistence of multiple underlying structures. The second project builds on this benchmark and paves the way for a Bayesian inference framework to directly detect coexisting partitions in empirical networks. By formulating this model as a microcanonical variant of the SCBM, we can evaluate how well it fits a given network compared to existing models. We find that our method more reliably detects partition diversity in synthetic networks with planted coexisting partitions, compared to methods designed to detect a single optimal partition. Together, the two projects contribute to a broader understanding of partition diversity by offering tools to explore the ambiguity of network structure.

(Joint seminar with Random Matrix Theory)

I will discuss old and new results about the distribution of zeros of modular forms, and relation to Quantum Unique Ergodicity. It is known that a modular form of weight k has about k/12 zeros in the fundamental domain . A classical question in the analytic theory of modular forms is “can we locate the zeros of a distinguished family of modular forms?”. In 1970, F. Rankin and Swinnerton-Dyer proved that the zeros of the Eisenstein series all lie on the circular part of the boundary of the fundamental domain. In the beginning of this century, I discovered that for cuspidal Hecke eigenforms, the picture is very different - the zeros are not localized, and in fact become uniformly distributed in the fundamental domain. Very recently, we have investigated other families of modular forms, such as the Miller basis (ZR 2024, Roei Raveh 2025, Adi Zilka 2026), Poincare series (RA Rankin 1982, Noam Kimmel 2025) and theta functions (Roei Raveh 2026),  finding a variety of possible distributions of the zeroes.

(Joint seminar with Random Matrix Theory)

I will introduce the Polchinski dynamics, a general framework to study asymptotic properties of statistical mechanics and field theory models inspired by renormalisation group ideas. The Polchinski dynamics has appeared recently under different names, such as stochastic localisation, and in very different contexts (Markov chain mixing, optimal transport, functional inequalities...) Here I will motivate its construction from a physics point of view and mention a few applications. In particular, I will explain how the Polchinski dynamics can be used to generalise Bakry and Emery’s Γ2 calculus to obtain functional inequalities (e.g. Poincaré, log-Sobolev) in physics models which are typically high-dimensional and non-convex.