BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Alexander Holroyd (University of Bristol)
DTSTART:20201008T180000Z
DTEND:20201008T190000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/1/">Local constraint solving - how to color without looking
  (much)</a>\nby Alexander Holroyd (University of Bristol) as part of Proba
 bility and Data Science Colloquium\n\n\nAbstract\nHow can individuals coop
 erate to satisfy local constraints without a central authority? Examples m
 ight include autonomous drones navigating in a swarm\, or university depar
 tments scheduling their seminars.\n\nIndividuals can make random choices a
 nd communicate with each other\, but all must follow the same procedure.\n
 \n \n\nHow small can we make the "coding radius" - the distance to which a
 n individual must communicate? In the setting of the integer line Z\, ther
 e is a surprising universal answer that applies to every non-trivial const
 raint problem. In d-dimensional Euclidean space\, answers are available fo
 r the key case of proper colouring\; it turns out that there is a huge dif
 ference between 3 and 4 colors. Finally\, I'll mention how changing the qu
 estion slightly has led to the discovery of an amazing mathematical object
  that seemingly has no right to exist.\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mauro Maggioni (Johns Hopkins University)
DTSTART:20201022T180000Z
DTEND:20201022T190000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/2/">Learning Interaction laws in particle- and agent-based 
 systems</a>\nby Mauro Maggioni (Johns Hopkins University) as part of Proba
 bility and Data Science Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:James Norris (Unversity of Cambridge)
DTSTART:20201105T190000Z
DTEND:20201105T200000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/3/">The master field on the sphere</a>\nby James Norris (Un
 versity of Cambridge) as part of Probability and Data Science Colloquium\n
 \nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jian Ding (UPENN)
DTSTART:20201203T190000Z
DTEND:20201203T200000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/4/">A review for random field Ising model</a>\nby Jian Ding
  (UPENN) as part of Probability and Data Science Colloquium\n\nAbstract: T
 BA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nike Sun (MIT)
DTSTART:20210128T183000Z
DTEND:20210128T193000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/5/">Phase Transitions In Random Constraint Satisfaction Pro
 blems</a>\nby Nike Sun (MIT) as part of Probability and Data Science Collo
 quium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vadim Gorin (University of Wisconsin)
DTSTART:20210211T190000Z
DTEND:20210211T200000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/6/">Infinite beta random matrix theory</a>\nby Vadim Gorin 
 (University of Wisconsin) as part of Probability and Data Science Colloqui
 um\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Xiaohui Chen (UIUC)
DTSTART:20210304T190000Z
DTEND:20210304T200000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/7/">A diffusion perspective of manifold clustering</a>\nby 
 Xiaohui Chen (UIUC) as part of Probability and Data Science Colloquium\n\n
 Abstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yihong Wu (Yale University)
DTSTART:20200408T180000Z
DTEND:20200408T190000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/8
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/8/">Recent results in planted assignment problems</a>\nby Y
 ihong Wu (Yale University) as part of Probability and Data Science Colloqu
 ium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yihong Wu (Yale University)
DTSTART:20210408T180000Z
DTEND:20210408T190000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/9/">Recent results in planted assignment problems</a>\nby Y
 ihong Wu (Yale University) as part of Probability and Data Science Colloqu
 ium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Russ Lyons (Indiana University)
DTSTART:20210422T180000Z
DTEND:20210422T190000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/10/">Lower Bounds for Reconstruction from the Deletion Chan
 nel</a>\nby Russ Lyons (Indiana University) as part of Probability and Dat
 a Science Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ivan Corwin (Columbia University)
DTSTART:20210427T200000Z
DTEND:20210427T210000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/11/">Stationary measure for the open KPZ equation</a>\nby I
 van Corwin (Columbia University) as part of Probability and Data Science C
 olloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Wei-Kuo Chen (University of Minnesota)
DTSTART:20210429T180000Z
DTEND:20210429T190000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/12/">Grothendeick L_p problem for Guaussian matrices</a>\nb
 y Wei-Kuo Chen (University of Minnesota) as part of Probability and Data S
 cience Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jian Song
DTSTART:20220428T181500Z
DTEND:20220428T191500Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/13/">A New Correlation Inequality for Ising models with ext
 ernal fields</a>\nby Jian Song as part of Probability and Data Science Col
 loquium\n\n\nAbstract\nJoin Zoom Meeting\nhttps://zoom.us/j/3106002217?pwd
 =OVd2L0g5c0NMM3o4MjRGRWNsNVFJdz09\n\nMeeting ID: 310 600 2217\nPasscode: D
 G3fAA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Perla Sousi (University of Cambridge)
