BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Département de mathématiques et applications - ECPv6.2.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.math.ens.psl.eu
X-WR-CALDESC:évènements pour Département de mathématiques et applications
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20140330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20141026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20140303T110000
DTEND;TZID=Europe/Paris:20140303T120000
DTSTAMP:20260410T154222
CREATED:20140303T100000Z
LAST-MODIFIED:20211104T095154Z
UID:8177-1393844400-1393848000@www.math.ens.psl.eu
SUMMARY:The scaling limit of the minimum spanning tree of the complete graph
DESCRIPTION:Consider the complete graph on n vertices with independent andidentically distributed edge-weights having some absolutely continuousdistribution. The minimum spanning tree (MST) is simply the spanningsubtree of smallest weight.  It is straightforward to construct theMST using one of several natural algorithms. Kruskal’s algorithmbuilds the tree edge by edge starting from the globally lowest-weightedge and then adding other edges one by one in increasing order ofweight\, as long as they do not create any cycles. At each step of thisprocess\, the algorithm has generated a forest\, which becomes connectedon the final step. In this talk\, I will explain how it is possible toexploit a connection between the forest generated by Kruskal’salgorithm and the Erdös-Rényi random graph in order to prove that M_n\,the MST of the complete graph\, possesses a scaling limit as n tends toinfinity.  In particular\, if we think of M_n as a metric space (usingthe graph distance)\, rescale edge-lengths by n^{-1/3}\, and endow thevertices with the uniform measure\, then M_n converges in distributionin the sense of the Gromov-Hausdorff-Prokhorov distance to a certainrandom measured real tree.This is joint work with Louigi Addario-Berry (McGill)\, Nicolas Broutin(INRIA Paris-Rocquencourt) and Grégory Miermont (ENS Lyon).
URL:https://www.math.ens.psl.eu/evenement/the-scaling-limit-of-the-minimum-spanning-tree-of-the-complete-graph/
LOCATION:Salle W
CATEGORIES:Séminaire informel de probabilités
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20140310T140000
DTEND;TZID=Europe/Paris:20140310T150000
DTSTAMP:20260410T154222
CREATED:20140310T130000Z
LAST-MODIFIED:20211104T095154Z
UID:8178-1394460000-1394463600@www.math.ens.psl.eu
SUMMARY:Marche renforcée par arêtes\, Processus de saut renforcé par site et identité de Ray-Knight généralisée.
DESCRIPTION:Dans cet exposé je présenterai une nouvelle preuve de  l’identité de Ray-Knight généralisée basée sur un argument de martingale. Cette martingale apparaît en lien  avec le processus de saut renforcé par sites (VRJP) qui est un processus avec mémoire  étroitement relié à la marche renforcée par arêtes (en collaboration  avec P. Tarrès).
URL:https://www.math.ens.psl.eu/evenement/marche-renforcee-par-aretes-processus-de-saut-renforce-par-site-et-identite-de-ray-knight-generalisee/
LOCATION:Salle Henri Cartan
CATEGORIES:Séminaire informel de probabilités
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20140317T140000
DTEND;TZID=Europe/Paris:20140317T150000
DTSTAMP:20260410T154222
CREATED:20140317T130000Z
LAST-MODIFIED:20211104T095155Z
UID:8179-1395064800-1395068400@www.math.ens.psl.eu
SUMMARY:Marche aléatoire indexée par un arbre et son nombre de points visités
DESCRIPTION:Considérons une marche aléatoire simple dans Z^d indexée par un arbrealéatoire choisi uniformément au hasard dans l’ensemble des arbres planairesde n sommets\, et soit R(n) le nombre de points visités par cette marche.On montre que\, si d>4\, R(n)/n converge vers une constante strictementpositive\, alors que si d=4\, (log n)*R(n)/n converge vers  (Pi^2)/2. Enpetites dimensions d
URL:https://www.math.ens.psl.eu/evenement/marche-aleatoire-indexee-par-un-arbre-et-son-nombre-de-points-visites/
LOCATION:Salle Henri Cartan
CATEGORIES:Séminaire informel de probabilités
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20140331T110000
DTEND;TZID=Europe/Paris:20140331T120000
DTSTAMP:20260410T154222
CREATED:20140331T090000Z
LAST-MODIFIED:20211104T095209Z
UID:8181-1396263600-1396267200@www.math.ens.psl.eu
SUMMARY:Analysis of a one-sided limit order book model
DESCRIPTION:A limit order book is a financial trading mechanism that keeps track of orders made by traders\, and allows to execute them in the future. In this talk I will present a simple model of a one-sided limit order book\, which is modeled as a point process evolving over time.I will discuss two aspects of this model: the asymptotic behavior of the so-called price process (the extremal point) and the scaling limit of the entire measure-valued process. The proofs rely on a coupling with a branching random walk with a barrier\, and on a characterization of regenerative real trees due to Weill [Ann. Probab. 2007].
URL:https://www.math.ens.psl.eu/evenement/analysis-of-a-one-sided-limit-order-book-model/
LOCATION:Salle U/V
CATEGORIES:Séminaire informel de probabilités
END:VEVENT
END:VCALENDAR