8 citations · 18 across the 17 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
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…
q-fin.ST2019
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…