Agnieszka Widz: Random graph
05/03/24 07:47
Tuesday, March 5, 2024 17:15
Location: A.4.1 C-19
Speaker: Agnieszka Widz
Title: Random graph
Abstract: The Random Graph can be generated almost surely by connecting vertices with a fixed probability \(p\in(0,1)\), independently of other pairs. In my talk, I will recall the construction and explore interesting properties of the Random Graph, investigating the impact of varying probabilities for each edge. Specifically, I will characterize sequences \((p_n)_{n\in\mathbb{N}}\) for which there exists a bijection \(f\) between pairs of vertices in \(\mathbb{N}\), such that if we connect vertices \(v\) and \(w\) with probability \(p_{f(\{v,w\})}\), the Random Graph emerges almost surely.
Location: A.4.1 C-19
Speaker: Agnieszka Widz
Title: Random graph
Abstract: The Random Graph can be generated almost surely by connecting vertices with a fixed probability \(p\in(0,1)\), independently of other pairs. In my talk, I will recall the construction and explore interesting properties of the Random Graph, investigating the impact of varying probabilities for each edge. Specifically, I will characterize sequences \((p_n)_{n\in\mathbb{N}}\) for which there exists a bijection \(f\) between pairs of vertices in \(\mathbb{N}\), such that if we connect vertices \(v\) and \(w\) with probability \(p_{f(\{v,w\})}\), the Random Graph emerges almost surely.