DTSTART:20221111T143000Z
DTEND:20221111T153000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/14
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/14/">Picking a spanning tree at random</a>\nby Perla Sousi 
 (University of Cambridge) as part of Probability and Data Science Colloqui
 um\n\n\nAbstract\nSpanning trees in a connected graph are basic objects of
  great interest to mathematicians and computer scientists. What does a typ
 ical spanning tree look like? How can we pick one uniformly\, as usually t
 hey are too numerous to list? A connection of spanning trees to electrical
  networks was found by Kirchhoff in 1847\, and elegant sampling algorithms
  using random walks were found in the 1990’s by Aldous\, Broder and Wils
 on. These connections have yielded many insights on the geometry of unifor
 m spanning trees. In my talk I will present some recent work with Tom Hutc
 hcroft on the geometry of the uniform spanning tree in Z^4\, which can be 
 thought of as the "uniform measure" on trees of Z^4.\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sanjay Ramassamy (Université Paris-Saclay)
DTSTART:20230421T133000Z
DTEND:20230421T143000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/15
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/15/">Last-passage percolation on the complete graph and par
 ticle systems</a>\nby Sanjay Ramassamy (Université Paris-Saclay) as part 
 of Probability and Data Science Colloquium\n\n\nAbstract\nI will review re
 cent and ongoing work on last-passage percolation on the complete directed
  acyclic graph over the integers. The edges of this graph carry iid weight
 s\, which may be positive or negative. We are interested in paths that max
 imize the sum of the weights.\n\nI will first discuss the special case whe
 n the weights take only values +1 or minus infinity. This is called the Ba
 rak-Erdös graph\, it is a directed acyclic version of the Erdös-Rényi g
 raph. In that case\, the time constant (namely the growth rate of the weig
 ht of the heaviest path) is an analytic function of the probability p that
  the edge weight takes value +1. The original proof relied on a coupling w
 ith a particle system called the infinite bin model.\n\nI will then mentio
 n recent results on more general edge-weight distributions for last-passag
 e percolation\, as well as properties of particle systems generalizing the
  infinite bin model.\n\nThe talk is based on several joint works with Serg
 ey Foss (Sobolev Institute and Heriot-Watt University)\, Takis Konstantopo
 ulos (University of Liverpool)\, Bastien Mallein (Université Sorbonne Par
 is Nord and École normale supérieure)\, Arvind Singh (CNRS and Universit
 é Paris-Saclay) and Benjamin Terlat (Université Paris-Saclay).\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Beatrice de Tiliere (University Paris Dauphine)
DTSTART:20230505T133000Z
DTEND:20230505T143000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/16/">The dimer model on minimal graphs: the elliptic case a
 nd beyond.</a>\nby Beatrice de Tiliere (University Paris Dauphine) as part
  of Probability and Data Science Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Antonio Auffinger
DTSTART:20230922T133000Z
DTEND:20230922T143000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/17
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/17/">Dimension Reduction Methods for Data Visualization</a>
 \nby Antonio Auffinger as part of Probability and Data Science Colloquium\
 n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Xin Sun (University of Pennsylvania)
DTSTART:20231103T133000Z
DTEND:20231103T143000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/18
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/18/">Two dimensional percolation and Liouville quantum grav
 ity</a>\nby Xin Sun (University of Pennsylvania) as part of Probability an
 d Data Science Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Philippe Sosoe (Cornell University)
DTSTART:20231110T143000Z
DTEND:20231110T153000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/19
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/19/">KPZ estimates for ASEP and the stochastic six vertex m
 odel</a>\nby Philippe Sosoe (Cornell University) as part of Probability an
 d Data Science Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Wei-Kuo Chen (University of Minnesota)
DTSTART:20231208T143000Z
DTEND:20231208T153000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/20
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/20/">A Gaussian convexity for logarithmic moment generating
  function</a>\nby Wei-Kuo Chen (University of Minnesota) as part of Probab
 ility and Data Science Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Katy Craig (UCSB)
DTSTART:20231214T191500Z
DTEND:20231214T201500Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/21
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/21/">Nonlocal approximations of optimal transport and diffu
 sion</a>\nby Katy Craig (UCSB) as part of Probability and Data Science Col
 loquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hugo Duminil-Copin (IHES)
DTSTART:20240412T133000Z
DTEND:20240412T143000Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/22
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/22/">Critical phenomena through the lens of the Ising model
 </a>\nby Hugo Duminil-Copin (IHES) as part of Probability and Data Science
  Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gordon Slade (University of British Columbia)
DTSTART:20240425T181500Z
DTEND:20240425T191500Z
DTSTAMP:20260422T212556Z
UID:probabilitymachinelearning/23
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/probabilitym
 achinelearning/23/">Convergence of the lace expansion</a>\nby Gordon Slade
  (University of British Columbia) as part of Probability and Data Science 
 Colloquium\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/probabilitymachinelearning/23/
END:VEVENT
END:VCALENDAR