Australian Laureate Fellowships - Grant ID: FL120100125
Funder
Australian Research Council
Funding Amount
$1,796,966.00
Summary
Advances in the analysis of random structures and their applications. This project will provide new approaches, insights and results for probabilistic combinatorics. This area has contributed in exciting ways elsewhere in mathematics and provides versatile tools of widespread use in algorithmic computer science, with other applications in physics, coding theory for communications, and genetics.
A new model for random discrete structures: distributions, counting and sampling. Random discrete structures are used in countless applications across science for modelling complex systems. This project will study a new, very general model of random discrete structures which encapsulates both random networks and random matrices. This project will develop general tools for working with this model, thereby unlocking the model for use by practitioners in areas such as physics, biology, statistics a ....A new model for random discrete structures: distributions, counting and sampling. Random discrete structures are used in countless applications across science for modelling complex systems. This project will study a new, very general model of random discrete structures which encapsulates both random networks and random matrices. This project will develop general tools for working with this model, thereby unlocking the model for use by practitioners in areas such as physics, biology, statistics and cryptography. The questions that will be tackled are fundamental problems in probability, and include as special cases the analysis of subgraph distribution in models of random networks, and the joint distribution of entries of contingency tables, which are important in statistics.Read moreRead less
Chromatic polynomials, random graphs, and error-correcting codes: a unified approach to graph colouring problems. Through a unified approach involving cutting-edge results on chromatic polynomials, random graphs, matroids, and error-correcting codes, this project will establish the foundations for a rigorous mathematical framework for attempting to provide a short, transparent and illuminating solution to the Four Colour Problem. The project will support developments in computer science and sta ....Chromatic polynomials, random graphs, and error-correcting codes: a unified approach to graph colouring problems. Through a unified approach involving cutting-edge results on chromatic polynomials, random graphs, matroids, and error-correcting codes, this project will establish the foundations for a rigorous mathematical framework for attempting to provide a short, transparent and illuminating solution to the Four Colour Problem. The project will support developments in computer science and statistical mechanics and is likely to have flow-on effects in real-world disciplines such as network communication. This project will also strengthen Australia's international presence in discrete mathematics and will further strengthen ties between Australian and international mathematicians.Read moreRead less
Asymptotic Geometric Analysis and Machine Learning. Phenomena in large dimensions appear in a number of domains of Mathematics and adjacent domains of science (e.g. Computer Science), dealing with functions of infinitely growing number of parameters. Here, we focus on several questions naturally linked to Asymptotic Geometric Analysis which have natural applications to Statistical Learning Theory. We intend to use geometric, probabilistic and combinatorial methods to investigate these problems, ....Asymptotic Geometric Analysis and Machine Learning. Phenomena in large dimensions appear in a number of domains of Mathematics and adjacent domains of science (e.g. Computer Science), dealing with functions of infinitely growing number of parameters. Here, we focus on several questions naturally linked to Asymptotic Geometric Analysis which have natural applications to Statistical Learning Theory. We intend to use geometric, probabilistic and combinatorial methods to investigate these problems, with an emphasis on modern tools in Empirical Processes Theory and the theory of Random Matrices.Read moreRead less
Random Structures and Asymptotics. Discrete random structures have many uses in algorithms in computer science (for instance, random networks modelling computer link-ups), biology (for instance, random sequences modelling DNA) and engineering. New techniques for studying these structures will lead to powerful new results on their properties. The emphasis will be on the behaviour of the random structures when their size becomes large. With the advent of
more powerful computing techniques, it is ....Random Structures and Asymptotics. Discrete random structures have many uses in algorithms in computer science (for instance, random networks modelling computer link-ups), biology (for instance, random sequences modelling DNA) and engineering. New techniques for studying these structures will lead to powerful new results on their properties. The emphasis will be on the behaviour of the random structures when their size becomes large. With the advent of
more powerful computing techniques, it is often the large-scale behaviour which has relevance to the more diffucult computations being undertaken. The results are also of potential application to other areas of mathematics.Read moreRead less