| On early extinction and the effect of travelling in the SIR model. | 0 | 0.34 | 2022 |
| A Triangle Process On Regular Graphs | 0 | 0.34 | 2021 |
| Minors of a random binary matroid | 0 | 0.34 | 2019 |
| Threshold behaviour of discordant voting on the complete graph. | 0 | 0.34 | 2018 |
| Fast plurality consensus in regular expanders. | 2 | 0.35 | 2017 |
| Constructing Self-stabilizing Oscillators in Population Protocols. | 1 | 0.35 | 2017 |
| Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. | 1 | 0.40 | 2017 |
| The flip Markov chain for connected regular graphs. | 0 | 0.34 | 2017 |
| The covertime of a biased random walk on Gn, p. | 0 | 0.34 | 2017 |
| Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. | 1 | 0.38 | 2017 |
| The coalescing-branching random walk on expanders and the dual epidemic process. | 1 | 0.38 | 2016 |
| The Linear Voting Model. | 2 | 0.38 | 2016 |
| Rainbow Arborescence in Random Digraphs | 0 | 0.34 | 2016 |
| The use of Biweight Mid Correlation to improve graph based portfolio construction | 0 | 0.34 | 2016 |
| Spectral clustering using the kNN-MST similarity graph | 0 | 0.34 | 2016 |
| Link prediction methods and their accuracy for different social networks and network metrics | 14 | 0.64 | 2015 |
| Fast Consensus for Voting on General Expander Graphs | 6 | 0.51 | 2015 |
| Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. | 6 | 0.59 | 2012 |
| A fast algorithm to find all high degree vertices in power law graphs | 6 | 0.43 | 2012 |
| Coalescing random walks and voting on graphs | 8 | 0.70 | 2012 |
| Networks of random cycles | 0 | 0.34 | 2011 |
| Randomized diffusion for indivisible loads | 8 | 0.54 | 2011 |
| On the Imitation Strategy for Games on Graphs | 1 | 0.35 | 2011 |
| Speeding up random walks with neighborhood exploration | 10 | 0.75 | 2010 |
| The flip markov chain and a randomising P2P protocol | 11 | 0.73 | 2009 |
| A Spatial Web Graph Model with Local Influence Regions | 25 | 2.28 | 2008 |
| The degree distribution of the generalized duplication model | 19 | 1.52 | 2006 |
| The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence | 16 | 1.80 | 2004 |
| Classifying Special Interest Groups in Web Graphs | 2 | 0.39 | 2002 |
| Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number | 11 | 0.74 | 2002 |
| Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity | 13 | 0.94 | 2002 |
| The union of two random permutations does not have a directed Hamilton cycle | 2 | 0.42 | 2001 |
| On the rank of random matrices | 30 | 2.94 | 2000 |
| On the distribution of rank of a random matrix over a finite field | 32 | 1.73 | 2000 |
| Min-Wise Independent Linear Permutations | 7 | 0.67 | 2000 |
| Mixing properties of the Swendsen-Wang process on classes of graphs | 18 | 2.76 | 1999 |
| Asymptotics for dependent sums of random vectors | 2 | 0.52 | 1999 |
| Perfect Matchings in Random r-regular, s-uniform Hypergraphs | 21 | 1.90 | 1996 |
| The Vapnik-Chervonenkis dimension of a random graph | 8 | 0.83 | 1995 |
| On the Trickness of Sparse Random Graphs | 3 | 0.43 | 1992 |
