Nick Wormald
{{Short description|Australian mathematician}}
{{Use dmy dates|date=April 2022}}
Nicholas Charles Wormald {{post-nominals|country=AUS|FAA}} (born 1953) 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.{{cite web |title= Professor Nicholas Wormald – Advances in the analysis of random structures and their applications |publisher= Australian Government – Australian Research Council |url= http://www.arc.gov.au/pdf/FL12/NICHOLAS%20WORMALD.pdf |accessdate= 20 November 2012 |url-status= dead |archiveurl= https://web.archive.org/web/20121015032545/http://arc.gov.au/pdf/FL12/NICHOLAS%20WORMALD.pdf |archivedate= 15 October 2012 }}
In 1979, Wormald earned a Ph.D. in mathematics from the University of Newcastle with a dissertation titled Some problems in the enumeration of labelled graphs.{{mathgenealogy|id=74437 }}
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.[http://www.chairs-chaires.gc.ca/chairholders-titulaires/profile-eng.aspx?profileID=753 Canada Research Chairs – Nicholas Charles Wormald], retrieved 2012-11-21. In 2012, he was recognized with an Australian Laureate Fellowship for his achievements. In 2017, he was elected as a Fellow of the Australian Academy of Science.[https://www.science.org.au/fellowship/fellows/professor-nicholas-wormald Fellow of the Australian Academy of Science], retrieved 2017-07-13.
In 2018, Wormald was an invited speaker at the International Congress of Mathematicians in Rio de Janeiro.
Selected publications
- {{cite journal|title=Models of random regular graphs|author=Nicholas C. Wormald |journal=London Mathematical Society Lecture Note Series|pages=239–298|year=1999|publisher=Cambridge University Press|url =http://www.math.uwaterloo.ca/~nwormald/papers/regsurvey.pdf}}
- {{cite journal|title=Edge crossings in drawings of bipartite graphs|author=Peter Eades |authorlink=Peter Eades |author2 = Nicholas C. Wormald |journal=Algorithmica|volume=11|issue=4|pages=379–403|year=1994|doi = 10.1007/BF01187020|publisher=Springer|s2cid=22476033 }}
- {{cite journal|title=Differential equations for random processes and random graphs|author=Nicholas C. Wormald |journal= Annals of Applied Probability|pages=1217–1235|year=1995|volume=5 |issue=4 |doi = 10.1214/aoap/1177004612|url = http://projecteuclid.org/euclid.aoap/1177004612|publisher=JSTOR|doi-access=free}}
- {{cite journal|title=The differential equation method for random graph processes and greedy algorithms|author=Nicholas C Wormald |journal=Lectures on Approximation and Randomized Algorithms|pages=73–155|year=1999|publisher=Citeseer|url=http://users.monash.edu.au/~nwormald/papers/de.pdf}}
- {{cite journal|title=Almost all regular graphs are Hamiltonian|author=Robert W. Robinson|author2 = Nicholas C. Wormald |journal=Random Structures & Algorithms|volume=5|issue=2|pages=363–374|year=1994|doi = 10.1002/rsa.3240050209|url = http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#RobinsonW94|publisher=Wiley Online Library}}
- {{cite journal|title=Asymptotic enumeration by degree sequence of graphs with degrees o ( n ½ ) |author=Brendan D McKay|author2 = Nicholas C Wormald |journal=Combinatorica|volume=11|issue=4|pages=369–382|year=1991|url = http://cs.anu.edu.au/~bdm/papers/nickcount.pdf|publisher=Springer|doi=10.1007/bf01275671|s2cid=9228526 }}
- {{cite journal|title=Generating random regular graphs quickly|author=Angelika Steger|author1-link=Angelika Steger|author2 = Nicholas C. Wormald |journal=Combinatorics, Probability and Computing|volume=8|issue=4|pages=377–396|year=1999|publisher=Cambridge Univ Press|doi = 10.1017/S0963548399003867|s2cid=14545326 |url = http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#StegerW99}}
- {{cite journal|title=The asymptotic connectivity of labelled regular graphs|author=Nicholas C. Wormald |journal=Journal of Combinatorial Theory|series=Series B|volume=31|issue=2|pages=156–167|year=1981|doi = 10.1016/S0095-8956(81)80021-4|publisher=Elsevier|doi-access=free}}
References
{{reflist}}
{{Authority control}}
{{DEFAULTSORT:Wormald, Nick}}
Category:Australian mathematicians
Category:University of Newcastle (Australia) alumni
Category:Academic staff of the University of Waterloo