Nikolaos Fountoulakis

Author Info

Name	Affiliation	Papers
NIKOLAOS FOUNTOULAKIS	Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England	34
Collaborators	Citations	PageRank
27	185	18.04
Referers	Referees	References
269	285	288

Search Limit

100285

Publications (34 rows)

Collaborators (27 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Best response dynamics on random graphs	0	0.34	2022
The modularity of random graphs on the hyperbolic plane	0	0.34	2021
Resolution of a conjecture on majority dynamics: rapid stabilisation in dense random graphs	0	0.34	2020
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs	1	0.37	2018
Typical distances in a geometric model for complex networks	3	0.41	2017
The probability of connectivity in a hyperbolic model of complex networks.	1	0.35	2016
PERCOLATION ON RANDOM GRAPHS WITH A FIXED DEGREE SEQUENCE	0	0.34	2016
Local majority dynamics on preferential attachment graphs	0	0.34	2015
On the Largest Component of a Hyperbolic Model of Complex Networks	1	0.40	2015
On a geometrization of the Chung-Lu model for complex networks.	4	0.53	2015
Clustering and the Hyperbolic Geometry of Complex Networks.	4	0.45	2014
The multiple-orientability thresholds for random hypergraphs	9	0.68	2013
On the Insertion Time of Cuckoo Hashing	11	0.83	2013
What i tell you three times is true: bootstrap percolation in small worlds	9	0.60	2012
Ultra-fast rumor spreading in social networks	28	0.91	2012
On the evolution of random graphs on spaces of negative curvature	2	0.39	2012
Largest sparse subgraphs of random graphs	0	0.34	2011
3-connected cores in random planar graphs	3	0.50	2011
The t-Stability Number of a Random Graph.	0	0.34	2010
Rumor spreading on random regular graphs and expanders	23	1.09	2010
Orientability of random hypergraphs and the power of multiple choices	12	0.84	2010
Sharp load thresholds for cuckoo hashing	21	1.05	2009
Minors in random regular graphs	2	0.45	2009
Brief announcement: the speed of broadcasting in random networks - density does not matter	0	0.34	2009
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs	5	0.53	2009
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading	14	0.67	2009
A general critical condition for the emergence of a giant component in random graphs with given degrees	1	0.36	2009
Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting	1	0.37	2009
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers	12	0.79	2008
The evolution of the mixing rate of a simple random walk on the giant component of a random graph	1	0.66	2008
Percolation On Sparse Random Graphs With Given Degree Sequence	7	0.66	2008
The order of the largest complete minor in a random graph	8	0.74	2008
Ramsey numbers of sparse hypergraphs	0	0.34	2007
Upper Bounds On The Non-3-Colourability Threshold Of Random Graphs	2	0.37	2002