Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Geisler, Anna"'
Autor:
Diskin, Sahar, Geisler, Anna
Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained from $G(i
Externí odkaz:
http://arxiv.org/abs/2409.14398
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their neighbours are inf
Externí odkaz:
http://arxiv.org/abs/2406.17486
Autor:
Diskin, Sahar, Geisler, Anna
For $t \in \mathbb{N}$ and every $i\in[t]$, let $H_i$ be a $d_i$-regular connected graph, with $1<|V(H_i)|\le C$ for some integer $C\ge 2$. Let $G=\square_{i=1}^tH_i$ be the Cartesian product of $H_1, \ldots, H_t$. We show that if $t\ge 5C\log_2C$ th
Externí odkaz:
http://arxiv.org/abs/2404.14020