Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:On polluted bootstrap percolation in Cartesian grids
Authors:ID Brešar, Boštjan (Author)
ID Hedžet, Jaka (Author)
ID Henning, Michael A. (Author)
Files:.pdf PDF - Presentation file, download (154,01 KB)
MD5: 739FCC048401FC40AA6FC30B1DB5B824
 
URL URL - Source URL, visit https://ajc.maths.uq.edu.au/pdf/96/ajc_v96_p027.pdf
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Given a graph $G$ and assuming that some vertices of $G$ are infected, the $r$-neighbor bootstrap percolation rule makes an uninfected vertex $v$ infected if $v$ has at least $r$ infected neighbors. The $r$-percolation number of $G$ is the minimum cardinality of a set of initially infected vertices in $G$ such that after continuously performing the $r$-neighbor bootstrap percolation rule each vertex of $G$ eventually becomes infected. In this paper, we continue the study of polluted bootstrap percolation introduced and studied by Gravner and McDonald [J. Stat Physics 87 (1997) 915-927] where in this variant some vertices are permanently in the non-infected state. We study an extremal (combinatorial) version of the bootstrap percolation problem in a polluted environment, where our main focus is on the class of grid graphs, that is, the Cartesian product $P_m \Box P_n$ of two paths $P_m$ and $P_n$ on $m$ and $n$ vertices, respectively. Given a number of polluted vertices in a Cartesian grid we establish a closed formula for the minimum $2$-neighbor bootstrap percolation number of the polluted grid, and obtain a lower bound for the other extreme.
Keywords:bootstrap percolation, grid, polluted environment, vertex deleted subgraph
Publication status:Published
Publication version:Version of Record
Publication date:01.10.2026
Year of publishing:2026
Number of pages:str. 27-37
Numbering:Vol. 96, part 1
PID:20.500.12556/DiRROS-31905 New window
UDC:519.17
ISSN on article:2202-3518
COBISS.SI-ID:287971075 New window
Publication date in DiRROS:17.08.2026
Views:40
Downloads:19
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The Australasian journal of combinatorics
Publisher:Centre for Discrete Mathematics and Computing, University of Queensland
ISSN:2202-3518
COBISS.SI-ID:17399897 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4008
Name:Drevesno neodvisnostno število grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0431
Name:Dominacija v grafih: kubični grafi, produkti in igre

Licences

License:CC BY-ND 4.0, Creative Commons Attribution-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nd/4.0/
Description:Under the NoDerivatives Creative Commons license one can take a work released under this license and re-distribute it, but it cannot be shared with others in adapted form, and credit must be provided to the author.

Secondary language

Language:Slovenian
Keywords:ojačano pronicanje, mreža, onesnaženo okolje, podgraf z odstranjenim vozliščem


Back