-
Participate in seminars, workshops, and conferences related to combinatorics and graph theory The successful candidate will hold a PhD in Mathematics or a closely related discipline, with a strong background in
-
. Applicants with training in quantitative and empirical research and experience in requirements engineering, safety-critical systems, or AI/ML/LLMs/Knowledge Graphs are especially encouraged to apply. This PhD
-
is like Ockham's razor, seeking a simple theory that fits the data well. It can also be thought of as file compression - where data has structure, it is more likely to compress, and the greater
-
The relationship between the information-theoretic Bayesian minimum message length (MML) principle and the notion of Solomonoff-Kolmogorov complexity from algorithmic information theory (Wallace and
-
). "Statistical field theory applied to complex networks” "Quantum geometrogenesis – Graph theoretic approaches to building spacetime” web page For further details or to discuss alternative project arrangements
-
to code, preferably in C, C++ or Rust, is also necessary. Candidates with experience or interest in cutting planes, polyhedral geometry and graph theory are especially invited to apply. A fully-funded
-
Aim/outline Graphs or networks are effective tools to representing a variety of data in different domains. In the biological domain, chemical compounds can be represented as networks, with atoms as