THTim Hulshof

Tim Hulshof

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tim Hulshof has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Random walk on barely supercritical branching random walk

    by Remco van der Hofstad, Tim Hulshof, Jan Nagel


  • Expansion of Percolation Critical Points for Hamming Graphs

    by Lorenzo Federico, Remco Van Der Hofstad, Frank Den Hollander, Tim Hulshof

    The Hamming graph H(d, n) is the Cartesian product of d complete graphs on n vertices. Let , which extends the asymptotics found in [10] by one order. The term $m^{-3} = O(m^{-1}V^{-1/3})$. The proof uses a lace expansion for the upper bound and a novel comparison with a branching random walk for the lower bound. The proof of the lower bound also yields a refined asymptotics for the susceptibility of a subcritical Erdös–Rényi random graph.


  • Open Access

    Slightly subcritical hypercube percolation

    by Tim Hulshof, Asaf Nachmias

    We study bond percolation on the hypercube {0,1}m in the slightly subcritical regime where p = pc(1 − εm) and εm = o(1) but εm ≫ 2−m/3 and study the clusters of largest volume and diameter. We establish that with high probability the largest component has cardinality , that the maximal diameter of all clusters is , and that the maximal mixing time of all clusters is .These results hold in different levels of generality, and in particular, some of the estimates hold for various classes of graphs such as high‐dimensional tori, expanders of high degree and girth, products of complete graphs, and infinite lattices in high dimensions.


  • Open Access

    Random walk on barely supercritical branching random walk

    by Remco van der Hofstad, Tim Hulshof, Jan Nagel

    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 random walk step distribution. Let $\mathcal{T}_p$ be percolation on $\mathcal{T}$ with parameter $p$, and let $p_c = \mu^{-1}$ be the critical percolation parameter. We consider a random walk $(X_n)_{n \ge 1}$ on $\mathcal{T}_p$ and investigate the behavior of the embedded process $\varphi_{\mathcal{T}_p}(X_n)$ as $n\to \infty$ and simultaneously, $\mathcal{T}_p$ becomes critical, that is, $p=p_n\searrow p_c$. We show that when we scale time by $n/(p_n-p_c)^3$ and space by $\sqrt{(p_n-p_c)/n}$, the process $(\varphi_{\mathcal{T}_p}(X_n))_{n \ge 1}$ converges to a $d$-dimensional Brownian motion. We argue that this scaling can be seen as an interpolation between the scaling of random walk on a static random tree and the anomalous scaling of processes in critical random environments.

  • Open Access

    Sharpness for Inhomogeneous Percolation on Quasi-Transitive Graphs

    by Thomas Beekenkamp, Tim Hulshof

    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 vertices. We prove that the transition is sharp almost everywhere, i.e., that in the subcritical regime the expected cluster size is finite, and that in the subcritical regime the probability of the one-arm event decays exponentially. Our proof extends the proof of sharpness of the phase transition for homogeneous percolation on vertex-transitive graphs by Duminil-Copin and Tassion [Comm. Math. Phys., 2016], and the result generalizes previous results of Antunovi\'c and Veseli\'c [J. Stat. Phys., 2008] and Menshikov [Dokl. Akad. Nauk 1986].

  • Open Access

    Higher order corrections for anisotropic bootstrap percolation

    by Hugo Duminil-Copin, Aernout C. D. van Enter, Tim Hulshof


  • Open Access

    Higher order corrections for anisotropic bootstrap percolation

    by Hugo Duminil-Copin, Aernout C. D. van Enter, Tim Hulshof

    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 recently determined by the first and second authors. Here we determine the following sharp second and third order asymptotics: \[ p_c\big( [L]^2,\mathcal{N}_{(1,2)},3 \big) \; = \; \frac{(\log \log L)^2}{12\log L} \, - \, \frac{\log \log L \, \log \log \log L}{ 3\log L} + \frac{\left(\log \frac{9}{2} + 1 \pm o(1) \right)\log \log L}{6\log L}. \] We note that the second and third order terms are so large that the first order asymptotics fail to approximate $p_c$ even for lattices of size well beyond $10^{10^{1000}}$.

  • Open Access

    Backbone scaling limit of the high-dimensional IIC: extended version

    by Markus Heydenreich, Remco van der Hofstad, Tim Hulshof, Grégory Miermont

    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, it is a stable motion. The proof relies on a novel lace expansion that keeps track of the number of pivotal bonds.

  • Open Access

    Expansion of percolation critical points for Hamming graphs

    by Lorenzo Federico, Remco van der Hofstad, Frank Den Hollander, Tim Hulshof

    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 show that, for $d \in \mathbb N$ fixed and $n \to \infty$, \begin{equation*} p_c^{(d)}= \dfrac{1}{m} + \dfrac{2d^2-1}{2(d-1)^2}\dfrac{1}{m^2} + O(m^{-3}) + O(m^{-1}V^{-1/3}), \end{equation*} which extends the asymptotics found in \cite{BorChaHofSlaSpe05b} by one order. The term $O(m^{-1}V^{-1/3})$ is the width of the critical window. For $d=4,5,6$ we have $m^{-3} = O(m^{-1}V^{-1/3})$, and so the above formula represents the full asymptotic expansion of $p_c^{(d)}$. In \cite{FedHofHolHul16a} \st{we show that} this formula is a crucial ingredient in the study of critical bond percolation on $H(d,n)$ for $d=2,3,4$. The proof uses a lace expansion for the upper bound and a novel comparison with a branching random walk for the lower bound. The proof of the lower bound also yields a refined asymptotics for the susceptibility of a subcritical Erd\H{o}s-R\'enyi random graph.

  • Open Access

    Slightly subcritical hypercube percolation

    by Tim Hulshof, Asaf Nachmias

    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 establish that with high probability the largest component has cardinality $\Theta\left(\varepsilon_m^{-2} \log(\varepsilon_m^3 2^m)\right)$, that the maximal diameter of all clusters is $(1+o(1)) \varepsilon_m^{-1} \log(\varepsilon_m^3 2^m)$, and that the maximal mixing time of all clusters is $\Theta\left(\varepsilon_m^{-3} \log^2(\varepsilon_m^3 2^m)\right)$. These results hold in different levels of generality, and in particular, some of the estimates hold for various classes of graphs such as high-dimensional tori, expanders of high degree and girth, products of complete graphs, and infinite lattices in high dimensions.