Thời gian: 14h Thứ 5, ngày 01/12/2022

Địa điểm: Phòng 507 nhà A6

Link online Zoom: 845 8621 8812

Passcode: 692956

Tóm tắt: Consider the percolation on lattice, which is a random graph obtained by letting each edge be open independently with probability p. In this talk, we discuss the sub-diffusive behavior of the graph distance in the supper-critical regime. In particular, we show that the graph distance obeys a concentration inequality with sub-linear scale. This is joint work with Van Hao Can.