معرفی
Brendan McKay is a Professor in the School of Computing at the Australian National University (ANU), where he conducts research at the intersection of mathematics and computing. His work is deeply rooted in combinatorics, graph theory, and probabilistic methods in discrete structures.
His research interests span a wide range of topics in discrete mathematics, including random graphs, asymptotic enumeration, Hamiltonian cycles, planar and bipartite graphs, matrix theory, and computational combinatorics. His work often combines theoretical depth with algorithmic applications, particularly in the analysis of complex networks and discrete systems.
The recent publications (2015–2025) reflect a sustained focus on asymptotic enumeration techniques, structural properties of graphs, and algorithmic challenges in graph isomorphism and distance queries. Key themes include the use of probabilistic tools (e.g., cumulant expansions, martingales), enumeration under degree constraints, and symmetry-preserving operations on maps. His collaborations frequently involve researchers such as Mikhail Isaev, Catherine Greenhill, and Qing Wang.
Scientific Awards and Recognitions:
- Fellow, Australian Mathematical Society (2000 → …)
- Fellow, Australian Academy of Science (1997 → …)
McKay has led and co-led several major research projects, including Deep Learning for Graph Isomorphism and Hypergraph models for complex discrete systems, demonstrating leadership in both theoretical and applied directions. He has not explicitly listed advisees, but his role as Principal Investigator (PI) on multiple projects indicates active mentorship and grant leadership. His work often involves interdisciplinary applications in bioinformatics and network science.
He is associated with research groups and projects focused on graph algorithms, random discrete structures, and computational combinatorics, often in collaboration with the mathematical sciences community at ANU and beyond.
