Oliver Cooley
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
Research Subjects
Oliver Cooley has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Mihyun Kang
Institute of Discrete Mathematics Graz University of Technology Graz Austria
20 shared publications - Amin Coja-Oghlan
Goethe University Frankfurt
4 shared publications - Kathrin Skubch
Mathematics Institute Goethe University 10 Robert Mayer St 60325 Frankfurt Germany
4 shared publications Nicola Del Giudice
Graz University of Technology
3 shared publications- Philipp Sprüssel
Graz University of Technology
3 shared publications Richard Mycroft
3 shared publications
Latest Publications
- Open Access
- 1 July 2022
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 29 (3) , P3.27
Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes
We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each $k$, each set of $k+1$ vertices forms an edge with some probability $p_k$ independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417].We consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group $R$. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition.- 1 July 2022
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 29 (3) , P3.27
Open AccessPhase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes
We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each $k$, each set of $k+1$ vertices forms an edge with some probability $p_k$ independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417].We consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group $R$. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition. - 24 August 2021
- Published by Springer Nature
- p. 625-630
On a Question of Vera T. Sós About Size Forcing of Graphons
- 24 August 2021
- Published by Springer Nature
- p. 625-630
On a Question of Vera T. Sós About Size Forcing of Graphons
- Open Access
Large induced matchings in random graphs
Given a large graph $H$, does the binomial random graph $G(n,p)$ contain a copy of $H$ as an induced subgraph with high probability? This classical question has been studied extensively for various graphs $H$, going back to the study of the independence number of $G(n,p)$ by Erd\H{o}s and Bollob\'as, and Matula in 1976. In this paper we prove an asymptotically best possible result for induced matchings by showing that if $C/n\le p \le 0.99$ for some large constant $C$, then $G(n,p)$ contains an induced matching of order approximately $2\log_q(np)$, where $q= \frac{1}{1-p}$.Open AccessLarge induced matchings in random graphs
Given a large graph $H$, does the binomial random graph $G(n,p)$ contain a copy of $H$ as an induced subgraph with high probability? This classical question has been studied extensively for various graphs $H$, going back to the study of the independence number of $G(n,p)$ by Erd\H{o}s and Bollob\'as, and Matula in 1976. In this paper we prove an asymptotically best possible result for induced matchings by showing that if $C/n\le p \le 0.99$ for some large constant $C$, then $G(n,p)$ contains an induced matching of order approximately $2\log_q(np)$, where $q= \frac{1}{1-p}$. - 1 January 2020
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 11 (4) , 603-624
Multi-coloured jigsaw percolation on random graphs
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2020
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 11 (4) , 603-624
Multi-coloured jigsaw percolation on random graphs
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 34 (4) , 2033-2062
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees
One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph $\mathcal{G}(n,p)$, the threshold for the appearance of the unique largest component (also known as the giant component) is $p_g = n^{-1}$. More precisely, when $p$ changes from $(1-\varepsilon)p_g$ (subcritical case) to $p_g$ and then to $(1+\varepsilon)p_g$ (supercritical case) for $\varepsilon>0$, with high probability the order of the largest component increases smoothly from $O(\varepsilon^{-2}\log(\varepsilon^3 n))$ to $\Theta(n^{2/3})$ and then to $(1 \pm o(1)) 2 \varepsilon n$. Furthermore, in the supercritical case, with high probability the largest components except the giant component are trees of order $O(\varepsilon^{-2}\log(\varepsilon^3 n))$, exhibiting a structural symmetry between the subcritical random graph and the graph obtained from the supercritical random graph by deleting its giant component. As a natural generalization of random graphs and connectedness, we consider the binomial random $k$-uniform hypergraph $\mathcal{H}^k(n,p)$ (where each $k$-tuple of vertices is present as a hyperedge with probability $p$ independently) and the following notion of high-order connectedness. Given an integer $1 \leq j \leq k-1$, two sets of $j$ vertices are called $j$-connected if there is a walk of hyperedges between them such that any two consecutive hyperedges intersect in at least $j$ vertices. A $j$-connected component is a maximal collection of pairwise $j$-connected $j$-tuples of vertices. Recently, the threshold for the appearance of the giant $j$-connected component in $\mathcal{H}^k(n,p)$ and its order were determined. In this article, we take a closer look at the subcritical random hypergraph. We determine the structure, order, and size of the largest $j$-connected components, with the help of a certain class of “hypertrees” and related objects. In our proofs, we combine various probabilistic and enumerative techniques, such as generating functions and couplings with branching processes. Our study will pave the way to establishing a symmetry between the subcritical random hypergraph and the hypergraph obtained from the supercritical random hypergraph by deleting its giant $j$-connected component.- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 34 (4) , 2033-2062
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees
One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph $\mathcal{G}(n,p)$, the threshold for the appearance of the unique largest component (also known as the giant component) is $p_g = n^{-1}$. More precisely, when $p$ changes from $(1-\varepsilon)p_g$ (subcritical case) to $p_g$ and then to $(1+\varepsilon)p_g$ (supercritical case) for $\varepsilon>0$, with high probability the order of the largest component increases smoothly from $O(\varepsilon^{-2}\log(\varepsilon^3 n))$ to $\Theta(n^{2/3})$ and then to $(1 \pm o(1)) 2 \varepsilon n$. Furthermore, in the supercritical case, with high probability the largest components except the giant component are trees of order $O(\varepsilon^{-2}\log(\varepsilon^3 n))$, exhibiting a structural symmetry between the subcritical random graph and the graph obtained from the supercritical random graph by deleting its giant component. As a natural generalization of random graphs and connectedness, we consider the binomial random $k$-uniform hypergraph $\mathcal{H}^k(n,p)$ (where each $k$-tuple of vertices is present as a hyperedge with probability $p$ independently) and the following notion of high-order connectedness. Given an integer $1 \leq j \leq k-1$, two sets of $j$ vertices are called $j$-connected if there is a walk of hyperedges between them such that any two consecutive hyperedges intersect in at least $j$ vertices. A $j$-connected component is a maximal collection of pairwise $j$-connected $j$-tuples of vertices. Recently, the threshold for the appearance of the giant $j$-connected component in $\mathcal{H}^k(n,p)$ and its order were determined. In this article, we take a closer look at the subcritical random hypergraph. We determine the structure, order, and size of the largest $j$-connected components, with the help of a certain class of “hypertrees” and related objects. In our proofs, we combine various probabilistic and enumerative techniques, such as generating functions and couplings with branching processes. Our study will pave the way to establishing a symmetry between the subcritical random hypergraph and the hypergraph obtained from the supercritical random hypergraph by deleting its giant $j$-connected component.- 4 July 2019
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 26 (3) , P3.6
The Size of the Giant Component in Random Hypergraphs: a Short Proof
We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\ge 2$ and $1\le j \le k-1$, two $j$-sets (of vertices) lie in the same $j$-component if there is a sequence of edges from one to the other such that consecutive edges intersect in at least $j$ vertices.We prove that certain collections of $j$-sets constructed during a breadth-first search process on $j$-components in a random $k$-uniform hypergraph are reasonably regularly distributed with high probability. We use this property to provide a short proof of the asymptotic size of the giant $j$-component shortly after it appears.- 4 July 2019
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 26 (3) , P3.6
The Size of the Giant Component in Random Hypergraphs: a Short Proof
We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\ge 2$ and $1\le j \le k-1$, two $j$-sets (of vertices) lie in the same $j$-component if there is a sequence of edges from one to the other such that consecutive edges intersect in at least $j$ vertices.We prove that certain collections of $j$-sets constructed during a breadth-first search process on $j$-components in a random $k$-uniform hypergraph are reasonably regularly distributed with high probability. We use this property to provide a short proof of the asymptotic size of the giant $j$-component shortly after it appears.- 1 July 2019
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 137, 178-231
Core forging and local limit theorems for the k-core of random graphs
- 1 July 2019
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 137, 178-231
Core forging and local limit theorems for the k-core of random graphs
- 1 June 2019
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 51 (2) , 378-407
The sharp threshold for jigsaw percolation in random graphs
We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are ‘jointly connected’. Bollobás, Riordan, Slivken, and Smith (2017) proved that, when the two graphs are independent binomial random graphs, whether the jigsaw process percolates undergoes a phase transition when the product of the two probabilities is $\Theta({1}/{(n\ln n)})$ . We show that this threshold is sharp, and that it lies at ${1}/{(4n\ln n)}$ .- 1 June 2019
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 51 (2) , 378-407
The sharp threshold for jigsaw percolation in random graphs
We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are ‘jointly connected’. Bollobás, Riordan, Slivken, and Smith (2017) proved that, when the two graphs are independent binomial random graphs, whether the jigsaw process percolates undergoes a phase transition when the product of the two probabilities is $\Theta({1}/{(n\ln n)})$ . We show that this threshold is sharp, and that it lies at ${1}/{(4n\ln n)}$ .- 23 April 2019
- Published by Wiley in Random Structures & Algorithms
- Vol. 56 (2) , 461-500
Vanishing of cohomology groups of random simplicial complexes
We consider k‐dimensional random simplicial complexes generated from the binomial random (k + 1)‐uniform hypergraph by taking the downward‐closure. For 1 ≤ j ≤ k − 1, we determine when all cohomology groups with coefficients in from dimension one up to j vanish and the zero‐th cohomology group is isomorphic to . This property is not deterministically monotone for this model, but nevertheless we show that it has a single sharp threshold. Moreover we prove a hitting time result, relating the vanishing of these cohomology groups to the disappearance of the last minimal obstruction. We also study the asymptotic distribution of the dimension of the j‐th cohomology group inside the critical window. As a corollary, we deduce a hitting time result for a different model of random simplicial complexes introduced by Linial and Meshulam, previously only known for dimension two.
- 23 April 2019
- Published by Wiley in Random Structures & Algorithms
- Vol. 56 (2) , 461-500
Vanishing of cohomology groups of random simplicial complexes
We consider k‐dimensional random simplicial complexes generated from the binomial random (k + 1)‐uniform hypergraph by taking the downward‐closure. For 1 ≤ j ≤ k − 1, we determine when all cohomology groups with coefficients in from dimension one up to j vanish and the zero‐th cohomology group is isomorphic to . This property is not deterministically monotone for this model, but nevertheless we show that it has a single sharp threshold. Moreover we prove a hitting time result, relating the vanishing of these cohomology groups to the disappearance of the last minimal obstruction. We also study the asymptotic distribution of the dimension of the j‐th cohomology group inside the critical window. As a corollary, we deduce a hitting time result for a different model of random simplicial complexes introduced by Linial and Meshulam, previously only known for dimension two.
- Open Access
The sharp threshold for jigsaw percolation in random graphs
We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are `jointly connected'. Bollob\'as, Riordan, Slivken and Smith proved that when the two graphs are independent binomial random graphs, whether the jigsaw process percolates undergoes a phase transition when the product of the two probabilities is $\Theta\left( \frac{1}{n\ln n} \right)$. We show that this threshold is sharp, and that it lies at $\frac{1}{4n\ln n}$.Open AccessThe sharp threshold for jigsaw percolation in random graphs
We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are `jointly connected'. Bollob\'as, Riordan, Slivken and Smith proved that when the two graphs are independent binomial random graphs, whether the jigsaw process percolates undergoes a phase transition when the product of the two probabilities is $\Theta\left( \frac{1}{n\ln n} \right)$. We show that this threshold is sharp, and that it lies at $\frac{1}{4n\ln n}$.