| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

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 On_polluted_bootstrap_percolation-Bresar-2026.pdf (155,00 KB)
MD5: 117DAD6A5E6BA694D9176AFB7D06C273
 
URL https://ajc.maths.uq.edu.au/pdf/96/ajc_v96_p027.pdf
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
FKKT - Faculty of Chemistry and Chemical Engineering
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:ojačano pronicanje, mreža, onesnaženo okolje, podgraf z odstranjenim vozliščem, bootstrap percolation, grid, polluted environment, vertex deleted subgraph
Publication status:Published
Publication version:Version of Record
Submitted for review:23.06.2025
Year of publishing:2026
Number of pages:str. 27-37
Numbering:Letn. 96, št. 1
PID:20.500.12556/DKUM-99516 New window
UDC:519.17
ISSN on article:2202-3518
COBISS.SI-ID:287971075 New window
Publication date in DKUM:20.08.2026
Views:248
Downloads:0
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
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-2022
Name:Teorija grafov

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

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

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0431-2025
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
Title:O ojačanem pronicanju v onesnaženih kartezičnih mrežah
Abstract:Naj bo ▫$G$▫ graf in predpostavimo, da so nekatera vozlišča v njem okužena. Tedaj pravilo ▫$r$▫-sosednega ojačanega pronicanja povzroči, da neokuženo vozlišče postane okuženo, če ima vsaj ▫$r$▫ okuženih sosedov. Nadalje, ▫$r$▫-sosedno število pronicanja grafa ▫$G$▫ predstavlja najmanjšo kardinalnost množice začetno okuženih vozlišč grafa, ki povzročijo, da so sčasoma vsa vozlišča grafa okužena, ko zaporedoma uporabljamo pravilo ▫$r$▫-sosednega ojačanega pronicanja. V tem članku nadaljujemo obravnavo onesnaženega ojačanega pronicanja, ki sta ga vpeljala Gravner in McDonald [J. Stat Physics 87 (1997) 915--927], pri katerem je nekaj vozlišč grafa ves čas v neokuženem stanju. Raziskujemo ekstremalno (kombinatorično) inačico ojačanega pronicanja v onesnaženem okolju, pri čemer se osredotočamo predvsem na razred kartezičnih mrež, to je, kartezičnih produktov ▫$P_m \Box P_n$▫ poti ▫$P_m$▫ in ▫$P_n$▫ na ▫$m$▫ oziroma ▫$n$▫ vozliščih. Za dano število onesnaženih vozlišč v kartezični mreži predstavimo zaprto formulu za najmanjše ▫$2$▫-sosedno število pronicanja onesnažene mreže in dokažemo spodnjo mejo za ekstremalno vrednost v drugi smeri.
Keywords:ojačano pronicanje, mreža, onesnaženo okolje, podgraf z odstranjenim vozliščem


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica