Nick Wormald

Professor Nicholas Charles Wormald FAA is an Australian mathematician and professor of mathematics at Monash University.

He specializes in probabilistic combinatorics, graph theory, graph algorithms, Steiner trees, web graphs, mine optimization, and other areas in combinatorics.[1]

In 1979, he earned a Ph.D. in mathematics from the University of Newcastle with a dissertation entitled Some problems in the enumeration of labelled graphs[2]

In 2006, he won the Euler Medal from the Institute of Combinatorics and its Applications.

He has held the Canada Research Chair in Combinatorics and Optimization at the University of Waterloo.[3]

In 2012, he was recognized with an Australian Laureate Fellowship for his achievements.[1]

In 2017, he was elected as a Fellow of the Australian Academy of Science.[4]

Selected publications
  • Nicholas C. Wormald (1999). "Models of random regular graphs" (PDF). London Mathematical Society Lecture Note Series. Cambridge University Press: 239–298.
  • Peter Eades; Nicholas C. Wormald (1994). "Edge crossings in drawings of bipartite graphs". Algorithmica. Springer. 11 (4): 379–403. doi:10.1007/BF01187020.
  • Nicholas C. Wormald (1995). "Differential equations for random processes and random graphs". Annals of Applied Probability. JSTOR: 1217–1235. doi:10.1214/aoap/1177004612.
  • Nicholas C Wormald (1999). "The differential equation method for random graph processes and greedy algorithms" (PDF). Lectures on approximation and randomized algorithms. Citeseer: 73–155.
  • Robert W. Robinson; Nicholas C. Wormald (1994). "Almost all regular graphs are Hamiltonian". Random Structures & Algorithms. Wiley Online Library. 5 (2): 363–374. doi:10.1002/rsa.3240050209.
  • Brendan D McKay; Nicholas C Wormald (1991). "Asymptotic enumeration by degree sequence of graphs with degrees o ( n ½ ) " (PDF). Combinatorica. Springer. 11 (4): 369–382. doi:10.1007/bf01275671.
  • Angelika Steger; Nicholas C. Wormald (1999). "Generating random regular graphs quickly". Combinatorics, Probability and Computing. Cambridge Univ Press. 8 (4): 377–396. doi:10.1017/S0963548399003867.
  • Nicholas C. Wormald (1981). "The asymptotic connectivity of labelled regular graphs". Journal of Combinatorial Theory. Series B. Elsevier. 31 (2): 156–167. doi:10.1016/S0095-8956(81)80021-4.
gollark: Oh, so it's meant to be "probability of surviving X years"? How is it actually computed?
gollark: How does that work?
gollark: Who deems these things viable?
gollark: If I IIRC, DALL-E Mini is actually light enough that you could feasibly run it on many consumer GPUs.
gollark: Ha, I was right. FEAR my rough knowledge of modern artistic AI things.

References
  1. "Professor Nicholas Wormald – Advances in the analysis of random structures and their applications" (PDF). Australian Government – Australian Research Council. Archived from the original (PDF) on 15 October 2012. Retrieved 20 November 2012.
  2. Nick Wormald at the Mathematics Genealogy Project
  3. Canada Research Chairs – Nicholas Charles Wormald, retrieved 2012-11-21.
  4. Fellow of the Australian Academy of Science, retrieved 2017-07-13.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.