Designed and built with care, filled with creative elements

Top

Un après-midi de théorie des groupes – Adrien Boyer, Julien Marché, Greg Patchell

Salle W

14:00-14:45 Adrien Boyer (IMJ-PRG): Property RD and Boundary Representations for A2 Buildings 15:00-15:45 Julien Marché (ENS – PSL): Action of endomorphisms of free groups on their SL_2-character varieties 16:15-17:00 Greg Patchell (University of Oxford): Selfless Inclusions of C*-Algebras and Quantum Groups Abstracts: Greg Patchell: Selfless Inclusions of C*-Algebras and Quantum Groups Recently, strong asymptotic freeness, or selflessness, in C-algebras has emerged as a powerful technique to prove important regularity properties including simplicity, unique trace, stable rank 1, and strict comparison. In particular, in Fall 2024, Amrutam, Gao, Kunnwalkam Elayavalli, and […]

ENS-Data Science colloquium – Michael Chertkov : Samples That Cooperate, Samples That Remember: Two Exactly Solvable Bridge Diffusions

ENS Salle Dussane

Diffusion-based generative models treat samples as independent and memoryless. I will show that relaxing each assumption leads to rich, exactly solvable physics — with no neural networks anywhere.Giving samples a present — coupling them through their evolving mean field — produces a McKean–Vlasov optimal transport problem whose self-consistent guidance is provably the linear interpolant between endpoint means, for arbitrary distributions and any interaction schedule; applied to building-fleet demand response, this saves 20%+ in actuation energy.Giving samples a past produces a continual-learning agent whose memory is a Bridge Diffusion and whose […]

Serte Donderwinkel – Counting connected graphs

Salle W (ENS)

How many connected graphs have a prescribed degree sequence?This classical combinatorial question turns out to admit a natural probabilistic approach. In joint ongoing work with Sasha Bell and Remco van der Hofstad, we derive asymptotic formulas for the number of connected graphs with a given degree sequence. Our approach is an example of the probabilistic method: rather than counting directly, we introduce a suitable random graph model and study the likelihood that it exhibits a desired structure. Concretely, we construct a random graph in which (an approximation of) the prescribed […]

Marco Mazzucchelli

ENS — amphi Galois 45 rue d'Ulm, Paris, France

Séminaires des Mathématiques

Céline Lévy-Leduc

ENS — amphi Galois 45 rue d'Ulm, Paris, France

Séminaires des Mathématiques

Vlad Vicol

Jussieu -- salle 15-16-309 4 Place Jussieu, Paris, France

Rémi Coulon

ENS — amphi Galois 45 rue d'Ulm, Paris, France

Séminaires des Mathématiques

Hélène Mathis

Salle W - ENS PSL 45 rue d'Ulm, Paris, France