Corli van Zyl (North-West University, Potchefstroom, South Africa) Signed sequential rank cumulative sum charts CUSUMs based on the signed sequential ranks of observations are developed for detecting location and scale changes in symmetric distributions. The CUSUMs are distribution-free and fully self-starting: given a specified in-control median and nominal in-control average…

Joost Jorritsma (Eindhoven University of Technology) Typical weighted distance in preferential attachment models - Interpolating small and mini worlds Information diffusion in networks can be modeled by first passage percolation, which can also be seen as an SI (susceptible - infected) model. In this talk I will discuss the model…

Gianmarco Bet (University of Florence) Weighted Dyck paths for non stationary queues We consider a model for a transitory queue in which only a fixed number $N$ of customers can join. Each customer joins the queue independently of the other ones at a random time, which we assume to be exponentially…

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…

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…

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

Kathrin Möllenhoff

"Assessing the Similarity of Drug Dissolution Profiles"
Equivalence analyses are a frequently addressed problem during drug development.

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…

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…

Guillem Perarnau Extremal stationary values for directed random graphs In this talk, we will discuss the minimum positive value of the stationary distribution of a random walk on a directed random graph with given (bounded) degrees. While for undirected graphs the stationary distribution is simply determined by the degrees, the…