BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Chenlin Gu (ENS Paris)
DTSTART:20200511T130000Z
DTEND:20200511T133000Z
DTSTAMP:20260423T021107Z
UID:LPDD/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/LPDD/5/">An 
 efficient algorithm for solving elliptic problems on percolation clusters<
 /a>\nby Chenlin Gu (ENS Paris) as part of Les probabilités de demain webi
 nar\n\n\nAbstract\nWe present an efficient algorithm to solve elliptic Dir
 ichlet problems\ndefined on the cluster of Z^d supercritical Bernoulli per
 colation\, as a\ngeneralization of the iterative method proposed by S. Arm
 strong\, A.\nHannukainen\, T. Kuusi and J.-C. Mourrat. We also explore the
  two-scale\nexpansion on the infinite cluster of percolation\, and use it 
 to give a\nrigorous analysis of the algorithm.\n
LOCATION:https://researchseminars.org/talk/LPDD/5/
END:VEVENT
END:VCALENDAR