Sort by
Refine Your Search
-
Listed
-
Category
-
Program
-
Employer
- Imperial College London
- KINGS COLLEGE LONDON
- King's College London
- ;
- AALTO UNIVERSITY
- DURHAM UNIVERSITY
- Durham University
- London Institute for Mathematical Sciences;
- UNIVERSITY OF SURREY
- University of Birmingham;
- University of Cambridge;
- University of Sheffield
- University of Surrey
- University of Warwick
- 4 more »
- « less
-
Field
-
chains, random graphs and trees, random matrix theory, stochastic and Lévy processes in infinite-dimensional spaces, free probability, random sphere packings in high dimensions. About the role You will
-
including: * Algorithmic game theory * Approximation algorithms * Automata and formal languages * Combinatorics and graph algorithms * Computational complexity * Logic and games * Online and dynamic
-
chains, random graphs and trees, random matrix theory, stochastic and Lévy processes in infinite-dimensional spaces, free probability, random sphere packings in high dimensions. About the role You will
-
chains, random graphs and trees, random matrix theory, stochastic and Lévy processes in infinite-dimensional spaces, free probability, random sphere packings in high dimensions. About the role You will
-
particle systems, and mixing times of Markov chains, random graphs and trees, random matrix theory, stochastic and Lévy processes in infinite-dimensional spaces, free probability, random sphere packings in
-
counterfactual reasoning frameworks that uncover latent mechanisms and enable principled hypothesis testing. Our goal is to advance the theory of representation learning and causal inference in high-dimensional
-
probability, allow for the application of tools from probability theory to combinatorial problems and motivate the study of the typical properties of various combinatorial models, such as the Erdős–Rényi random
-
understanding of routing algorithms (e.g., Dijkstra, A*) and graph theory, Preferably knowledgeable in the Arc Routing Problem, Vehicle Routing Problem, Rural Postman Problem, Travelling Salesman Problem, etc
-
understanding of routing algorithms (e.g., Dijkstra, A*) and graph theory, Preferably knowledgeable in the Arc Routing Problem, Vehicle Routing Problem, Rural Postman Problem, Travelling Salesman Problem, etc
-
. You will: Develop and apply novel graph learning based methods for predicting the synthesisability of organic molecules Develop and apply novel neurosymbolic AI methods to chemical problems If appointed