Nick Wormald

Last updated

Nicholas Charles Wormald 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. [1]

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. [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]

In 2018, Wormald was an invited speaker at the International Congress of Mathematicians in Rio de Janeiro.

Selected publications

Related Research Articles

Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science.

<span class="mw-page-title-main">Discrete mathematics</span> Study of discrete mathematical structures

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".

<span class="mw-page-title-main">Ronald Graham</span> American mathematician (1935–2020)

Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.

<span class="mw-page-title-main">Béla Bollobás</span> Hungarian mathematician

Béla Bollobás FRS is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős since the age of 14.

<span class="mw-page-title-main">Jean Bourgain</span> Belgian mathematician

Jean Louis, baron Bourgain was a Belgian mathematician. He was awarded the Fields Medal in 1994 in recognition of his work on several core topics of mathematical analysis such as the geometry of Banach spaces, harmonic analysis, ergodic theory and nonlinear partial differential equations from mathematical physics.

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

A random r-regular graph is a graph selected from , which denotes the probability space of all r-regular graphs on vertices, where and is even. It is therefore a particular kind of random graph, but the regularity restriction significantly alters the properties that will hold, since most graphs are not regular.

<span class="mw-page-title-main">Václav Chvátal</span> Czech-Canadian mathematician

Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada, and a visiting professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.

László Pyber is a Hungarian mathematician. He is a researcher at the Alfréd Rényi Institute of Mathematics, Budapest. He works in combinatorics and group theory.

<span class="mw-page-title-main">Svante Janson</span> Swedish mathematician

Carl Svante Janson is a Swedish mathematician. A member of the Royal Swedish Academy of Sciences since 1994, Janson has been the chaired professor of mathematics at Uppsala University since 1987.

<span class="mw-page-title-main">Czesław Olech</span> Polish mathematician

Czesław Olech was a Polish mathematician. He was a representative of the Kraków school of mathematics, especially the differential equations school of Tadeusz Ważewski.

Mathematics is a broad subject that is commonly divided in many areas that may be defined by their objects of study, by the used methods, or by both. For example, analytic number theory is a subarea of number theory devoted to the use of methods of analysis for the study of natural numbers.

Dominique de Caen was a mathematician, Doctor of Mathematics, and professor of Mathematics, who specialized in graph theory, probability, and information theory. He is renowned for his research on Turán's extremal problem for hypergraphs.

Wojciech Samotij is a Polish mathematician who works in combinatorics, additive number theory, Ramsey theory and graph theory.

Antti Kupiainen is a Finnish mathematical physicist.

Analytic Combinatorics is a book on the mathematics of combinatorial enumeration, using generating functions and complex analysis to understand the growth rates of the numbers of combinatorial objects. It was written by Philippe Flajolet and Robert Sedgewick, and published by the Cambridge University Press in 2009. It won the Leroy P. Steele Prize in 2019.

<span class="mw-page-title-main">Stanislav Molchanov</span> Soviet American mathematician

Stanislav Alexeyevich Molchanov is a Soviet and American mathematician.

<span class="mw-page-title-main">Jürgen Gärtner</span> German mathematician

Jürgen Gärtner is a German mathematician, specializing in probability theory and analysis.

Probabilistic numerics is an active field of study at the intersection of applied mathematics, statistics, and machine learning centering on the concept of uncertainty in computation. In probabilistic numerics, tasks in numerical analysis such as finding numerical solutions for integration, linear algebra, optimization and simulation and differential equations are seen as problems of statistical, probabilistic, or Bayesian inference.

References

  1. 1 2 "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.