Here are some of my talks (mathematical and others) available as pdf files.
Most talks are based on one or several of my papers
(existing or future),
see the links below and the
complete list of papers.

Variations of Ustatistics with applications to random strings and random
permutations.
28th Nordic Congress of Mathematicians, Helsinki, August 2022.
Based on
[287],
[332],
[333],
[360],
and
[367].

DepthFirst Search performance in a random digraph with geometric
degree distribution.
Aofa2022, Philadelphia (virtual), June 2022.
Based on
[364].

Flajolet Lecture: The sum of powers of subtrees sizes for random trees.
Aofa2022, Philadelphia (virtual), June 2022.
Based on
[359].

Problem med proportionella val av kommunala nämnder:
matematiken bakom två kuppförsök i Uppsala 2018.
Kollokvium, Uppsala,
2 December 2021.
Based on
[V11].

The number of occurrences of patterns and constrained patterns in a
random permutation.
BIRS, Banff, Canada (virtual),
23 September, 2021.
Based on
[333]
and
[360].

A stochastic SIR model on a random network with given vertex degrees.
Mathematical Models for Prediction and Control of Epidemics,
MSRI, Berkeley (virtual workshop),
14 August, 2020.
Based on
[282]
and
[300].

Patterns in random permutations avoiding some patterns.
Combinatorics and Random Processes,
Institut MittagLeffler, Djursholm,
31 January, 2020.
Based on
[290],
[324],
and
[333].

Random trees and branching processes.
12th Vilnius Conference and 2018 IMS Annual Meeting,
Vilnius, 5 July, 2018.
Based on
[264],
[306],
and
[330].

Patterns in random permutations avoiding some patterns.
Aofa2018, Uppsala, June 2018.
Based on
[290],
[324].
and
[333].

Branching processes and random trees.
StoUpp, Stockholm, 28 May 2018.
Based on
[264],
[306]
and
[330].

Random permutations avoiding some patterns.
Knuth80, Piteå, January, 2018.
Based on
[290]
and
[324].

Branching processes and random trees.
Modern perspectives of branching in probability,
Münster, September, 2017.
Based on
[264]
and
[306].

Random networks.
European Young Statisticians Meeting, Uppsala, 1418 August, 2017.

Vertex exchangeable and edge exchangeable random graphs.
Random Structures & Algorithms, Gniezno, 711 August, 2017.

The greedy independent set in a random graph with given degrees.
27th Nordic Congress of Mathematicians,
Stockholm, 1620 March, 2016.
Based on
[304].

Asymptotic normality of fringe subtrees and additive functionals
in conditioned GaltonWatson trees.
AofA'14, Paris, June 2014.
Based on
[285].

Ändringar i Sveriges valsystem.
Uppsala, 11 April 2014.

Random graphs.
Colloquium, Stockholm, 29 January 2014.

An epidemic on a random graph with given vertex degrees.
Random Structures and Algorithms (RS&A2013), Poznan, 5 August 2013.
Based on
[282].

Graph properties, graph limits and entropy.
Erdös Centennial, Budapest, 4 July 2013.
Based on
[288].

Simply generated trees, conditioned GaltonWatson trees,
random allocations and condensation.
26th Nordic and 1st EuropeanNordic Congress, Lund, June 2013.
Based on
[264].

Weighted random staircase tableaux.
AofA'13, Menorca, May 2013.
Based on
[276].

Påskräkning förr och nu. När är det påsk, och varför just då?
Gustavianum, Uppsala, 16 mars 2013

Simply generated trees, conditioned GaltonWatson trees,
random allocations and condensation.
AofA'12, Montreal, June 2012.
Based on
[264].

Proportionalitet och utjämningsmandat.
2011 års vallagskommitté, 19 januari 2012.

Szemerédis regularity lemma and graph limits.
Symposium in honor of the Abel Prize Laureate 2012,
Royal Swedish Academy of Sciences, Stockholm, 25 May 2012.

Bootstrap percolation on random graphs.
16th INFORMS Applied Probability Conference, Stockholm, 8 July 2011.
Based on
[251].

The probability of the Alabama paradox.
AofA'11, Bedlewo, Poland, 16 June 2011.
Based on
[258].

Probabilistic studies of election methods.
Workshop on electoral methods, KTH, Stockholm, 30 May 2011.
Based on
[262]
and
[258].

Renewal theory in analysis of tries and strings.
AofA'10, Vienna, 29 June 2010.
Based on
[242].