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-WR-CALNAME:Département de mathématiques et applications
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:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240502T120000
DTEND;TZID=Europe/Paris:20240502T140000
DTSTAMP:20260524T090743
CREATED:20240502T082208Z
LAST-MODIFIED:20241115T095953Z
UID:17434-1714651200-1714658400@www.math.ens.psl.eu
SUMMARY:ENS-Data Science colloquium - Michael Jordan
DESCRIPTION:Michael Jordan (UC Berkeley and INRIA Paris)\n\n\n\n\n\nCollaborative Learning\, Information Asymmetries\, and Incentives\n\n\n\n\n\n\n\n\n\nThis colloquium is organized around data sciences in a broad sense\, with the goal of bringing together researchers with diverse backgrounds (including mathematics\, computer science\, physics\, chemistry and neuroscience) but a common interest in dealing with complex\, large scale\, or high dimensional data. More information can be found on the web page of the seminar: https://data-ens.github.io/seminar/
URL:https://www.math.ens.psl.eu/evenement/ens-data-science-colloquium-michael-jordan/
LOCATION:Amphi Jaurès (29 Rue d’Ulm)
CATEGORIES:Séminaire Data de l’ENS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240514T104500
DTEND;TZID=Europe/Paris:20240514T114500
DTSTAMP:20260524T090743
CREATED:20241014T131001Z
LAST-MODIFIED:20241014T131110Z
UID:18229-1715683500-1715687100@www.math.ens.psl.eu
SUMMARY:Well-posedness of conservation laws
DESCRIPTION:
URL:https://www.math.ens.psl.eu/evenement/well-posedness-of-conservation-laws/
LOCATION:DMA – Salle R3\, 45 rue d'Ulm\, Paris\, 75005\, France
CATEGORIES:Séminaire interne de l'équipe d'analyse
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240527T110000
DTEND;TZID=Europe/Paris:20240527T120000
DTSTAMP:20260524T090743
CREATED:20231120T122454Z
LAST-MODIFIED:20240522T095008Z
UID:17010-1716807600-1716811200@www.math.ens.psl.eu
SUMMARY:Antoine Mouzard: Mesures de Gibbs et quantification stochastique
DESCRIPTION:
URL:https://www.math.ens.psl.eu/evenement/antoine-mouzard-titre-a-preciser/
LOCATION:DMA Salle W
CATEGORIES:Probabilités et statistiques,Séminaire informel de probabilités
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240528T093000
DTEND;TZID=Europe/Paris:20240528T123000
DTSTAMP:20260524T090743
CREATED:20230830T101601Z
LAST-MODIFIED:20240313T134725Z
UID:16737-1716888600-1716899400@www.math.ens.psl.eu
SUMMARY:CANCELED - Pierre-Emannuel Jabin - CANCELED
DESCRIPTION:
URL:https://www.math.ens.psl.eu/evenement/pierre-emannuel-jabin/
LOCATION:ENS – salle W\, 45 rue d'Ulm\, Paris\, 75005\, France
CATEGORIES:Séminaire Analyse non linéaire et EDP
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240529T140000
DTEND;TZID=Europe/Paris:20240529T170000
DTSTAMP:20260524T090743
CREATED:20240513T160313Z
LAST-MODIFIED:20240513T160739Z
UID:17450-1716991200-1717002000@www.math.ens.psl.eu
SUMMARY:Group theory seminar Tiozzo/Freslon/Bordenave
DESCRIPTION:An afternoon on random walks on groups. \n14.00 – 14.45   Giulio Tiozzo (Toronto) « Roots of Alexander polynomials of random positive braids »;   \n15.00 – 15.45   Amaury Freslon (Orsay)  « How to (badly) shuffle cards? »; \n16.15 – 17.00   Charles Bordenave (Marseille) « Strong convergence of matrix algebras and applications to random walks ». \n  \nGiulio Tiozzo  « Roots of Alexander polynomials of random positive braids » \nAs originally observed experimentally by Dehornoy\, roots of Alexander polynomials of random knots display interesting patterns. In this work\, joint with N. Dunfield\, we prove several results on the distribution of such roots in the complex plane\, and discuss further conjectures that originate from them.  \nUsing the Burau representation\, this corresponds to studying random walks on the group SL(2\, C[t]) of 2-by-2 matrices with polynomial coefficients. We compute a sharp lower bound on the probability that such roots lie on the unit circle\, and prove a related central limit theorem. We also show there is a large root-free region near the origin.We introduce the notion of a Lyapunov exponent for the Burau representation\, in the spirit of Deroin-Dujardin\, and a corresponding bifurcation measure\, which we prove to be the limiting measure for the distribution of roots on a region of parameter space. \n  \nAmaury Freslon « How to (badly) shuffle cards? » \nCard shuffling can be modelled by random walks on permutation groups\, and the first example which was studied in depth is the one given by random transpositions. In that case\, Diaconis and Shahshahani proved that the corresponding Markov chain exhibits a so-called cut-off phenomenon. Moreover\, Teyssier recently computed the corresponding cut-off profile\, which is remarkably simple. I will explain how one can similarly define a random walk on the « quantum permutation groups »\, a Hopf algebra which somehow contains the usual permutation groups. I will then report on a joint work with Teyssier and Wang where we prove the cut-off phenomenon for that process and compute the cut-off profile. \n  \nCharles Bordenave « Strong convergence of matrix algebras and applications to random walks » \nWe  will present results on the convergence of the operator norm of random matrices of large dimension. Our random matrices are build by taking tensor products of deterministic matrices and independent Haar distributed unitary matrices or independent random permutation matrices. This class of random matrices allows for example to consider random Schreier graphs of the modular group or of Cartesian products of free groups. We will explain how these convergence results can be used to prove sharp mixing time estimates on random walks.  The talk will be notably based on joint works with Benoit Collins and Hubert Lacoin. \nOrganized by Andrei Alpeev\, Laurent Bartholdi\, Anna Erschler and Panagiotis Tselekidis. \nPartially supported by ERC Advanced Grant 101097307 (P.I.:Laurent Bartholdi).
URL:https://www.math.ens.psl.eu/evenement/group-theory-seminar-tiozzo-freslon-bordenave/
LOCATION:14:00-17:00 Salle W
CATEGORIES:Séminaire de théorie des groupes à l’ENS
END:VEVENT
END:VCALENDAR