Workshop: “Safe, Anytime-Valid Inference (SAVI) and Game-theoretic Statistics”

MF 11-12 (4th floor MetaForum Building, TU/e)

Summary A 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…

Eindhoven SPOR Seminar

Dirk Fahland (TU/e) New research challenges for statistics, probability theory, and optimization in process mining The field of Process Mining aims at getting insights into processes and organizations by building understandable models from event logs. The field originated from formal language theory, specifically Petri nets, an input event logs as…

Special Edition of the Queueing Colloquium

Eurandom Metaforum, 4th floor, Eindhoven, Netherlands

Summary On the occassion of the 60th birthday of Ivo Adan and Jacques Resing, we are organizing a special edition of the well-known Queueing Colloquium. Ivo and Jacques are prominent members of the Queueing community in The Netherlands and worldwide, the authors of the renowned lecture notes "Queueing Systems". Five…

Eindhoven SPOR Seminar

During this seminar, two postdocs will introduce themselves and their research to our cluster! The speakers are: Alex Mey Martin Frohn For upcoming events of the SPOR seminar, as well as a history of previous talks, see: https://www.eurandom.tue.nl/eindhoven-spor-seminar/.

Workshop: “Separating Integer Points in Polyhedra: Theory and Applications”

Eurandom Metaforum, 4th floor, Eindhoven, Netherlands

Summary Integral polyhedra are one of the central objects of integer programming, as they allow to solve combinatorial optimization problems by means of linear programming. Finding outer descriptions of integral polyhedra associated with discrete problems, however, is a challenging task and in many cases such descriptions are not known or exponentially large. To circumvent these…

Workshop: “Francesca Romana Nardi: A life in probability, building communities across Europe”

University of Florence, Aula Magna, Via S. Gallo 10, Florence, Italy

Summary Francesca passed away on October 21, 2021, in the midst of a vibrant life. Colleagues from all over Italy and Europe will gather in Florence to talk about mathematical topics that were very close to her heart. Francesca made ground-breaking contributions to the area of interacting particle systems, in…

Workshop and Summerschool on Random Graphs (RandNET)

MF 11-12 (4th floor MetaForum Building, TU/e)

Summary On August 22-30 2022 the RandNET Summer School and Workshop on Random Graphs takes place in Eindhoven, the Netherlands. The workshop will also function as the Kick-off event for the RandNET program. The main goal of this event is to facilitate new international collaborations between junior researchers. In the past two…

Optimal Transport, Statistics, Machine Learning and moving in between

Eurandom Metaforum, 4th floor, Eindhoven, Netherlands

Part of the YES workshop series Click here for the program: YES2022_program For the tutorial slides see the table below. Summary Theory and Computational Aspects In the last 30 years, the theory of Optimal Transport has emerged as a fertile field of inquiry, and a diverse tool for exploring applications…

Stochastic Models in Life Sciences – postponed to September 2023

Eurandom Metaforum, 4th floor, Eindhoven, Netherlands

Summary The aim of this three day bilateral conference is to discuss recent developments at the interface between probability theory and the life sciences. Probabilistic models are instrumental in the understanding and mathematical description of many biological processes. In this workshop we aim at highlighting three themes, corresponding to the…

Eindhoven SPOR Seminar

Rik Versendaal (UU) Sampling simple random graphs under degree and edge-weight constraints ABSTRACT: In , the problem was studied of sampling simple random graphs with degree constraints, which is typically a hard problem. Therefore, the authors proposed a sequential algorithm that samples such graphs asymptotically uniformly at random, when the…