Andrew McDowell
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Andrew McDowell has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Richard Mycroft
School of Mathematics University of Birmingham UK
3 shared publications - Colin Cooper
King's College London, London, United Kingdom
1 shared publication Frederik Garbe
School of Mathematics University of Birmingham B15 2TT Birmingham United Kingdom
1 shared publication- József Balogh
Department of Mathematical Sciences University of Illinois at Urbana-Champaign 61801 Urbana Illinois USA
1 shared publication - Nicolas Rivera
Department of Informatics King's College London UK
1 shared publication - Takeharu Shiraga
Department of Information and System Engineering Faculty of Science and Engineering Chuo University Tokyo Japan
1 shared publication
Latest Publications
- 9 May 2018
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 27 (4) , 449-474
Triangle-Tilings in Graphs Without Large Independent Sets
We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an n-vertex graph G with sublinear independence number. In this setting, we show that if δ(G) ≥ n/3 + o(n), then G has a triangle-tiling covering all but at most four vertices. Also, for every r ≥ 5, we asymptotically determine the minimum degree threshold for a perfect triangle-tiling under the additional assumptions that G is Kr-free and n is divisible by 3.
- 9 May 2018
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 27 (4) , 449-474
Triangle-Tilings in Graphs Without Large Independent Sets
We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an n-vertex graph G with sublinear independence number. In this setting, we show that if δ(G) ≥ n/3 + o(n), then G has a triangle-tiling covering all but at most four vertices. Also, for every r ≥ 5, we asymptotically determine the minimum degree threshold for a perfect triangle-tiling under the additional assumptions that G is Kr-free and n is divisible by 3.
- Open Access
Contagious sets in a degree-proportional bootstrap percolation process
We study the following bootstrap percolation process: given a connected graph $G$, a constant $\rho \in [0, 1]$ and an initial set $A \subseteq V(G)$ of \emph{infected} vertices, at each step a vertex~$v$ becomes infected if at least a $\rho$-proportion of its neighbours are already infected (once infected, a vertex remains infected forever). Our focus is on the size $h_\rho(G)$ of a smallest initial set which is \emph{contagious}, meaning that this process results in the infection of every vertex of $G$. Our main result states that every connected graph $G$ on $n$ vertices has $h_\rho(G) < 2\rho n$ or $h_\rho(G) = 1$ (note that allowing the latter possibility is necessary because of the case $\rho\leq\tfrac{1}{2n}$, as every contagious set has size at least one). This is the best-possible bound of this form, and improves on previous results of Chang and Lyuu and of Gentner and Rautenbach. We also provide a stronger bound for graphs of girth at least five and sufficiently small $\rho$, which is asymptotically best-possible.Open AccessContagious sets in a degree-proportional bootstrap percolation process
We study the following bootstrap percolation process: given a connected graph $G$, a constant $\rho \in [0, 1]$ and an initial set $A \subseteq V(G)$ of \emph{infected} vertices, at each step a vertex~$v$ becomes infected if at least a $\rho$-proportion of its neighbours are already infected (once infected, a vertex remains infected forever). Our focus is on the size $h_\rho(G)$ of a smallest initial set which is \emph{contagious}, meaning that this process results in the infection of every vertex of $G$. Our main result states that every connected graph $G$ on $n$ vertices has $h_\rho(G) < 2\rho n$ or $h_\rho(G) = 1$ (note that allowing the latter possibility is necessary because of the case $\rho\leq\tfrac{1}{2n}$, as every contagious set has size at least one). This is the best-possible bound of this form, and improves on previous results of Chang and Lyuu and of Gentner and Rautenbach. We also provide a stronger bound for graphs of girth at least five and sufficiently small $\rho$, which is asymptotically best-possible. - Open Access
Hamilton $\ell$-cycles in randomly-perturbed hypergraphs
We prove that for integers $2 \leq \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edges independently at random with probability $p \geq O(n^{-(k-\ell)-c})$, then with high probability the resulting $k$-uniform hypergraph contains a Hamilton $\ell$-cycle. This complements a recent analogous result for Hamilton $1$-cycles due to Krivelevich, Kwan and Sudakov, and a comparable theorem in the graph case due to Bohman, Frieze and Martin.Open AccessHamilton $\ell$-cycles in randomly-perturbed hypergraphs
We prove that for integers $2 \leq \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edges independently at random with probability $p \geq O(n^{-(k-\ell)-c})$, then with high probability the resulting $k$-uniform hypergraph contains a Hamilton $\ell$-cycle. This complements a recent analogous result for Hamilton $1$-cycles due to Krivelevich, Kwan and Sudakov, and a comparable theorem in the graph case due to Bohman, Frieze and Martin. - Open Access
Dispersion processes
We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step, each of these particles moves to a neighbour of $v$ chosen independently and uniformly at random. The dispersion process ends once the particles have all stopped moving, i.e. at the first step at which each vertex is occupied by at most one particle. For the complete graph $K_n$ and star graph $S_n$, we show that for any constant $\delta>1$, with high probability, if $M \le n/2(1-\delta)$, then the process finishes in $O(\log n)$ steps, whereas if $M \ge n/2(1+\delta)$, then the process needs $e^{\Omega(n)}$ steps to complete (if ever). We also show that an analogous lazy variant of the process exhibits the same behaviour but for higher thresholds, allowing faster dispersion of more particles. For paths, trees, grids, hypercubes and Cayley graphs of large enough sizes (in terms of $M$) we give bounds on the time to finish and the maximum distance traveled from the origin as a function of the number of particles $M$.Open AccessDispersion processes
We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step, each of these particles moves to a neighbour of $v$ chosen independently and uniformly at random. The dispersion process ends once the particles have all stopped moving, i.e. at the first step at which each vertex is occupied by at most one particle. For the complete graph $K_n$ and star graph $S_n$, we show that for any constant $\delta>1$, with high probability, if $M \le n/2(1-\delta)$, then the process finishes in $O(\log n)$ steps, whereas if $M \ge n/2(1+\delta)$, then the process needs $e^{\Omega(n)}$ steps to complete (if ever). We also show that an analogous lazy variant of the process exhibits the same behaviour but for higher thresholds, allowing faster dispersion of more particles. For paths, trees, grids, hypercubes and Cayley graphs of large enough sizes (in terms of $M$) we give bounds on the time to finish and the maximum distance traveled from the origin as a function of the number of particles $M$.