BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv5.8.1//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:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20210830
DTEND;VALUE=DATE:20210904
DTSTAMP:20210805T231359
CREATED:20191120T104820Z
LAST-MODIFIED:20210519T072043Z
UID:3210-1630281600-1630713599@www.eurandom.tue.nl
SUMMARY:Workshop YEP XVII: "Interacting Particle Systems"
DESCRIPTION:Format\nThe workshop will take place in the week Aug 30 - Sep 3\, 2021. \nThe event will be online. \nSummary\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\nUniversité de Paris\n\n\nAlexandre Stauffer\nUniversità Roma Tre\n\n\n\nShort Talks \n\n\n\nLuisa Andreis\nUniversità degli Studi di Firenze\n\n\nLeandro Chiarini\nIMPA/Utrecht University\n\n\nSimone Floreani\nTU Delft\n\n\nChiara Franceschini\nIST Lisbon\n\n\nBart van Ginkel\nTU Delft\n\n\nJessica Jay\nUniversity of Bristol\n\n\nShubamoy Nandam\nLeiden University\n\n\nAssaf Shapira\nRoma Tre University\n\n\nRéka Szabó\nUniversité Paris Dauphine\n\n\nSiamak Taati\nAmerican University of Beirut\n\n\nMario Ayala Valenzuela\n\n\n\nClare Wallace\nUniversity of Durham\n\n\n\nProgramme\nT.b.a. \nPoster session\nFor participants\, who would like to present a poster\, we will organize a poster session. \nIf you are interested\, please send title and abstract of your poster to koorn@eurandom.tue.nl. Deadline for submission is July 31st. \nThe organizers will review the entries and decide which posters will be accepted for the session. \n \nAbstracts\nMarton Balazs \nQueues\, stationarity\, and stabilisation of last passage percolation\nTake a point x on the 2-dimensional integer lattice and another one y North-East from the first. Place i.i.d. Exponential weights on the vertices of the lattice; the last passage time between the two points is the maximal sum of these weights which can be collected by a path that takes North and East steps. The process of these weights as y varies is a difficult one\, but locally has a nice asymptotic structure. I'll explain what stationary queues have to do with this and how this insight gives coalescence properties of the maximal-weight paths of last passage.\n(joint work with Ofer Busani and Timo Seppäläinen) \n \nChiara Franceschini \n(q-)Orthogonal dualities for (a-)symmetric particle systems\nIn this talk I will show a technique to find duality for those particle systems for which have a reversible measure on $\mathbb{Z}$ and allow an algebraic description. \nThis work for symmetric and asymmetric processes and relies of the algebraic description of the model. To be concrete I will do the comparison between a simple symmetric exclusion process and its asymmetric version. \nThe analysis will lead to a family of Krawtchouk polynomials in the symmetric case and their q-analogues in the asymmetric case. \n \nPeter Mörters \nPercolation phase transition in weight-dependent random connection models\nWe investigate spatial random graphs defined on the points of a Poisson process in d-dimensional space\, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the weight and position of the points\, we form an edge between any pair of points independently with a probability depending on the two weights of the points and their distance. Preference is given to short edges and connections to vertices with large weights. We characterize the parameter regime where there is a nontrivial percolation phase transition and show that it depends not only on the power-law exponent of the degree distribution but also on a geometric model parameter. Based on joint work with Peter Gracar and Lukas Lüchtrath. \n \nTom Mountford \nThe Invariance principle for Recurrent Markov Cookie Random walks\nWe show that in the recurrent case\, when diffusively rescaled\, the Markov cookie process converges in law to a Brownian motion perturbed at extremities. The key idea is to consider a coarse graining of the process and to appeal to ray Knight theorems.\n(joint work with E. Kosygina and J. Peterson) \n \nAssaf Shapira \nDiffusive scaling of the Kob-Andersen model \nThe Kob-Andersen model is an interacting particle system on the lattice\, in which sites can contain at most one particle. Each particle is allowed to jump to an empty neighboring site only if there are sufficiently many empty sites in its neighborhood. This way\, when the density is very high\, the time it takes for the system to evolve is very long. We will see that the system still scales diffusively\, but with a coefficient which decays extremely fast as the density increases. \n \nSiamak Taati \nPositive-rate interacting particle systems with Bernoulli invariant measures\nEvery positive-rate finite-range interacting particle system (in discrete/continuous time) that has a Bernoulli invariant measure is ergodic. The proof is via the entropy method\, but unlike the usual entropy arguments\, does not require shift-invariance of the starting measure. Two new (?) ingredients are a sharp bound on the entropy increase and a "bootstrap" argument. As an application\, this result imposes a sever limitation on the computation power of reversible cellular automata in presence of noise.\n(joint work Irène Marcovici) \n \n \nRegistration\nLink to registration \n \n
URL:https://www.eurandom.tue.nl/event/workshop-yep-xvii-interacting-particle-systems/
LOCATION:Online (Zoom)
CATEGORIES:Workshop,YEP
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20211021
DTEND;VALUE=DATE:20211023
DTSTAMP:20210805T231359
CREATED:20210609T085222Z
LAST-MODIFIED:20210719T071149Z
UID:4074-1634774400-1634947199@www.eurandom.tue.nl
SUMMARY:Workshop "Road Traffic Flow: Analysis\, Optimization and Control"
DESCRIPTION:Summary\nRoad Traffic Flow - Analysis\, Optimization and Control \nTransportation plays a pivotal role in a society's economic and social welfare. Overly congested road traffic networks account for several billions of euros in cost\, in the Netherlands alone. Since congestion itself can have many different causes (e.g.\, too much traffic\, accidents\, and bad network design)\, it is an inherently interesting and important topic for multiple scientific research areas\, ranging from social sciences to civil engineering\, mathematics and physics. Each area focuses on their favorite topics and yields interesting and important insights that lead to effective measures to control traffic flows and optimize transportation network performance. \nTo encourage interaction and collaboration between road-traffic researchers\, we are hosting an engaging two-day workshop entitled "Road Traffic Flow: Analysis\, Optimization\, and Control" at the workshop institute Eurandom at Eindhoven University of Technology on October 21st and 22nd. The main goal of this workshop is to stimulate the cross-disciplinary collaboration between scientific areas that focus on similar problems\, like civil engineering and operations research\, which can lead to a synergy that is beneficial for all road traffic research. \nThe presentations during the workshop will mostly be given by researchers from the Netherlands\, ranging from PhD students to full professors\, supplemented with keynote and tutorial presentations from internationally renowned scientists. \nFormat\nWith more and more Covid-related restrictions in the Netherlands being eased or abandoned\, we expect that the workshop can take place physically at Eurandom in October and that we can all meet one another in person. Therefore\, we aim for such a fully on-campus event. In the case that governmental measures and/or measures from the TU/e that are in place by that time do not allow for such an event\, the workshop format will either be changed to a hybrid or a fully online event. We will of course keep you up-to-date on those matters and relevant changes in the format. \nSponsors\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nOrganizers\n\n\n\nMarko Boon\nTU Eindhoven\n\n\nSindo Núñez Quijea\nUniversity of Amsterdam\n\n\nJan-Kees van Ommeren\nUniversity of Twente\n\n\nJaap Storm\nTU Eindhoven\n\n\nRik Timmerman\nTU Eindhoven\n\n\n\nSpeakers\nKeynote Speakers: \n\n\n\nCarolina Osorio\nHEC Montreal\n\n\nEddie Wilson\nUniversity of Bristol\n\n\n\nTutorial Speaker \n\n\n\nPeter Wagner\nDLR (Deutsches Zentrum für Luft- und Raumfahrt)\n\n\n\nInvited speakers (confirmed) \n\n\n\nSimeon Calvert\nDelft University of Technology\n\n\nSaif Jaibari\nNYU Abu Dhabi\n\n\nRens Kamphuis\nUniversity of Amsterdam\n\n\nVictor Knoop\nDelft University of Technology\n\n\nNikki Levering\nUniversity of Amsterdam\n\n\nMichel Mandjes\nUniversity of Amsterdam\n\n\nAnna Oblakova\nUniversity of Twente\n\n\nMaaike Snelder\nDelft University of Technology\n\n\nErik Verhoef\nVrije Universiteit Amsterdam\n\n\n\nProgramme\n(Tentative)\nThursday October 21 Friday October 22 \n\n\n\n10.00 - 10.30\nWelcome and Opening\n09.00 - 09.45\nTutorial 2\n\n\n10.30 - 11.15\nTutorial 1\n09.45 - 10.15\nBreak\n\n\n11.15 - 11.30\nBreak\n10.15 - 10.45\nTalk 6\n\n\n11.30 - 12.00\nTalk 1\n10.45 - 11.15\nTalk 7\n\n\n12.00 - 12.30\nTalk 2\n11.15 - 11.45\nBreak\n\n\n12.30 - 13.30\nLunch\n11.45 - 12.15\nTalk 8\n\n\n13.30 - 14.00\nTalk 3\n12.15 - 13.15\nLunch\n\n\n14.00 - 14.30\nTalk 4\n13.15 - 13.45\nTalk 9\n\n\n14.30 - 15.00\nBreak\n13.45 - 14.15\nTalk 10\n\n\n15.00 - 15.45\nKeynote 1\n14.15 - 14.45\nBreak\n\n\n15.45 - 16.15\nBreak\n14.45 - 15.30\nKeynote 2\n\n\n16.15 - 16.45\nTalk 5\n15.30 -\nFarewell & Drinks\n\n\n18.00 -\nConference Dinner\n \n \n\n\n\nAbstracts\nWill follow soon.\nRegistration\nRegistration is free\, but compulsory. Please follow this link \n \n
URL:https://www.eurandom.tue.nl/event/workshop-road-traffic-flow-analysis-optimization-and-control/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
CATEGORIES:Workshop,YEQT
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20211213
DTEND;VALUE=DATE:20211218
DTSTAMP:20210805T231359
CREATED:20200102T120029Z
LAST-MODIFIED:20210602T121038Z
UID:3290-1639353600-1639785599@www.eurandom.tue.nl
SUMMARY:Workshop: "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\, Reproducibility\n\n\nChris Jennison\nUniversity of Bath\nStatistics\n\n\nWouter Koolen\nCWI\, Amsterdam\nComputer Science (ML)\n\n\nDaniel Lakens\nTU Eindhoven\nHuman-Technology Interaction\, Reproducibility\n\n\nTheis Lange\nUniversity of Copenhagen\nBiostatistics\, Reproducibility\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\nDon van Ravenzwaaij\nGroningen University\n Psychologym Statistics\n\n\nChristian Robert\nUniversité Paris-Dauphine + Warwick University\nStatistics\n\n\nAlessandra Salvan\nUniversity of Padova\nStatistics\n\n\nGlenn Shafer\nRutgers University\nFoundations of Probability and Statistics\n\n\nMark Simmonds\nUniversity of York\nReview and Dissemination\n\n\nAnne Lyngholm Sørensen\nUniversity of Copenhagen\n Statistics\n\n\nVladimir Vovk\nRoyal Holloway London\nComputer Science (ML)\, Statistics\n\n\nEric-Jan Wagenmakers\nUniversity of Amsterdam\nPsychology\n\n\nRuodu Wang\nUniversity of Waterloo\nStatistics\, Actuarial Science\n\n\nLarry Wasserman\nCarnegie Mellon University\nStatistics\, ML\n\n\n\nProgramme\nWill follow \nAbstracts\nWill follow \n \n\nPractical Information\nLink to travel and accommodation information
URL:https://www.eurandom.tue.nl/event/safe-anytime-valid-inference-savi/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20220919
DTEND;VALUE=DATE:20221001
DTSTAMP:20210805T231359
CREATED:20210623T074556Z
LAST-MODIFIED:20210623T074804Z
UID:4126-1663545600-1664582399@www.eurandom.tue.nl
SUMMARY:Workshop "Graph Limits\, Non-Parametric Models and Estimation"
DESCRIPTION:Summary\nGraph limits and graphons emerged as a subfield of graph theory about 15 years ago\, and immediately spurred wide interest due to the connections with statistical physics\, extremal combinatorics\, and non-parametric statistical analysis on networks. While inspired by applications to real-world networks such as the World-Wide Web\, the original theory did not apply to many of these networks\, since the theory dealt with dense graphs while real-world networks tend to be sparser. Several ideas for sparse graph limits\, and the extent of their applicability\, have since been proposed and studied. This workshop aims to bring together researchers from around the world\, working on both theoretical and applied aspects of graph limit theory\, coming from fields as diverse as probability theory\, statistics\, combinatorics\, and computer science. The topics will cover extensions of graphon theory\, as well as fundamentally different concepts such as local-weak convergence. The applications will include large deviations of random graphs\, non-parametric graphon estimation\, and differential privacy. \nFormat\nThis workshop is organized in collaboration with Simons Institute\, Berkeley. The event will take place at Berkeley\, University of California. \nSponsors\n \n \nOrganizers\n\n\n\nChristian Borgs\nUC Berkeley\n\n\nSouvik Dhara\nMassachusetts Institute of Technology\n\n\nLászló Lovász\nEötvös Loránd University\n\n\nSofia Olhede\nUniversity College London\n\n\nRemco van der Hofstad\nEindhoven University of Technology\n\n\n\nSpeakers\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nProgramme\nt.b.a. \nAbstracts\nt.b.a. \nRegistraton\nRegistration is required to attend this workshop. Space may be limited\, and you are advised to register early. The link to the registration form will appear on this page approximately 10 weeks before the boot camp. To submit your name for consideration\, please register and await confirmation of your acceptance before booking your travel.
URL:https://www.eurandom.tue.nl/event/workshop-graph-limits-non-parametric-models-and-estimation/
CATEGORIES:Workshop
END:VEVENT
END:VCALENDAR