48 citations · 159 across the 35 of their papers we have counts for
38 papers
Component Games on Random Graphs
Rani Hod, Michael Krivelevich, Tobias Müller +2
In the component game played on a graph , two players, Maker and Breaker, alternately claim~ and~ previously unclaimed edges of , respectively. Maker…
Asymptotic enumeration of hypergraphs by degree sequence
Nina Kamčev, Anita Liebenau, Nick Wormald
We prove an asymptotic formula for the number of -uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asym…
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
Anita Liebenau, Nick Wormald
We provide asymptotic formulae for the numbers of bipartite graphs with given degree sequence, and of loopless digraphs with given in- and out-degree sequences, for a wide range of…
Fast uniform generation of random graphs with given degree sequences
Andrii Arman, Pu Gao, Nicholas Wormald
In this paper we provide an algorithm that generates a graph with given degree sequence uniformly at random. Provided that , where is the maximal degree and is th…
A Weight-based Information Filtration Algorithm for Stock-Correlation Networks
Seyed Soheil Hosseini, Nick Wormald, Tianhai Tian
Several algorithms have been proposed to filter information on a complete graph of correlations across stocks to build a stock-correlation network. Among them the planar maximally…
A limit theorem for the six-length of random functional graphs with a fixed degree sequence
Kevin Leckey, Nicholas Wormald
We obtain results on the limiting distribution of the six-length of a random functional graph, also called a functional digraph or random mapping, with given in-degree sequence. Th…