No photo of Oliver Josef Nikolaus Cooley

Oliver Josef Nikolaus Cooley

PhD

20152019
If you made any changes in Pure these will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 1 Similar Profiles
Hypergraph Mathematics
Random Graphs Mathematics
Slice Mathematics
Cycle Mathematics
Graph in graph theory Mathematics
Vertex of a graph Mathematics
Regularity Lemma Mathematics
Phase Transition Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2015 2019

  • 9 Article
  • 6 Conference contribution
  • 2 Abstract

Subcritical random hypergraphs, high-order components, and hypertrees

Cooley, O. J. N., Fang, W., Del Giudice, N. & Kang, M., 2019, Proceedings of Analytic Algorithmics and Combinatorics (ANALCO19).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Largest components in random hypergraphs

Cooley, O. J. N., Kang, M. & Person, Y., 2018, In : Combinatorics, probability & computing.

Research output: Contribution to journalArticleResearchpeer-review

The size of the giant high-order component in random hypergraphs

Cooley, O. J. N., Kang, M. & Koch, C. J., 2018, In : Random structures & algorithms. 53, p. 238 288 p.

Research output: Contribution to journalArticleResearchpeer-review

Open Access

Vanishing of cohomology groups of random simplicial complexes

Cooley, O. J. N., Del Giudice, N., Kang, M. & Sprüssel, P., 2018, Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). p. 7:1 7 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Homological connectedness of random hypergraphs

Cooley, O. J. N., Haxell, P., Kang, M. & Sprüssel, P., 2017, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics. p. 279-285

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Activities 2017 2017

  • 2 Conference or symposium (Participation in/Organisation of)
  • 2 Talk at conference or symposium

European Conference on Combinatorics, Graph Theory and Applications

Oliver Josef Nikolaus Cooley (Participant)
28 Aug 20171 Sep 2017

Activity: Participation in or organisation ofConference or symposium (Participation in/Organisation of)

Core forging in random graphs

Oliver Josef Nikolaus Cooley (Speaker)
8 Aug 2017

Activity: Talk or presentationTalk at conference or symposiumScience to science

Homological connectedness of random hypergraphs

Oliver Josef Nikolaus Cooley (Speaker)
29 Aug 2017

Activity: Talk or presentationTalk at conference or symposiumScience to science

The 18th International Conference on Random Structures and Algorithms

Oliver Josef Nikolaus Cooley (Participant)
7 Aug 201711 Aug 2017

Activity: Participation in or organisation ofConference or symposium (Participation in/Organisation of)