Nick Wormald

Known as: Nicholas Charles Wormald, Wormald 
Nicholas Charles Wormald is an Australian mathematician and professor of mathematics at Monash University. He specializes in probabilistic… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model… (More)
  • table 1
Is this relevant?
2013
2013
In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d = d(n) = o(n). In… (More)
  • figure 1
Is this relevant?
2013
2013
Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n→∞. Then, under some regularity… (More)
Is this relevant?
2006
2006
Let c be a constant and (e1, f1), (e2, f2), . . . , (ecn, fcn) be a sequence of ordered pairs of edges on vertex set [n] chosen… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight-line… (More)
  • table 1
  • figure 1
  • table 3
  • table 5
  • table 6
Is this relevant?
1997
1997
This paper introduces a 'superdrop' concept for the characterisation of a sprinkler spray, where the statistical characteristics… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 6
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The asymptotic distribution of the number of Hamilton cycles in a random regular graph is determined. The limit distribution is… (More)
Is this relevant?
1987
1987
A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that the… (More)
Is this relevant?