Minimum degree conditions for small percolating sets in bootstrap percolation
The $r$-neighbour bootstrap process is an update rule for the states of vertices in which `uninfected' vertices with at least $r$ `infected' neighbours become infected and a set of initially infected vertices is said to \emph{percolate} if eventually all vertices are infected. For every $r \geq 3$, a sharp condition is given for the minimum degree of a sufficiently large graph that guarantees the existence of a percolating set of size $r$. In the case $r=3$, for $n$ large enough, any graph on $n$ vertices with minimum degree $\lfloor n/2 \rfloor +1$ has a percolating set of size $3$ and for $r \geq 4$ and $n$ large enough (in terms of $r$), every graph on $n$ vertices with minimum degree $\lfloor n/2 \rfloor + (r-3)$ has a percolating set of size $r$. A class of examples are given to show the sharpness of these results..
| Medienart: |
|
|---|
Preprint| Erscheinungsjahr: |
2017 |
|---|---|
| Erschienen: |
2017 |
| Enthalten in: |
arXiv.org - (2017) vom: 30. März Zur Gesamtaufnahme - year:2017 |
|---|
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Gunderson, Karen [VerfasserIn] |
|---|
| Links: |
Volltext [kostenfrei] |
|---|
| Förderinstitution / Projekttitel: |
|
|---|
| PPN (Katalog-ID): |
XAR007742711 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | XAR007742711 | ||
| 003 | DE-627 | ||
| 005 | 20230429064511.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 200409s2017 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)XAR007742711 | ||
| 035 | |a (arXiv)1703.10741 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 510 | |
| 245 | 1 | 0 | |a Minimum degree conditions for small percolating sets in bootstrap percolation |
| 264 | 1 | |c 2017 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a The $r$-neighbour bootstrap process is an update rule for the states of vertices in which `uninfected' vertices with at least $r$ `infected' neighbours become infected and a set of initially infected vertices is said to \emph{percolate} if eventually all vertices are infected. For every $r \geq 3$, a sharp condition is given for the minimum degree of a sufficiently large graph that guarantees the existence of a percolating set of size $r$. In the case $r=3$, for $n$ large enough, any graph on $n$ vertices with minimum degree $\lfloor n/2 \rfloor +1$ has a percolating set of size $3$ and for $r \geq 4$ and $n$ large enough (in terms of $r$), every graph on $n$ vertices with minimum degree $\lfloor n/2 \rfloor + (r-3)$ has a percolating set of size $r$. A class of examples are given to show the sharpness of these results. | ||
| 700 | 1 | |a Gunderson, Karen |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t arXiv.org |g (2017) vom: 30. März |
| 773 | 1 | 8 | |g year:2017 |g day:30 |g month:03 |
| 856 | 4 | 0 | |u https://arxiv.org/abs/1703.10741 |z kostenfrei |3 Volltext |
| 912 | |a GBV_XAR | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |j 2017 |b 30 |c 03 | ||
| 953 | |2 045F |a 510 | ||