Nikolaos Fountoulakis

Publications

  1. 2020
  2. Published
  3. Published
  4. 2018
  5. Published
  6. Published

    Law of large numbers for the largest component in a hyperbolic model of complex networks

    Nikolaos Fountoulakis, 3 Mar 2018, In : Annals of Applied Probability. 28, 1, p. 607-650 38 p.

    Research output: Contribution to journalArticle

  7. 2017
  8. E-pub ahead of print
  9. Published

    Typical distances in a geometric model for complex networks

    Nikolaos Fountoulakis, 15 Aug 2017, In : Internet Mathematics. 38 p.

    Research output: Contribution to journalArticle

  10. 2016
  11. E-pub ahead of print

    The probability of connectivity in a hyperbolic model of complex networks

    Nikolaos Fountoulakis, 3 Jun 2016, In : Random Structures and Algorithms. 49, 1, p. 65-94

    Research output: Contribution to journalArticle

  12. 2015
  13. E-pub ahead of print

    The multiple-orientability thresholds for random hypergraphs

    Nikolaos Fountoulakis, 28 Dec 2015, In : Combinatorics, Probability and Computing. 25, 6, p. 870-908 38 p.

    Research output: Contribution to journalArticle

  14. Published

    Bootstrap percolation and the geometry of complex networks

    Nikolaos Fountoulakis, 31 Aug 2015, In : Stochastic Processes and their Applications. 126, 1, p. 234-264 30 p.

    Research output: Contribution to journalArticle

  15. Published

    On the largest component of a hyperbolic model of complex networks

    Nikolaos Fountoulakis, 14 Aug 2015, In : The Electronic Journal of Combinatorics. 22, 3, 46 p., P3.24.

    Research output: Contribution to journalArticle

  16. E-pub ahead of print

    On the average-case complexity of parameterized clique

    Nikolaos Fountoulakis, 19 Feb 2015, In : Theoretical Computer Science.

    Research output: Contribution to journalArticle

  17. Published

    On a geometrization of the Chung–Lu model for complex networks

    Nikolaos Fountoulakis, 6 Jan 2015, In : Journal of Complex Networks. 27 p.

    Research output: Contribution to journalArticle

  18. Published
  19. 2014
  20. Published

    Bootstrap Percolation in Power-Law Random Graphs

    Nikolaos Fountoulakis, 19 Feb 2014, In : Journal of Statistical Physics. p. 72-92 21 p.

    Research output: Contribution to journalArticle

  21. Published

    Largest sparse subgraphs of random graphs

    Nikolaos Fountoulakis, 1 Jan 2014, In : European Journal of Combinatorics. 35, p. 232–244

    Research output: Contribution to journalArticle

  22. Published

    Clustering and the hyperbolic geometry of complex networks

    Nikolaos Fountoulakis & Elisabetta Candellero, 2014, Lecture notes in Computer Science. Springer, Vol. 8882. p. 1-12 (Lecture Notes in Computer Science; vol. 8882).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  23. 2013
  24. Published

    On the Insertion Time of Cuckoo Hashing

    Nikolaos Fountoulakis, 2013, Cornell University Library, 27 p.

    Research output: Working paper

  25. Published
  26. 2012
  27. Published

    Sharp load thresholds for cuckoo hashing

    Nikolaos Fountoulakis, 2012, In : Random Structures and Algorithms. 41, 3, p. 306-333 27 p.

    Research output: Contribution to journalArticle

  28. Published

    What I tell you three times is true: bootstrap percolation in small worlds

    Nikolaos Fountoulakis, 2012, Internet and Network Economics. Goldberg, P. (ed.). Springer, Vol. 7695. p. 462-474 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  29. 2011
  30. Published

    3-Connected Cores In Random Planar Graphs

    Nikolaos Fountoulakis, 1 May 2011, In : Combinatorics, Probability and Computing. 20, 03, p. 381-412 32 p.

    Research output: Contribution to journalArticle

  31. Published

    The multiple-orientability thresholds for random hypergraphs

    Nikolaos Fountoulakis, 1 Jan 2011, Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics (SIAM), p. 1222-1236 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  32. 2010
  33. Published

    Reliable Broadcasting in Random Networks and the Effect of Density

    Nikolaos Fountoulakis, 19 Mar 2010, p. 1-9. 9 p.

    Research output: Contribution to conference (unpublished)Paper

  34. Published

    Orientability of Random Hypergraphs and the Power of Multiple Choices

    Nikolaos Fountoulakis, 1 Jan 2010, Lecture Notes in Computer Science. Vol. 6198. (Lecture Notes in Computer Science; vol. 6198).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  35. Published
  36. Published

    Rumor Spreading on Random Regular Graphs and Expanders

    Nikolaos Fountoulakis, 1 Jan 2010, Lecture Notes in Computer Science. Vol. 6302. (Lecture Notes in Computer Science; vol. 6302).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  37. Published

    The t-stability number of a random graph

    Nikolaos Fountoulakis, 1 Jan 2010, In : The Electronic Journal of Combinatorics. 17, 1, p. 59 1 p.

    Research output: Contribution to journalArticle

  38. 2009
  39. Published

    Minors in Random Regular Graphs

    Nikolaos Fountoulakis, Daniela Kuhn & Deryk Osthus, 1 Dec 2009, In : Random Structures and Algorithms. 35, 4, p. 444-463 20 p.

    Research output: Contribution to journalArticle

  40. Published

    A general critical condition for the emergence of a giant component in random graphs with given degrees

    Nikolaos Fountoulakis, 1 Aug 2009, p. 639-645. 7 p.

    Research output: Contribution to conference (unpublished)Abstract

  41. Published

    Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting

    Nikolaos Fountoulakis, 1 Aug 2009, p. 553-559. 7 p.

    Research output: Contribution to conference (unpublished)Abstract

  42. Published

    Embeddings and Ramsey numbers of sparse k-uniform hypergraphs

    Nikolaos Fountoulakis, Daniela Kuhn & Deryk Osthus, 1 May 2009, In : Combinatorica. 29, 3, p. 263-297 35 p.

    Research output: Contribution to journalArticle

  43. Published

    Brief Announcement: The Speed of Broadcasting in Random Networks – Density Does Not Matter

    Nikolaos Fountoulakis, 1 Jan 2009, Lecture Notes in Computer Science. Vol. 5805. (Lecture Notes in Computer Science; vol. 5805).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  44. 2008
  45. Published

    The order of the largest complete minor in a random graph

    Nikolaos Fountoulakis, Daniela Kuhn & Deryk Osthus, 1 Sep 2008, In : Random Structures and Algorithms. 33, 2, p. 127-141 15 p.

    Research output: Contribution to journalArticle

  46. Published
  47. Published
  48. Published

    Percolation on sparse random graphs with given degree sequence

    Nikolaos Fountoulakis, 1 Jan 2008, p. 88-93. 6 p.

    Research output: Contribution to conference (unpublished)Paper

  49. 2007
  50. Published

    Faster Mixing and Small Bottlenecks

    Nikolaos Fountoulakis, 14 Dec 2007, In : Probability Theory and Related Fields. 137, 3-4, p. 475-486 12 p.

    Research output: Contribution to journalArticle

  51. Published

    Ramsey numbers of sparse hypergraphs

    Daniela Kuhn, Nikolaos Fountoulakis & Deryk Osthus, 15 Aug 2007, p. 29-33. 5 p.

    Research output: Contribution to conference (unpublished)Abstract

  52. Published

    The order of the largest complete minor in a random graph

    Nikolaos Fountoulakis, Daniela Kuhn & Deryk Osthus, 15 Aug 2007, In : Electronic Notes in Discrete Mathematics. 29, p. 141-146 6 p.

    Research output: Contribution to journalArticle

  53. Published

    Percolation on sparse random graphs with given degree sequence

    Nikolaos Fountoulakis, 1 Jan 2007, In : Internet Mathematics. 4, p. 329-356 28 p.

    Research output: Contribution to journalArticle

  54. 2002
  55. Published

    Upper bounds on the non-colourability threshold of random graphs

    Nikolaos Fountoulakis, 1 Jan 2002, In : Discrete Mathematics and Theoretical Computer Science. 5, 1, p. 205-226 22 p.

    Research output: Contribution to journalArticle