Tobias Müller
I am an assistant professor at the mathematical institute
of Utrecht University.
Before joining Utrecht University, I was a researcher at the Centrum Wiskunde & Informatica (CWI).
Prior to that I did postdocs in Eindhoven and in Tel Aviv, and before that I did my doctorate in Oxford
under the supervision of Colin McDiarmid.
Before starting my doctorate, I worked for a couple of years as a statistical consultant at CANdiensten b.v.
I organize the Stochastics Seminar in
Utrecht.
Teaching
This term, I am teaching the first year undergraduate course Inleiding Kansrekening en Statistiek (WISB161) and the "olympic seminar" (WISB305).
This last course is joint with Frits Beukers and Gunther Cornelissen.
Courses I have been involved in earlier include
the third year undergraduate course "Kaleidoscoop 2" (WISB303), the third year undergraduate course
Project (WISB302), the master course
Probabilistic and Extremal
Combinatorics (WISM561)
(the latter course is joint with Ross Kang), and the master course Modern Theory of Markov Chains (WISS133).
The Markov chains course is currently in the able hands of Siamak Taati.
Research
I work in combinatorics and probability. My research interests include graphs in various
flavours (random, extremal, coloured, fractional), percolation, discrete and stochastic geometry,
random matrices, asymptotic and probabilistic combinatorics and combinatorial games.
Here are preprint versions of some of my research articles.
 T. Müller,
Two point concentration in random geometric graphs,
Combinatorica, Volume 28, Issue 5, Pages 529545;

T. Müller, R.J. Waters,
Circular choosability is rational,
Journal of Combinatorial Theory series B, Volume 99, Issue 5, Pages 801813;

R.W. van der Hofstad, W. Kager, T. Müller,
A local limit theorem for the critical random graph,
Electronic Communications in Probability, Volume 14, Pages 122131;

J. Balogh, B. Bollobás, M. Krivelevich, T. Müller, M. Walters,
Hamilton cycles in random geometric graphs,
Annals of Applied Probability, Volume 21, Issue 3, Pages 10531072.
(A preprint  with only one coauthor 
on the arxiv.);

M. Basavaraju, L.S. Chandran, N. Cohen, F. Havet, T. Müller,
Acyclic edgecolouring of planar graphs, SIAM journal on discrete mathematics, Volume 25, Issue 2, Pages 463478.
(Preliminary version  with only two coauthors  in Eurocomb 2009);
 R.A. Hauser, T. Müller,
Conditioning of random conic systems under a general family of input distributions,
Foundations of Computational Mathematics, Volume 9, Issue 3, Pages 335358.
(A preprint version in the Oxford University Numerical Analysis techreport series with some results that did not make it to the
final version.);

L. AddarioBerry, R.J. Kang, T. Müller,
Acyclic dominating partitions,
Journal of Graph Theory, Volume 64, Issue 5, Pages 292311;

R.J. Kang, T. Müller,
Frugal, acyclic and star colourings of graphs,
Discrete Applied Mathematics, Volume 159, Issue 16, Pages 18061814;

M. Bradonjic, T. Müller, A. G. Percus,
Coloring geographical threshold graphs,
Discrete Mathematics & Theoretical Computer Science, Vol 12, No 3, Pages 103114;

T. Müller, A. Pór, J.S. Sereni,
Graphs with four boundary vertices, Electronic journal of Combinatorics, Volume 18, Issue 1, Paper 11, 18 pages;
 F. Havet, R.J. Kang, T. Müller, J.S. Sereni,
Circular choosability, Journal of Graph Theory, Volume 61, Issue 4 , Pages 241  270;
 T. Müller, A. Pór, J.S. Sereni,
Bounding the boundary by the minimum and the maximum degree, Discrete Mathematics, Volume 308, Issue 24, Pages 65816583;
 T. Müller, J.S. Sereni,
Identifying and locatingdominating codes in (random) geometric networks, Combinatorics, Probability and Computing, Volume 18, Issue 6, Pages 925952;
 R.J. Kang, T. Müller, J.S. Sereni,
Improper colouring of (random) unit disk graphs,
Discrete Mathematics, Volume 308, Issue 8, Pages 14381454;

T. Müller, X. PérezGiménez, N. Wormald,
Disjoint Hamilton cycles in the random geometric graph,
Journal of Graph Theory, Volume 68, Issue 4, pages 299–322;

R.J. Kang, L. Lovász, T. Müller, E.R. Scheinerman,
Dot product representations of planar graphs, Electronic Journal of Combinatorics, Volume 18, Issue 1, Paper 216, 14 pages.
(preliminary version  with only one coauthor  in GD 2010);
 C.J.H. McDiarmid, T. Müller,
