An Observer in de Sitter Space, and Rereading Everett - Edward Witten @videosfromIAS

Uploaded March 2026 | Updated September 2026, 3 weeks ago

MPG-IAS-NTU Center Kick-off Conference

Topic: An Observer in de Sitter Space, and Rereading Everett
Speaker: Edward Witten
Affiliation: Institute for Advanced Study
Date: March 16, 2026 3:35pm
Wolfensohn Hall

An Observer in de Sitter Space, and Rereading Everett - Edward Witten

Holograms and their Standard Models: DSSYK_∞ and the ‘t Hooft Model - Leonard Susskind

Stellar Physics in (3+1) D: Massive Stars at the Intersection of Large-Scale.... - Jared Goldberg

de Sitter Quantum Cosmology - Part 1 - Jordan Cotler

Fast Dynamo Action On The 3-Torus For Pulsed-Diffusions - Massimo Sorella

Gravitational tidal matching and elliptic curves - Giulia Isabella

Tropical Geometry for the One-Loop Cosmological Collider - Aidan Herderschee

Learning from Complexity III - Maryanthe Malliaris

Intro to Celestial Holography - Part 1 - Mina Himwich

$Random Geometric Graphs - Aleksa Milojević Computer Science/Discrete Mathematics Seminar I Topic: Random Geometric Graphs Speaker: Aleksa Milojević Affiliation: ETH Zurich June 08, 2026 Simonyi Classroom 114 The random geometric graph Geo_d(n,p) is a probability distribution over graphs, constructed by placing n points uniformly on a d-dimensional sphere and connecting two points whenever they are sufficiently close — where the proximity threshold is chosen so that each edge appears with probability p. Recently, Ma, Shen, and Xie used this model to obtain improved constructions for the Ramsey numbers R(k,Ck), where C1 is a fixed constant. In this talk, I will present a simplification of their approach that allows for a sharper quantitative analysis and gives improved lower bounds. I will also discuss how the same ideas can be used to make progress on a conjecture of Bubeck, Ding, Eldan, and Rácz. They observed that when the dimension d is sufficiently large as a function of n and p, the distribution Geo_d(n,p) converges to the classical Erdős–Rényi random graph G(n,p) in total variation distance, and conjectured that the precise threshold for this convergence is d=(np)^3polylog(p). Until now, this conjecture had been verified only in the extremal regimes p=Θ(1) and p=Θ(1/n). I will outline a proof of the conjecture in the intermediate regime n^{-1/5}p1. This talk is based on the joint work with Zach Hunter and Benny Sudakov.$

Combinatorics of Singular Cardinals - Dima Sinapova

A Black Hole Airy Tail: Part 1 - Pratik Rath

Institute for Advanced Study |

An Observer in de Sitter Space, and Rereading Everett - Edward Witten