핵심 개념
Particles' dispersion time on complete graphs studied for critical window.
초록
The article explores a synchronous particle movement process on a complete graph, focusing on the dispersion time. It analyzes the critical window where particles' number corresponds to the graph's vertices. The dispersion time is studied in relation to the critical window, showing convergence to a logistic branching process. Explicit asymptotics are formulated for transitions in and out of the critical window. The total number of jumps is also analyzed, converging to a fixed quantity when scaled by n ln n. The study provides insights into the abrupt transition from logarithmic to exponential time in dispersion processes.
통계
M particles are placed on a vertex initially.
Particles move independently to a neighbor vertex.
Dispersion time rescaled by n^-1/2 converges.
Total jumps rescaled by n ln n converge to 2/7.
인용구
"In the middle of the critical window, E[T0] = π3/2/√7."
"Particles' dispersion time studied for critical window transitions."