On the chromatic number of random geometric graphs,
Combinatorica, Volume 31, Number 4, Pages 423488;

R.J. Kang, T. Müller,
Sphere and dot product
representations of graphs, Discrete and Computational Geometry, Volume 47, Number 3, Pages 548568.
(Preliminary version in SoCG 2011);
 A. Beveridge, A. Dudek, A. Frieze, T. Müller,
Cops and robbers on geometric graphs,
Combinatorics, Probability and Computing, Volume 21, Issue 06, Pages 816834;

R.J. Kang, M. Mnich, T. Müller,
Induced matchings in subcubic planar graphs, SIAM Journal on Discrete Mathematics, Volume 26, Issue 3, Pages 1383–1411.
(preliminary version in ESA 2010);

C.J.H. McDiarmid, T. Müller,
Integer realizations of disk
and segment graphs, Journal of Combinatorial Theory Series B,
Volume 103, Issue 1, Pages 114–143.
(Preliminary version in WG 2010);

T. Müller, E. J. van Leeuwen, J. van Leeuwen,
Integer Representations of Convex
Polygon Intersection Graphs,
SIAM Jounal on Discrete Mathematics, Volume 27, Issue 1, Pages 205–231.
(Preliminary version in SoCG 2011);

C.J.H. McDiarmid, T. Müller,
The number of disk graphs, European Journal of Combinatorics, Volume 35, Pages 413–431;
 T. Müller,
A counterexample to a conjecture of Grünbaum on piercing convex sets in the plane,
Discrete Mathematics, Volume 313, Issue 24, Pages 2868–2871;
 T. Müller, M. Stojakovic,
A threshold for the MakerBreaker Clique game,
Random Structures and Algorithms, to appear;

R.J. Kang, T. Müller,
Arrangements of pseudocircles and circles, Discrete and Computational Geometry, to appear;
 T. Müller,
The asymptotic distribution of the scan statistic,
submitted;

T. Müller, R. Spöhel,
A geometric Achlioptas process, submitted;

A. Beveridge, A. Dudek, A. Frieze, T. Müller, M. Stojakovic,
MakerBreaker games on random geometric graphs, submitted;

T. Müller, P. Pralat,
The acquaintance time of (percolated) random geometric graphs, submitted;

P. Heinig, T. Müller, M. Noy, A. Taraz,
Logical limit laws for minorclosed classes of graphs, submitted.
(A supporting document for this paper can be found here.)

M. Bode, M. Fountoulakis, T. Müller,
The probability that the hyperbolic random graph is connected, submitted.
People with Müller number 1
L. AddarioBerry,
J. Balogh,
M. Basavaraju,
A. Beveridge,
M. Bode,
B. Bollobás,
M. Bradonjic,
L.S. Chandran,
N. Cohen,
A. Dudek,
N. Fountoulakis,
A.M. Frieze,
R.A. Hauser,
F. Havet,
P. Heinig,
R.W. van der Hofstad,
W. Kager,
R.J. Kang,
M. Krivelevich,
E.J. van Leeuwen,
J. van Leeuwen,
L. Lovász,
C.J.H. McDiarmid,
M. Mnich,
M. Noy,
A. Percus,
X. PérezGiménez,
A. Pór,
P. Pralat,
E.R. Scheinerman,
J.S. Sereni,
R. Spöhel,
M. Stojakovic,
A. Taraz,
M. Walters,
R.J. Waters,
N. Wormald.
Past workshop organization
For nostalgic reasons, I still maintain a link to the
website of the Stochastic Acitivity Month on Combinatorics and Probability which took place in January 2014.
(Activities included a workshop on "Probability and Graphs" and minicourses
on graph limits, analysis of Boolean functions and Probabilistic aspects of Minimal Spanning Trees); a link to the website of the
Utrecht Graphs Workshop which took place on Thursday 31 October and Friday 1 November 2013;
the website of the STAR Workshop on Random Graphs that took place in Utrecht on 1 and 2 November 2012, the website of a workshop on probabilistic and algebraic methods in discrete
mathematics that took place in Amsterdam on 6 December 2010, and a link to the
webpage of the Postgraduate Combinatorial Conference 2005 that took place on 2123 March 2005 in Oxford.
Contact details
Email: t.muller at uu dot nl
Address for correspondence: 
Mathematical Institute Universiteit Utrecht P.O. Box 80010 3508 TA Utrecht The Netherlands.


