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.

This focused week is part of the special semester on Discrete Geometry and Convexity.

Graph Drawing and Combinatorial Geometry Workshop

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\).

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. 

László Lovász will give the Inaugural László Fejes Tóth Lecture. The title of the talk is Graphs, Polytopes and Spectra.

The aim of the workshop is to bring together junior and senior researchers with backgrounds ranging from discrete and computational geometry to analysis and probability theory with the common theme of studying geometric problems, often related to convexity in a broad sense.

Until the end of 2023, the BBC + G Seminar (Big Budapest Combinatorics + Geometry Seminar) is the main seminar of the Special Semester on Discrete Geometry and Convexity at the Erdos Center.

The school offers three mini courses on current hot topics in the field.

The proposed workshop is inspired by recent developments in tractability of integer programming using combinatorial tools.