4 citations · 13 across the 8 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023★ 1 cited
-percolation with a random
Zsolt Bartha, Brett Kolesnik, Gal Kronenberg
In -percolation, we start with an Erdős--Rényi graph and then iteratively add edges that complete copies of . The process percolates if all edges missing…
math.PR2023★ 2 cited
Degree-penalized contact processes
Zsolt Bartha, Júlia Komjáthy, Daniel Valesin
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph…