Some talks by Svante Janson, Department of Mathematics, Uppsala University.

• The number of descendants in a random directed acyclic graph. 22nd Random Structures and Algorithms, Vienna, 5 August, 2025 Based on [374] and [391].
• Valsystem, matematik och några oväntade problem i de senaste valen. Uppsala Senioruniversitet, Uppsala, 27 mars 2025.
• The critical beta-splitting random tree: exchangeable partitions and Mellin transform analysis. Uppsala, 22 January, 2025. Based on [389] and [390].
• The maximum number of coupons for the coupon collector. Uppsala, 17 October, 2024. Based on [395].
• The number of descendants in a random directed acyclic graph. Random Graphs and Complex Networks, Eurandom, Eindhoven, 2 September, 2024. Based on [374].
• Semirestricted Rock, Paper, Scissors. Uppsala, 22 February, 2024. Based on [381].
• Strong limit laws for triangular Pólya urns. Uppsala, 19 October, 2023. Based on [380].
• The sum of powers of subtrees sizes for random trees. 70 Years of Percolation [in honour of Geoffrey Grimmett], Cambridge, 24 July, 2023. Based on [359] and [371].
• The number of descendants in a random directed acyclic graph. NORDSTAT 2023, Gothenburg, 21 June, 2023. Based on [374].
• The number of descendants in a random directed acyclic graph. Uppsala, 9 March, 2023. Based on [374].
• Uncovering a graph. Uppsala, 10 November, 2022. Based on [379]
• Depth-First Search performance in a random digraph with geometric degree distribution. James Norris 60, Cambridge, 6 September 2022. This pdf was combined with blackboard. See also Aofa2022 for another version. Based on [364].
• Variations of U-statistics with applications to random strings and random permutations. 28th Nordic Congress of Mathematicians, Helsinki, August 2022. Based on [287], [332], [333], [360], and [367].
• Depth-First 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].
• Asymptotic normality for m-dependent and constrained U-statistics, with applications to pattern matching in random strings and permutations Uppsala, 30 September, 2021 (virtual). Based on [360].
• 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].
• The sum of powers of subtree sizes of conditioned Galton-Watson trees. Uppsala, 18 February, 2021 (virtual). Based on [359].
• On general subtrees of a conditioned Galton-Watson tree. Uppsala, 26 November, 2020 (virtual). Based on [355].
• 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].
• Central limit theorems for additive functionals and fringe trees in tries. Uppsala, 20 February, 2020. Based on [347].
• Patterns in random permutations avoiding some patterns. Combinatorics and Random Processes, Institut Mittag-Leffler, Djursholm, 31 January, 2020. Based on [290], [324], and [333].
• IMS Medallion Lecture: 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. Sto-Upp, 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, 14-18 August, 2017.
• Vertex exchangeable and edge exchangeable random graphs. Random Structures & Algorithms, Gniezno, 7-11 August, 2017.
• The greedy independent set in a random graph with given degrees. 27th Nordic Congress of Mathematicians, Stockholm, 16-20 March, 2016. Based on [304].
• Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson 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 Galton--Watson trees, random allocations and condensation. 26th Nordic and 1st European-Nordic 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 Galton--Watson 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].