## Events Search and Views Navigation

## June 2021

### Eindhoven Stochastic Seminar

Ahmad Abdi (LSE) Ideal matrices and dyadic linear programming A 0,1 matrix M is ideal if the set cover inequalities Mx>=1, together with nonnegativity constraints x>=0, define a polyhedron where every vertex is integral. The study of ideal matrices was initiated in the 1960s by Alfred Lehman and Ray Fulkerson, and continues to this day due to their intimate connections to Integer Programming, Combinatorial Optimization, and Graph Theory. Despite having being studied for about 60 years, several basic questions about…

Find out more »### YEQT XIV: "Load balancing and scheduling for distributed service systems"

Summary Distributed service systems are ubiquitous, from server farms for cloud computing and charging stations for electric vehicles, to checkout lines at supermarkets and ICU beds in hospitals. The size of many of these systems has exploded over the past few years, which has created new challenges in the design of control policies. These new challenges, such as scalability, data locality, and server and task heterogeneity, have fueled a renewed interest in the study of these systems, and accelerated the…

Find out more »### Eindhoven Stochastic Seminar

Alessandra Cipriani (TUDelft) The discrete membrane model on trees The discrete membrane model (MM) is a random interface model for separating surfaces that tend to preserve curvature. It is a close relative of the discrete Gaussian free field (DGFF), for which instead the most likely interfaces are those preserving the mean height. However working with the two models presents some key differences. In particular, a lot of tools (electrical networks, random walk representation of the covariance) are available for the…

Find out more »### Eindhoven SPOR Seminar

Tim van Erven (UvA) Highlights of Online Machine Learning Online machine learning algorithms process data sequentially, either because the data are inherently sequential or because the whole data set is too large to load into memory all at once (e.g. when training neural networks). I will introduce the formal setting and present several highlights of classical and recent progress in this area.

Find out more »## August 2021

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

Format The workshop will take place in the week Aug 30 - Sep 3, 2021. The event will be online. 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…

Find out more »## September 2021

### Eindhoven SPOR Seminar

Matteo D’Achille (Université Paris-Est Créteil) One dimensional Euclidean Random Assignment Problems: anomalous scaling and critical hyperbolae A Euclidean Random Assignment Problem (ERAP in short) is defined as follows. Take two $n$-samples $\mathcal{B} =(b_i)_{i=1}^n$ (blue points) and $\mathcal{R}=(r_j)_{j=1}^n$ (red points) of i.i.d. random variables valued on a metric space $(\Omega,D)$ of dimension $d$ according to a prob. measure $\vu$ (called disorder). For a permutation $\pi : \mathcal{B} \rightarrow \mathcal{R}$, let $\mathcal{H}(\pi)=\sum_{i=1}^n D(b_i,r_{\pi(i)})^p$ be a Hamiltonian depending on the energy-distance exponent $p\in…

Find out more »## October 2021

### Eindhoven SPOR Seminar (hybrid)

Noela Müller (TU/e) Introduction & sparse random matrices In this talk, I will introduce myself and give an overview of my research interests. The second half is dedicated to ongoing work on a full rank condition for sparse random matrices: For a broad range of sparse random matrix models, we provide a sufficient condition on the parameters for the resulting matrix to be of full (row) rank w.h.p. This criterion generalises a number of prior results. In particular, it supplies…

Find out more »### Workshop "Road Traffic Flow: Analysis, Optimization and Control"

Summary Road Traffic Flow - Analysis, Optimization and Control Transportation 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…

Find out more »## November 2021

### Eindhoven SPOR Seminar

Matthias Mnich (TUHH) Mean-Payoff Games: A Powerful Tool between Mathematics and Computer Science, between Theory and Applications Mean-payoff games are a powerful tool for modeling the verification process of large pieces of software, like those developed for performing experiments at the Large Hadron Collider, the world's largest and highest-energy particle collider at CERN. From a theory perspective, mean-payoff games are two player deterministic zero-sum games with full information that were introduced by Ehrenfeucht and Mycielski 1979. The determination of winning…

Find out more »## December 2021

### Eindhoven SPOR Seminar

Botond Szabo (Bocconi University) On distributed estimation and testing In recent years, the amount of available information has become so vast in certain fields of applications that it is infeasible or undesirable to carry out all the computations on a single server. This has motivated the design and study of distributed statistical or learning approaches. In distributed methods, the data is split amongst different administrative units and computations are carried out locally in parallel to each other. The outcome of…

Find out more »