Stein's method for probability approximation. Data of counts in time, such as incoming calls in telecommunications and the clusters of palindromes in a family of herpes-virus genomes, arise in an extraordinarily diverse range of fields from science to business. These problems can be modelled by sums of random variables taking values 0 and 1 in probability theory, thus permitting approximate calculations which are often good enough in practice. This project will obtain such approximate solutions ....Stein's method for probability approximation. Data of counts in time, such as incoming calls in telecommunications and the clusters of palindromes in a family of herpes-virus genomes, arise in an extraordinarily diverse range of fields from science to business. These problems can be modelled by sums of random variables taking values 0 and 1 in probability theory, thus permitting approximate calculations which are often good enough in practice. This project will obtain such approximate solutions and estimate the errors involved. Applications include analysis of data in insurance, finance, flood prediction in hydrology.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
Random walks with long memory. This project aims to study novel random walk models with long memory, including systems of multiple random walkers that interact through their environment. This would provide a mathematical understanding of phenomena such as aggregation in colonies of bacteria, and ant colony optimisation algorithms. The project aims to produce highly cited publications, and to train future researchers.
Quantum decoherence: A game-theoretic perspective. Algorithms based on quantum computation have the ability to significantly speed up information processing compared to standard computers. The increase in computational power can have enormous impact on humankind and this project will help maintain Australia's position in the global forefront of this effort.This project focuses on the thoeretical foundations of quantum computation and complements the efforts of several groups in Australia collabo ....Quantum decoherence: A game-theoretic perspective. Algorithms based on quantum computation have the ability to significantly speed up information processing compared to standard computers. The increase in computational power can have enormous impact on humankind and this project will help maintain Australia's position in the global forefront of this effort.This project focuses on the thoeretical foundations of quantum computation and complements the efforts of several groups in Australia collaborating on the experimental design of quantum computers. The project will increase the fundamental understanding of how quantum information is processed in the presence of noise, which is necessary for the successful operation of quantum computers. Read moreRead less
Characteristic polynomials in random matrix theory. Random matrix theory is the subject of an active international research effort, due to its broad range of applications including the statistical analysis of high-dimensional data sets, wireless communication, and the celebrated Riemann zeros in prime number theory. Characteristic polynomials will be used to focus an attack on these problems.
Discovery Early Career Researcher Award - Grant ID: DE140101201
Funder
Australian Research Council
Funding Amount
$366,404.00
Summary
Planar Brownian motion and complex analysis. This project will study a number of related problems concerning both Brownian motion and complex analysis. These include questions about Brownian exit time, conformally invariant processes such as Stochastic Loewner Evolution, and the fundamentals of complex analysis. Many of these questions are at the forefront of modern probability theory. The outcomes of this project will bring the questions considered into a position of prominence in the fields of ....Planar Brownian motion and complex analysis. This project will study a number of related problems concerning both Brownian motion and complex analysis. These include questions about Brownian exit time, conformally invariant processes such as Stochastic Loewner Evolution, and the fundamentals of complex analysis. Many of these questions are at the forefront of modern probability theory. The outcomes of this project will bring the questions considered into a position of prominence in the fields of probability and analysis, and bring international attention to Australia as a hub of important research.Read moreRead less
Random network models with applications in biology. Complex biological systems consist of a large number of interacting agents or components, and so can be studied using mathematical random network models. We aim to gain deeper insights into the laws emerging as the random networks evolve in time. This can help us to deal with dangerous disease epidemics and better understand the human brain.
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.
Random Discrete Structures: Approximations and Applications. The behaviour of many real world systems can be modelled by random discrete structures evolving over time. For example, the sizes of populations of frogs in some close patches of forests can be modelled as interacting random processes. The aim of the project is to investigate large discrete random structures that arise from real world application in areas such as biology, complex networks and insurance. The proposed project is at the i ....Random Discrete Structures: Approximations and Applications. The behaviour of many real world systems can be modelled by random discrete structures evolving over time. For example, the sizes of populations of frogs in some close patches of forests can be modelled as interacting random processes. The aim of the project is to investigate large discrete random structures that arise from real world application in areas such as biology, complex networks and insurance. The proposed project is at the interface of mathematics and 'big data' applications and so the work of the project aims to provide theoretical and heuristic underpinnings useful in the algorithms and techniques of practitioners. Understanding the applications in the project requires new, broadly applicable methods and developing such is a complementary aim.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE210101581
Funder
Australian Research Council
Funding Amount
$411,000.00
Summary
Stability and Complexity: New insights from Random Matrix Theory. Complexity is a rule of nature: large ecosystems, the human brain, and turbulent fluids are merely a few examples of complex systems. This project aims to study and classify criteria of stability in large complex systems based on universal probabilistic models. This project expects to generate new important understanding of stability using cutting-edge techniques from random matrix theory. Expected outcomes of this project includ ....Stability and Complexity: New insights from Random Matrix Theory. Complexity is a rule of nature: large ecosystems, the human brain, and turbulent fluids are merely a few examples of complex systems. This project aims to study and classify criteria of stability in large complex systems based on universal probabilistic models. This project expects to generate new important understanding of stability using cutting-edge techniques from random matrix theory. Expected outcomes of this project include development and expansion of an innovative mathematical framework and techniques which allow a unified and universal approach to the question of stability in large complex systems. Read moreRead less