The summer school is aimed to give an introduction to the theory and the most recent techniques and topics of additive combinatorics dedicated to graduate students and young researchers.
Noise-sensitivity of a function on the state space of a Markov chain means that the function decorrelates faster than the relaxation time of the entire system.
For a graph \(G=(V,E)\) with edge weight \(w:E\rightarrow \mathbb{R}^+\), a \(t\)-spanner is a spanning subgraph \(H\) such that for all pair of vertices \(u,v\in V\), we have \(d_H(u,v)\leq t\cdot d_G(u,v)\), where \(d_G(u,v)\) denotes the shortest path distance between vertices \(u\) and \(v\) in \(G\).
Every Tuesday at 10:00 in the Tondos room of the Rényi Institute.
In the Fall of 2023 the Erdős Center of the Rényi Institute organizes a special semester on Discrete Geometry and Convexity. In the framework of this program, we will run a special seminar, attended by the participants and all members of our institute interested in the subject.