Let X be a simple random walk in Znd with d≥3 and let tcov be the expected time it takes for X to visit all vertices of the torus. In joint work with Prévost and Rodriguez we study the set Lα of points that have not been visited by time αtcov and prove that it exhibits a phase transition: there exists α∗ so that for all α>α∗ and all ϵ>0 there […]

In this talk we consider discrete Gaussian free fields with ergodic random conductances on ℤd, d ≥ 2, where the conductances are possibly unbounded but satisfy a moment condition. As our main result, we show that, for almost every realisation of the environment, the rescaled field converges in law towards a continuous Gaussian field. We […]

Quantum computing with discrete variable (DV, qubit) hardware is approaching the large scales necessary for computations beyond the reach of classical computers. Separately, hardware containing native continuous-variable (CV, oscillator) systems has received attention as an alternative approach, yet the universal control of such systems is non-trivial. In this talk, I will highlight novel quantum algorithms, […]

On Thursday, May 08, 2025, at 12:15 pm, Prof. Dr. Shi Jin (Shanghai Jiao Tong University) will give a talk on “Quantum Computation of partial differential equations and related problems” at TUM, Boltzmannstr. 3, 85748 Garching Forschungszentrum, room 03.06.011. Abstract: Quantum computers have the potential to gain algebraic and even up to exponential speed up compared with its classical counterparts, and can lead to […]

Evolutionary deep neural networks have emerged as a rapidly growing field of research. This talk discusses numerical integrators for such and other classes of nonlinear parametrizations u(t) = Φ(θ(t)) where the evolving parameters θ(t) are to be computed. The primary focus is on tackling the challenges posed by the combination of stiff evolution problems and […]

We prove a fluid limit for the coarsening phase of the condensing zero-range process on a finite number of sites. When time and occupation per site are linearly rescaled by the total number of particles, the evolution of the process is described by a piecewise linear trajectory in the simplex indexed by the sites. The […]

We explore a connection between a weak topology on spaces of probability measures, a classical combinatorial problem in matching, and numerical schemes for the solution of PDEs by neural networks.