Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Hulshof, Tim"'
Publikováno v:
Chaos, Solitons & Fractals, October 2020, 109965
In this paper we conduct a simulation study of the spread of an epidemic like COVID-19 with temporary immunity on finite spatial and non-spatial network models. In particular, we assume that an epidemic spreads stochastically on a scale-free network
Externí odkaz:
http://arxiv.org/abs/2005.06880
Let $\mathcal{T}$ be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean $\mu >1$, conditioned to survive. Let $\varphi_{\mathcal{T}}$ be a random embedding of $\mathcal{T}$ into $\mathbb{Z}^d$ according to a simple
Externí odkaz:
http://arxiv.org/abs/1804.04396
A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if deleting $k
Externí odkaz:
http://arxiv.org/abs/1803.08719
Autor:
Beekenkamp, Thomas, Hulshof, Tim
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of edges and
Externí odkaz:
http://arxiv.org/abs/1802.03289
We identify the scaling limit of the backbone of the high-dimensional incipient infinite cluster (IIC), both in the finite-range and the long-range setting. In the finite-range setting, this scaling limit is Brownian motion, in the long-range setting
Externí odkaz:
http://arxiv.org/abs/1706.02941
Publikováno v:
Combinator. Probab. Comp. 29 (2020) 68-100
The Hamming graph $H(d,n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m=d(n-1)$ be the degree and $V = n^d$ be the number of vertices of $H(d,n)$. Let $p_c^{(d)}$ be the critical point for bond percolation on $H(d,n)$. We s
Externí odkaz:
http://arxiv.org/abs/1701.02099
Autor:
Hulshof, Tim, Nachmias, Asaf
We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter. We establis
Externí odkaz:
http://arxiv.org/abs/1612.01772
We study the critical probability for the metastable phase transition of the two-dimensional anisotropic bootstrap percolation model with $(1,2)$-neighbourhood and threshold $r = 3$. The first order asymptotics for the critical probability were recen
Externí odkaz:
http://arxiv.org/abs/1611.03294
Publikováno v:
Annals of Applied Probability 27(4):2569-2604 (2017)
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs. recurrence
Externí odkaz:
http://arxiv.org/abs/1604.08180
We study the connectivity of random subgraphs of the $d$-dimensional Hamming graph $H(d, n)$, which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the random subgraph with an i.i.d.\ Bernoulli bond percolation on $H(d,n)$
Externí odkaz:
http://arxiv.org/abs/1504.05350