Jakob Hofstad
Jakob Hofstad is a postdoc in the Theoretical Computer Science and Discrete Mathematics research group at the University of Heidelberg. His research has been so far mainly focused on extremal properties of the random graph G(n,p), including concentration results, and using the differential equation method for random graph processes.
Contact
Im Neuenheimer Feld 205
69120 Heidelberg
Germany
Office: 2/212
e-mail: hofstad (at) informatik.uni-heidelberg (dot) de
Phone +49 6221 54-14324
Publications
Concentration of the largest induced tree size of G(n,p) around the standard expectation threshold,
submitted.
A note on Two-Point Concentration of the Independence Number of G(n,m),
with T. Bohman,
submitted.
Behavior of the Minimum Degree Throughout the d-process,
Combinatorics, Probability and Computing, 33.5 (2024), 564-582.
Two-Point Concentration of the Independence Number of the Random Graph,
with T. Bohman,
Forum of Mathematics, Sigma, 12 (2024), e24.
A Critical Probability for Biclique Partition of G(n,p),
with T. Bohman,
Journal of Combinatorial Theory, Series B, 12 (2024), 50-79.
Linear Factorization of Hypercyclic Functions for Differential Operators,
with K. Chan and D. Walmsley,
Journal of Mathematical Analysis and Applications, 485.2 (2020), 123804.
