BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv4.9.13//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Eurandom
X-ORIGINAL-URL:https://www.eurandom.tue.nl
X-WR-CALDESC:Events for Eurandom
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20200406
DTEND;VALUE=DATE:20200410
DTSTAMP:20200119T210034
CREATED:20190613T065326Z
LAST-MODIFIED:20200106T125229Z
UID:2733-1586131200-1586476799@www.eurandom.tue.nl
SUMMARY:Graph Limits
DESCRIPTION:Summary\nThe workshop will address both the basic theory and the applications of graph limits\, focusing on graphons and graphexes\, as well as various applications. In the last few years several beautiful and exciting developments have taken place in this area. It is therefore time to bring together researchers from different fields\, including probability theory\, combinatorics\, statistics and algorithmics. \nThe workshop will run from Monday morning 09.00 am till Thursday afternoon 17.00 pm \nSponsors\n \nOrganisers\n\n\n\nChristian Borgs\nUniversity of Berkeley\, California\n\n\nJennifer Chayes\nUniversity of Berkeley\, California\n\n\nSouvik Dhara\nMIT Mathematics and Microsoft Research\n\n\nRemco van der Hofstad\nNETWORKS (TU Eindhoven)\n\n\nFrank den Hollander\nNETWORKS (Leiden University)\n\n\nViresh Patel\nNETWORKS (University of Amsterdam)\n\n\n\nSpeakers\n\n\n\nSiva Athreya\nIndian Statistical Institute\, Bangalore\n\n\nMorgane Austern\nMicrosoft Research\n\n\nAgnes Backhausz\nEötvös Loránd University\n\n\nSourav Chatterjee\nStanford University\n\n\nPéter Csikvári\nEötvös Loránd University\n\n\nJan Hladky\nCzech Academy of Sciences\n\n\nOlga Klopp\nCNRS\n\n\nDaniel Kral\nMasaryk University and University of Warwick\n\n\nJoonkyung Lee\nUniversität Hamburg\n\n\nLászló Lovász\nEötvös Loránd University\n\n\nLászló Miklós Lovász\nMassachusetts Institute of Technology\n\n\nAsaf Nachmias\nTel Aviv University\n\n\nSofia Olhede\nUniversity College London\n\n\nKavita Ramanan\nBrown University\n\n\nAdrian Roellin\nNational University of Singapore\n\n\nSubhabrata Sen\nHarvard University\n\n\nJoel Spencer\nNew York University\n\n\nKatalin Vesztergombi\nEötvös Loránd University\n\n\nMei Yin\nDenver University\n\n\nChristina Lee Yu\nCornell University\n\n\nIlias Zadik\nNew York University\n\n\n\nAbstracts\nDaniel Kral \nUniqueness of combinatorial limits\nWe will present several results concerning combinatorial structures that are determined by finitely many density constraints. First\, we will show that such graph limits can have arbitrarily complex structure in a strong sense. We use this result to provide a counterexample to a conjecture of Lovasz that optimal solutions to extremal graph theory problems can be made asymptotically unique by introducing finitely many additional constraints.\nAt the end of the talk\, we focus on limits corresponding to quasirandom combinatorial structures. For graphs\, it is well-known that quasirandomness is characterized by the edge density and the density of C_4. An analogous result holds for permutation: a permutation is quasirandom if and only if the density of every 4-pattern is 1/24+o(1). We strengthen the results by showing that a permutation is quasirandom if and only if the sum of the densities of eight specific 4-patterns is 1/3+o(1)\, and we characterize all sets of 4-patterns with this property.\n(joint with T. Chan\, J. Cooper\, A. Grzesik\, L. M. Lovasz\, T. Martins\, J. Noel\, Y. Pehova\, M. Sharifzadeh\, J. Sosnovec and J. Volec) \nMore information will follow as it becomes available. \nRegistration\nLink to registration form \n \n
URL:https://www.eurandom.tue.nl/event/graph-limits/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
CATEGORIES:Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20200511
DTEND;VALUE=DATE:20200516
DTSTAMP:20200119T210034
CREATED:20191120T104820Z
LAST-MODIFIED:20200115T125646Z
UID:3210-1589155200-1589587199@www.eurandom.tue.nl
SUMMARY:Workshop YEP XVII: "Interacting Particle Systems"
DESCRIPTION:Summary\nThe theory of Interacting Particle Systems focuses on the dynamics of systems consisting of a large or infinite number of entities\, in which the mechanism of evolution is random and follows simple\, local rules.\nThe topic had its beginnings in the 70s and 80s\, motivated by Statistical Physics and fundamental problems from Probability Theory. It has since developed into a fruitful source of interesting mathematical questions and a very successful framework to model emerging collective complex behavior for systems in a variety of fields\, including Biology\, Economics and Social Sciences.\nThe field is sufficiently diverse that there are sub- communities that approach it from very different perspectives. We have identified three broad lines of interest –duality\, scaling limits and invariant measures– and have used these to guide selection of speakers. Our goal is to provide an occasion for exchange of experiences and perspectives for young researchers in an immersive week. \nSponsors\n \nOrganizers\n\n\n\nConrado da Costa\nDurham University\n\n\nRichard Kraaij\nTU Delft\n\n\nFederico Sau\nIST Austria\, Klosterneuburg\n\n\nDaniel Valesin\nGroningen University\n\n\n\n\n\n\nScientific Advisor\n\n\n\nRemco van der Hofstad\nTU Eindhoven\n\n\n\nSpeakers\nMini-courses \n\n\n\nPatricia Gonçalves\nIST Lisbon\n\n\nJan Swart\nCzech Academy of Science\n\n\nCristina Toninelli\nParis Dauphine\n\n\n\nOverview Lectures \n\n\n\nPablo Ferrari\nUBA Buenos Aires\n\n\nFrank Redig\nTU Delft\n\n\n\nInvited Talks \n\n\n\nMarton Balazs\nBristol University\n\n\nOriane Blondel\nUniversité Lyon 1\n\n\nPeter Mörters\nBath University\n\n\nTom Mountford\nEPFL\n\n\nEllen Saada\nParis Descartes\n\n\nAlexandre Stauffer\nUniversità Roma Tre\n\n\n\nShort Talks \nt.b.a. \nProgramme\nLink to preliminary programme \n \nAbstracts\nt.b.a. \nRegistration\nLINK to the online registration form \nPractical Information\nLink to more practical information \n \n \n
URL:https://www.eurandom.tue.nl/event/workshop-yep-xvii-interacting-particle-systems/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
CATEGORIES:Workshop,YEP
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20200525
DTEND;VALUE=DATE:20200530
DTSTAMP:20200119T210034
CREATED:20200102T120029Z
LAST-MODIFIED:20200115T142051Z
UID:3290-1590364800-1590796799@www.eurandom.tue.nl
SUMMARY:Safe\, Anytime-Valid Inference (SAVI)
DESCRIPTION:Summary\nA large fraction of published research in top journals in applied sciences such as medicine and psychology has been claimed as irreproducable. In light of this 'replicability crisis'\, traditional methods for hypothesis testing\, most notably those based on p-values\, have come under intense scrutiny. One central problem is the following: if our test result is promising but non-conclusive (say\, p = 0.07) we cannot simply decide to gather a few more data points. While this practice is ubiquitous in science\, it invalidates p-values and error guarantees and makes the results of standard meta-analyses very hard to interpret. This issue is not unique for p-values: other approaches\, such as replacing testing by estimation with confidence intervals\, suffer from similar optional continuation problems. Over the last few years several distinct but closely related solutions have been proposed\, such as anytime-valid confidence sequences\, anytime-valid p-values\, and safe tests. \nRemarkably\, all these approaches can be understood in terms of (sequential) gambling. One formulates a gambling strategy under which one would not expect to gain any money if the null hypothesis were true. If for the given data one would have won a large amount of money in this game\, this provides evidence against the null hypothesis. The test statistic in traditional statistics gets replaced by the gambling strategy; the p-value gets replaced by the (virtual) amount of money gained. In more mathematical terms\, evidence against the null and confidence sets are derived in terms of non-negative supermartingales. While this idea in essence goes back to Wald’s sequential testing of the 1950's and its extensions by Robbins and co in the early 1960's and Lai in the 1970's\, it never really caught on because it used to be applicable only to very simple statistical models and testing scenarios. \nHowever\, recent work shows that this idea is essentially universally applicable – one can design supermartingales for large classes of tests\, both parametric and non-parametric\, and many estimation problems\, yielding anytime P-values using non-asymptotic versions of the law of the iterated logarithm. A variation of the idea\, the S-value\, can even be applied to completely arbitrary tests - at the price of only allowing for a weaker form of optional stopping. All these techniques have both a gambling and a Bayes factor interpretation. Thus\, these directions are able to somewhat unite Bayesian and frequentest ways of thinking; with the explicit ability to use prior knowledge\, with frequentest error control and confidence bounds\, but often using Bayesian techniques. \nThis workshop aims to get together two groups of researchers --- those who have been developing the mathematical\, probabilistic and statistical foundations of this area\, and practitioners who have studied and written about the reproducibility crisis in the sciences. \nThis conference supports the Welcoming Environment Statement of the Association for Women in Mathematics (AWM). \nSponsors\n \n \n \nOrganisers\n\n\n\nPeter Grünwald\nCWI\, Amsterdam\n\n\n\nAaditya Ramdas\nCarnegie Mellon University\n\n\n\n\n\n\n\n\n\n \nSpeakers\n\n\n\nAkshay Balsubramani\nStanford University\nGenetics\, Computer Science\n\n\nLeonhard Held\nUniversity of Zurich\nBiostatistics \n\n\nChris Jennison\nUniversity of Bath\nStatistics\n\n\nWouter Koolen\nCWI\, Amsterdam\nPsychology\, Computer Science\n\n\nDaniel Lakens\nTU Eindhoven\nHuman-Technology Interaction\n\n\nTheis Lange\nUniversity of Copenhagen\nBiostatistics\n\n\nAlexander Ly\nUniversity of Amsterdam and CWI\nPsychology\, Computer Science\n\n\nAlan Malek\nOptimizely\nStatistics\n\n\nDeborah Mayo\nVirginia Tech\nPhilosophy\n\n\nLuigi Pace\nUniversity of Udine\nEconomics\, Statistics\n\n\nLeonid Pekelis\nOpendoor\nStatistics\n\n\nChristian Robert\nUniversité Paris-Dauphine + Warwick University\nStatistics\n\n\nAlessandra Salvan\nUniversity of Padova\nStatistics\n\n\nGlenn Schafer\nRutgers University\nStatistics\n\n\nMark Simmonds\nUniversity of York\nReview and Dissemination\n\n\nVladimir Vovk\nRoyal Holloway London\nComputer Science\n\n\nEric-Jan Wagenmakers\nUniversity of Amsterdam\nPsychology\n\n\nRuodo Wang\nUniversity of Waterloo\nStatistics\, Actuarial Science\n\n\nLarry Wasserman\nCarnegie Mellon University\nStatistics\, ML\n\n\n\nProgramme\nWill follow soon \nAbstracts\nWill follow soon \nRegistration\nLink to online registration form: REGISTRATION \nPractical Information\nLink to travel and accommodation information \n
URL:https://www.eurandom.tue.nl/event/safe-anytime-valid-inference-savi/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
END:VEVENT
END:VCALENDAR