## May 2020

### CANCELLED: Workshop YEP XVII: "Interacting Particle Systems"

Summary The 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. The 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…

Find out more »### CANCELLED: Safe, Anytime-Valid Inference (SAVI)

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

Find out more »## September 2020

### Eindhoven SPOR seminar

Elisa Perrone (TU/e) Geometric structure in dependence models and applications. Abstract: The growing availability of data makes it challenging yet crucial to model complex dependence traits. For example, hydrological and financial data typically display tail dependences, non-exchangeability, or stochastic monotonicity. Copula functions serve as mathematical tools for capturing these complex traits and constructing accurate dependence models that resemble the underlying distributions of data. This talk explores the geometric properties of copulas to address dependence modeling challenges in applications. In particular,…

Find out more »### Eindhoven SPOR Seminar

Zsolt Bartha Replica Symmetry Breaking in the Random Regular k-NAE-SAT Problem Abstract: For several models of random constraint satisfaction problems, it was conjectured by physicists and later proved that a sharp satisfiability transition occurs. For random k-SAT and related models it happens at constraint density alpha ~ 2^k. Just below the threshold, further results suggest that the solution space has a “one-step replica symmetry breaking” (1RSB) structure of a large bounded number of near-orthogonal clusters inside {0,1}^N. In the unsatisfiable…

Find out more »### Eindhoven SPOR Seminar

Laura Sanità On the hardness of computing the diameter of a polytope The diameter of a polytope P is the maximum length of a shortest path between a pair of vertices on the 1-skeleton of P , which is the graph where the vertices correspond to the 0-dimensional faces of P, and the edges are given by the 1-dimensional faces of P. Despite decades of studies, it is still not known whether the diameter of a d-dimensional polytope with n…

Find out more »## October 2020

### Eindhoven SPOR Seminar

Wouter de Vries (KPN) Artificial intelligent processes for people About 75 years after the first prudent attempts to capture artificial intelligence in conceptual models, the field is now an exuberant and flourishing domain. Many ingenious applications find their way to consumers and businesses, as well as the telecommunications sector. The first part of this lecture gives an overview of applications of artificial intelligence and machine learning in the customer processes at KPN, e.g. personalized offerings (next best action), cognitive…

Find out more »### Eindhoven SPOR Seminar

Bart Smeulders

Optimizing in and for Collaborative Kidney Exchanges

Kidney exchanges are one way of helping patients who require a kidney transplant and have a willing, but incompatible, donor.

Find out more »### Eindhoven SPOR Seminar

Kathrin Möllenhoff

"Assessing the Similarity of Drug Dissolution Profiles"

Equivalence analyses are a frequently addressed problem during drug development.

## November 2020

### Eindhoven SPOR Seminar

Suman Chakraborty (TU/e) k-core in random subgraphs of dense graphs k-core is the maximal subgraph of vertices with degree at least k in the subgraph. These subgraphs not only have interesting structures, they have also turned out to be important in other areas of studies as well. For example, they arose in the study of chromatic number of sparse random graphs, and graph mining problems in computer science. In this talk we will discuss the size of the k-core in random subgraphs…

Find out more »### Eindhoven SPOR Seminar

Jaap Storm (TU/e) Introduction and Research Overview Kinematic wave models have been used since the 1960’s to describe traffic flows on networks as a fluid. This approach has been fruitful, but does not take into account one important aspect, namely, that traffic dynamics are stochastic. The intuition for this is that traffic flows are influenced by both physical laws, and uncontrollable variables, e.g., human behavior, the weather, and differences between vehicles. In the talk, I will present (on a high…

Find out more »