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.
Australian Laureate Fellowships - Grant ID: FL200100141
Funder
Australian Research Council
Funding Amount
$3,077,547.00
Summary
Real groups and the Langlands program. This program aims to address deep longstanding questions about real groups, algebraic objects which describe the basic symmetries occurring in nature. The study of these basic symmetries is central in all areas of mathematics and they come up in many applications. The expected outcomes include solving a central 50 year old problem of unitarity as well as making major progress in the Langlands program, a grand unification scheme of mathematics. The benefits ....Real groups and the Langlands program. This program aims to address deep longstanding questions about real groups, algebraic objects which describe the basic symmetries occurring in nature. The study of these basic symmetries is central in all areas of mathematics and they come up in many applications. The expected outcomes include solving a central 50 year old problem of unitarity as well as making major progress in the Langlands program, a grand unification scheme of mathematics. The benefits include raising Australia's international research profile, building a large network of international collaboration with top institutions in the world, and increasing capacity in number theory and algebraic geometry, which are playing an ever more important role in technology. Read moreRead less
Australian Laureate Fellowships - Grant ID: FL220100005
Funder
Australian Research Council
Funding Amount
$3,350,000.00
Summary
CellMaps for cell fate decision making systems. The cell is the fundamental unit exhibiting the hallmarks of life. The cell is also a fantastically intricate and complex system: its behaviour is shaped by molecular networks and processes that regulate cellular physiology, and the response of the cell to its environment. This Laureate Fellowship aims to describe and make sense of this complexity mathematically. At this sub-cellular level stochasticity and complex non-linear feedbacks are all perv ....CellMaps for cell fate decision making systems. The cell is the fundamental unit exhibiting the hallmarks of life. The cell is also a fantastically intricate and complex system: its behaviour is shaped by molecular networks and processes that regulate cellular physiology, and the response of the cell to its environment. This Laureate Fellowship aims to describe and make sense of this complexity mathematically. At this sub-cellular level stochasticity and complex non-linear feedbacks are all pervasive. Building on recent advances in mathematics, statistics, theoretical physics, and data science will result in mathematical models of cells, CellMaps, that will generate mechanistic insights into the fundamental dynamical processes underlying cell fate decision making and differentiation. Read moreRead less
Australian Laureate Fellowships - Grant ID: FL140100012
Funder
Australian Research Council
Funding Amount
$2,830,000.00
Summary
Stress-testing algorithms: generating new test instances to elicit insights. Stress-testing algorithms: generating new test instances to elicit insights. This project aims to develop a new paradigm in algorithm testing, creating novel test instances and tools to elicit insights into algorithm strengths and weaknesses. Such advances are urgently needed to support good research practice in academia, and to avoid disasters when deploying algorithms in practice. Extending our recent work in algorith ....Stress-testing algorithms: generating new test instances to elicit insights. Stress-testing algorithms: generating new test instances to elicit insights. This project aims to develop a new paradigm in algorithm testing, creating novel test instances and tools to elicit insights into algorithm strengths and weaknesses. Such advances are urgently needed to support good research practice in academia, and to avoid disasters when deploying algorithms in practice. Extending our recent work in algorithm testing for combinatorial optimisation, described as 'ground-breaking,' this project aims to tackle the challenges needed to generalise the paradigm to other fields such as machine learning, forecasting, software testing, and other branches of optimisation. An online repository of test instances and tools aim to provide a valuable resource to improve research practice and support new insights into algorithm performance.Read moreRead less