On the Cover Time for Random Walks on Random Graphs. - Johan Jonasson (Comb. Probab. Comput., 1998)

An upper bound on the cover time for powers of graphs. - Johan Jonasson (Discret. Math., 2000)

Lollipop graphs are extremal for commute times. - Johan Jonasson (Random Struct. Algorithms, 2000)

Percolation in a dependent random environment. - Johan Jonasson; Elchanan Mossel; Yuval Peres (Random Struct. Algorithms, 2000)

Positive Influence and Negative Dependence. - Devdatt P. Dubhashi; Johan Jonasson; Desh Ranjan (Comb. Probab. Comput., 2007)

Slow mixing for Latent Dirichlet allocation. - Johan Jonasson (CoRR, 2017)

Bayesian leave-one-out cross-validation for large data. - Måns Magnusson; Michael Riis Andersen; Johan Jonasson; Aki Vehtari (ICML, 2019)

Optimal sampling in unbiased active learning. - Henrik Imberg; Johan Jonasson; Marina Axelson-Fisk (AISTATS, 2020)

Leave-One-Out Cross-Validation for Bayesian Model Comparison in Large Data. - Måns Magnusson; Aki Vehtari; Johan Jonasson; Michael Riis Andersen (AISTATS, 2020)

Rapid mixing in unimodal landscapes and efficient simulatedannealing for multimodal distributions. - Johan Jonasson; Måns Magnusson (CoRR, 2021)

Robust Neural Network Classification via Double Regularization. - Olof Zetterqvist; Rebecka Jörnsten; Johan Jonasson (CoRR, 2021)

Noise Sensitivity and Stability of Deep Neural Networks for Binary Classification. - Johan Jonasson; Jeffrey E. Steif; Olof Zetterqvist (CoRR, 2023)

Elastic Gradient Descent, an Iterative Optimization Method Approximating the Solution Paths of the Elastic Net. - Oskar Allerbo; Johan Jonasson; Rebecka Jörnsten (J. Mach. Learn. Res., 2023)

Variational Quantum Optimization with Continuous Bandits. - Marc Wanner; Johan Jonasson; Emil Carlsson; Devdatt P. Dubhashi (CoRR, 2025)