BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ron Peled (Tel Aviv University)
DTSTART:20200915T153000Z
DTEND:20200915T161000Z
DTSTAMP:20260404T060944Z
UID:BIRS_20w5203/1
DESCRIPTION:Title: Euclidean random permutations\nby Ron Peled (Tel Aviv Univ
ersity) as part of BIRS workshop: Permutations and Probability\n\nAbstract
: TBA\n
LOCATION:https://stable.researchseminars.org/talk/BIRS_20w5203/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Evita Nestoridi (Princeton University)
DTSTART:20200915T161500Z
DTEND:20200915T165500Z
DTSTAMP:20260404T060944Z
UID:BIRS_20w5203/2
DESCRIPTION:Title: Mixing results for the interchange and exclusion processes wit
h open boundaries\nby Evita Nestoridi (Princeton University) as part o
f BIRS workshop: Permutations and Probability\n\n\nAbstract\nAssign distri
ct cards to the vertices of a finite\, connected graph G(V\, E) with |V|=n
. The interchange process is a card shuffling scheme generated by flipping
the cards at the ends of the edges of the graph. The exclusion process fo
llows the same dynamics where instead each vertex is assigned one of two c
olors. In this talk\, I will discuss recent developments concerning the mi
xing time of these two processes on the interval of length n. I will focus
in particular on the asymmetric exclusion process with open boundaries\,
where particles are allowed to jump in and out from the ends of the interv
al. This is joint work with Gantert and Schmid.\n
LOCATION:https://stable.researchseminars.org/talk/BIRS_20w5203/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Duncan Dauvergne (Princeton University)
DTSTART:20200917T153000Z
DTEND:20200917T161000Z
DTSTAMP:20260404T060944Z
UID:BIRS_20w5203/3
DESCRIPTION:Title: The scaling limit of the longest increasing subsequence\nb
y Duncan Dauvergne (Princeton University) as part of BIRS workshop: Permut
ations and Probability\n\n\nAbstract\nI will describe a framework for prov
ing convergence to the directed landscape\, the central limit object in th
e KPZ universality class. The directed landscape is a random scale-invaria
nt `directed' metric on the plane. One highlight of this work is that the
scaling limit of the longest increasing subsequence in a uniformly random
permutation is a geodesic in the directed landscape. Joint work with Balin
t Virag.\n
LOCATION:https://stable.researchseminars.org/talk/BIRS_20w5203/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mickaël Maazoun (Oxford University)
DTSTART:20200917T161500Z
DTEND:20200917T165500Z
DTSTAMP:20260404T060944Z
UID:BIRS_20w5203/4
DESCRIPTION:Title: Scaling limits of Baxter permutations and bipolar orientations
\nby Mickaël Maazoun (Oxford University) as part of BIRS workshop: Pe
rmutations and Probability\n\n\nAbstract\nJoint work with Jacopo Borga\, h
ttps://arxiv.org/abs/2008.09086 .\n\nThe theory of permutons allows us to
express scaling limits of the diagram of permutations. Scaling limits of u
niform elements in various classes of pattern-avoiding permutations have a
ttracted a fair amount of attention lately. We show such a result for Baxt
er permutations\, a famous class of permutations avoiding generalized patt
erns.\n\nA remarkable bijection of Bousquet-Mélou\, Bonichon and Fusy (20
10) with bipolar orientations\, a type of decorated planar maps\, allows u
s to express a Baxter permutation in terms of the relationship between the
mating-of-trees encoding (Kenyon\, Miller\, Sheffield\, Wilson\, 2015) of
a bipolar orientation and the one of its dual map. This was already studi
ed by Gwynne\, Holden\, Sun (2016)\, and our main result can be seen as an
improvement of theirs.\n\nThe main step of our approach is to encode the
problem in a "coalescent-walk" process\, which converges to the coalescing
process obtained when solving the perturbed Tanaka SDE (Prokaj\, 2011) wi
th the same Brownian noise at different starting times. If time allows\, I
will talk about the robustness of the method and possible generalizations
.\n
LOCATION:https://stable.researchseminars.org/talk/BIRS_20w5203/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dan Romik (University of California Davis)
DTSTART:20200917T170000Z
DTEND:20200917T174000Z
DTSTAMP:20260404T060944Z
UID:BIRS_20w5203/5
DESCRIPTION:Title: Distributional identities and absorbing time asymptotics in th
e oriented swap process\nby Dan Romik (University of California Davis)
as part of BIRS workshop: Permutations and Probability\n\n\nAbstract\nThe
oriented swap process is a model for a random sorting network\, in which
N particles labeled 1\,...\,N arranged on the discrete lattice [1\,N] star
t out in increasing order and then perform successive adjacent swaps at ra
ndom times until they reach the reverse configuration N\,...\,1. An open p
roblem from 2009 asked for the limiting law of the absorbing time of the p
rocess. In recent joint works with Bisi-Cunden-Gibbons and Bufetov-Gorin\,
we resolved this problem by showing that the limiting law is the Tracy-Wi
dom GOE distribution\, aka F_1. I will tell the story of this result and h
ow it came to be discovered and proved\, which involves connections to rec
ent works by Borodin-Gorin-Wheeler\, Dauvergne and Galashin\, and a new fa
mily of distributional identities relating the behavior of the oriented sw
ap process in a surprising way to last passage percolation. Some of these
identities are still conjectural and hint at the existence of symmetries i
n the oriented swap process\, multi-type TASEP and related processes that
are still not understood. As a side treat for algebraic combinatorics enth
usiasts\, the RSK\, Burge and Edelman-Greene maps will also make an appear
ance.\n
LOCATION:https://stable.researchseminars.org/talk/BIRS_20w5203/5/
END:VEVENT
END:VCALENDAR