Linear algebra and bootstrap percolation

Details Linear algebra and bootstrap percolation Linear algebra and bootstrap percolation

2011-07-07

arxiv.org/abs/1107.1410v2

Mathematics

Combinatorics

10 pages

Scientific paper

In $\HH$-bootstrap percolation, a set $A \subset V(\HH)$ of initially 'infected' vertices spreads by infecting vertices which are the only uninfected vertex in an edge of the hypergraph $\HH$. A particular case of this is the $H$-bootstrap process, in which $\HH$ encodes copies of $H$ in a graph $G$. We find the minimum size of a set $A$ that leads to complete infection when $G$ and $H$ are powers of complete graphs and $\HH$ encodes induced copies of $H$ in $G$. The proof uses linear algebra, a technique that is new in bootstrap percolation, although standard in the study of weakly saturated graphs, which are equivalent to (edge) $H$-bootstrap percolation on a complete graph.

Affiliated with

Also associated with

No associations

Rating

Linear algebra and bootstrap percolation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear algebra and bootstrap percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear algebra and bootstrap percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417107