Institutional Repository of Vilnius University
Trikampių perkoliacija atsitiktiniame G(n, p) grafe /
Abstract
dc:descriptionWe a analyze the conditions for the triangle infection process starting from an initial infected set A to percolate, i.e. infect the entire graph G. The process is such that a vertex get infected if it has two infected neighbours that are also neighbours of each other. We set this problem in the random graph $G(n,p)$ and we ask what is what are the threshold functions for the size of |A|=m, such that A percolates w.h.p and such that $A$ doesn't percolate w.h.p. We prove that both thresholds are of the order c/(np)^3.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2024
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Melnik, Aleksandras Jaroslavas,
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD210642173&prefLang=en_US