Svante Janson

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 62

Top Venues

CoRR

Random Struct. Algorithms

Comb. Probab. Comput.

Electron. J. Comb.

Publications

Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
Phragmén's voting methods and justified representation. Math. Program. 203 (1) (2024)
Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
Fringe Trees for Random Trees with Given Vertex Degrees. AofA (2024)
Philippe Jacquet, Svante Janson
Depth-First Search Performance in Random Digraphs. AofA (2024)
Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. Adv. Appl. Math. 155 (2024)
Svante Janson, Jérémie O. Lumbroso, Robert Sedgewick
Bit-Array-Based Alternatives to HyperLogLog. AofA (2024)
Svante Janson
The number of descendants in a random directed acyclic graph. Random Struct. Algorithms 64 (3) (2024)
Svante Janson
On Semi-Restricted Rock, Paper, Scissors. Electron. J. Comb. 31 (2) (2024)
Svante Janson
On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution. CoRR (2023)
Bhaswar B. Bhattacharya, Anirban Chatterjee, Svante Janson
Fluctuations of subgraph counts in graphon based random graphs. Comb. Probab. Comput. 32 (3) (2023)
Svante Janson, Valentas Kurauskas
Estimating Global Subgraph Counts by Sampling. Electron. J. Comb. 30 (2) (2023)
Svante Janson
The Number of Occurrences of Patterns in a Random Tree or Forest Permutation. Electron. J. Comb. 30 (2) (2023)
Svante Janson
The number of descendants in a random directed acyclic graph. CoRR (2023)
Gabriel Berzunza Ojeda, Svante Janson
The distance profile of rooted and unrooted simply generated trees. Comb. Probab. Comput. 31 (3) (2022)
Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. CoRR (2022)
Svante Janson, Gregory B. Sorkin
Successive minimum spanning trees. Random Struct. Algorithms 61 (1) (2022)
Philippe Jacquet, Svante Janson
Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution. AofA (2022)
Svante Janson
On convergence for graphexes. Eur. J. Comb. 104 (2022)
Philippe Jacquet, Svante Janson
Depth-First Search performance in a random digraph with geometric outdegree distribution. CoRR (2022)
Svante Janson, Wojciech Szpankowski
Hidden Words Statistics for Large Patterns. Electron. J. Comb. 28 (2) (2021)
Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
Phragmén's Voting Methods and Justified Representation. CoRR (2021)
Svante Janson
Tree limits and limits of random trees. Comb. Probab. Comput. 30 (6) (2021)
Svante Janson
Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns. Algorithmica 82 (3) (2020)
Svante Janson, Wojciech Szpankowski
Hidden Words Statistics for Large Patterns. AofA (2020)
Antar Bandyopadhyay, Svante Janson, Debleena Thacker
Strong convergence of infinite color balanced urns under uniform ergodicity. J. Appl. Probab. 57 (3) (2020)
Svante Janson
Asymptotic normality in random graphs with given vertex degrees. Random Struct. Algorithms 56 (4) (2020)
Svante Janson
Random graphs with given vertex degrees and switchings. Random Struct. Algorithms 57 (1) (2020)
Svante Janson
A graphon counter example. Discret. Math. 343 (6) (2020)
Svante Janson, Wojciech Szpankowski
Hidden Words Statistics for Large Patterns. CoRR (2020)
Svante Janson
Rate of convergence for traditional Pólya urns. J. Appl. Probab. 57 (4) (2020)
Svante Janson
Central limit theorems for additive functionals and fringe trees in tries. CoRR (2020)
Remco van der Hofstad, Svante Janson, Malwina J. Luczak
Component structure of the configuration model: Barely supercritical case. Random Struct. Algorithms 55 (1) (2019)
Daniel Ahlberg, Maria Deijfen, Svante Janson
Competing first passage percolation on random graphs with finite variance degrees. Random Struct. Algorithms 55 (3) (2019)
Svante Janson, Lutz Warnke
Preferential attachment without vertex growth: emergence of the giant component. CoRR (2019)
Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. 28 (3) (2019)
Svante Janson, Robert Kozma, Miklós Ruszinkó, Yury Sokolov
A modified bootstrap percolation on a random graph coupled with a lattice. Discret. Appl. Math. 258 (2019)
Svante Janson
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees. Comb. Probab. Comput. 28 (1) (2019)
Svante Janson
Patterns in random permutations avoiding the pattern 321. Random Struct. Algorithms 55 (2) (2019)
Daniel Ahlberg, Simon Griffiths, Svante Janson, Robert Morris
Competition in growth and urns. Random Struct. Algorithms 54 (2) (2019)
Svante Janson, Gregory B. Sorkin
Successive Minimum Spanning Trees. APPROX-RANDOM (2019)
Svante Janson
Thresholds quantifying proportionality criteria for election methods. CoRR (2018)
Xing Shi Cai, Svante Janson
Non-Fringe Subtrees in Conditioned Galton - Watson Trees. Electron. J. Comb. 25 (3) (2018)
Svante Janson
Patterns in Random Permutations Avoiding Some Other Patterns (Keynote Speakers). AofA (2018)
Hamed Hatami, Svante Janson, Balázs Szegedy
Graph properties, graph limits, and entropy. J. Graph Theory 87 (2) (2018)
Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
Inversions in Split Trees and Conditional Galton-Watson Trees. AofA (2018)
Svante Janson, Subhabrata Sen, Joel Spencer
Preferential Attachment When Stable. CoRR (2018)
Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
Phragmén's Voting Methods and Justified Representation. AAAI (2017)
Svante Janson
Patterns in Random Permutations Avoiding the Pattern 132. Comb. Probab. Comput. 26 (1) (2017)
Graham R. Brightwell, Svante Janson, Malwina J. Luczak
The Greedy Independent Set in a Random Graph with Given Degrees. Random Struct. Algorithms 51 (4) (2017)
Cecilia Holmgren, Svante Janson, Matas Sileikis
Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees. Electron. J. Comb. 24 (2) (2017)
Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications. ACM Trans. Algorithms 13 (4) (2017)
Béla Bollobás, Svante Janson, Alex Scott
Packing random graphs and hypergraphs. Random Struct. Algorithms 51 (1) (2017)
Svante Janson, Andrew J. Uzzell
On String Graph Limits and the Structure of a Typical String Graph. J. Graph Theory 84 (4) (2017)
Svante Janson, Lutz Warnke
The lower tail: Poisson approximation revisited. Random Struct. Algorithms 48 (2) (2016)
Svante Janson
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. Random Struct. Algorithms 48 (1) (2016)
Svante Janson
Phragmén's and Thiele's election methods. CoRR (2016)
Svante Janson
Graph limits and hereditary properties. Eur. J. Comb. 52 (2016)
Svante Janson, Alfredo Viola
A Unified Approach to Linear Probing Hashing with Buckets. Algorithmica 75 (4) (2016)
Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer
On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. 25 (1) (2016)
Svante Janson, Vera T. Sós
More on quasi-random graphs, subgraph counts and graph limits. Eur. J. Comb. 46 (2015)
Svante Janson
-dependent variables. J. Appl. Probab. 52 (4) (2015)
Svante Janson
Maximal Clades in Random Binary Search Trees. Electron. J. Comb. 22 (1) (2015)
Svante Janson
On the tails of the limiting Quicksort distribution. CoRR (2015)
Svante Janson, Malwina J. Luczak, Peter Windridge
Law of large numbers for the SIR epidemic on a random graph with given degrees. Random Struct. Algorithms 45 (4) (2014)
Svante Janson, Andrew J. Uzzell
On the Typical Structure of Graphs in a Monotone Property. Electron. J. Comb. 21 (3) (2014)
Svante Janson
The probability that a random multigraph is simple. II. J. Appl. Probab. 51 (A) (2014)
Svante Janson
Asymptotic bias of some election methods. Ann. Oper. Res. 215 (1) (2014)
Pawel Hitczenko, Svante Janson
Weighted Random Staircase Tableaux. Comb. Probab. Comput. 23 (6) (2014)
Louigi Addario-Berry, Svante Janson, Colin McDiarmid
On the Spread of Random Graphs. Comb. Probab. Comput. 23 (4) (2014)
Svante Janson, Alfredo Viola
A unified approach to linear probing hashing with buckets. CoRR (2014)
Pawel Hitczenko, Svante Janson
Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences. LATIN (2014)
Abram Magner, Svante Janson, Giorgios Kollias, Wojciech Szpankowski
On Symmetry of Uniform and Preferential Attachment Graphs. Electron. J. Comb. 21 (3) (2014)
Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto
Graphs where every k-subset of vertices is an identifying set. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Svante Janson, Gregory B. Sorkin
VCG Auction Mechanism Cost Expectations and Variances. CoRR (2013)
Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie
Coupon collecting and transversals of hypergraphs. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
E. Rodney Canfield, Svante Janson, Doron Zeilberger
Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124]. Adv. Appl. Math. 49 (1) (2012)
Svante Janson, Oliver Riordan
Susceptibility in Inhomogeneous Random Graphs. Electron. J. Comb. 19 (1) (2012)
Svante Janson
Renewal theory in the analysis of tries and strings. Theor. Comput. Sci. 416 (2012)
Svante Janson, Svante Linusson
The Probability of the Alabama Paradox. J. Appl. Probab. 49 (3) (2012)
James Allen Fill, Svante Janson, Mark Daniel Ward
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf CoRR (2012)
James Allen Fill, Svante Janson
The number of bit comparisons used by Quicksort: an average-case analysis CoRR (2012)
James Allen Fill, Svante Janson, Mark Daniel Ward
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. Electron. J. Comb. 19 (2) (2012)
Svante Janson
Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems. Electron. J. Comb. 19 (3) (2012)
Svante Janson, Yuval Peres
Hitting Times for Random Walks with Restarts. SIAM J. Discret. Math. 26 (2) (2012)
Béla Bollobás, Svante Janson, Oliver Riordan
Monotone Graph Limits and Quasimonotone Graphs. Internet Math. 8 (3) (2012)
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO (2011)
Luc Devroye, Svante Janson
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. Random Struct. Algorithms 38 (4) (2011)
Béla Bollobás, Svante Janson, Oliver Riordan
Sparse random graphs with clustering. Random Struct. Algorithms 38 (3) (2011)
E. Rodney Canfield, Svante Janson, Doron Zeilberger
The Mahonian probability distribution on words is asymptotically normal. Adv. Appl. Math. 46 (1-4) (2011)
Béla Bollobás, Svante Janson, Oliver Riordan
On covering by translates of a set. Random Struct. Algorithms 38 (1-2) (2011)
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
On Vertex, Edge, and Vertex-Edge Random Graphs. Electron. J. Comb. 18 (1) (2011)
Svante Janson
Poset limits and exchangeable random posets. Comb. 31 (5) (2011)
Svante Janson, Markus Kuba, Alois Panholzer
Generalized Stirling permutations, families of increasing trees and urn models. J. Comb. Theory, Ser. A 118 (1) (2011)
Sven Erick Alm, Svante Janson, Svante Linusson
Correlations for paths in random orientations of G(n, p) and G(n, m). Random Struct. Algorithms 39 (4) (2011)
Svante Janson
Quasi-random graphs and graph limits. Eur. J. Comb. 32 (7) (2011)
Svante Janson, Oliver Riordan
Duality in inhomogeneous random graphs, and the cut metric. Random Struct. Algorithms 39 (3) (2011)
Svante Janson
A divertent generating function that can be summed and analysed analytically. Discret. Math. Theor. Comput. Sci. 12 (2) (2010)
Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. 19 (5-6) (2010)
Svante Janson
Asymptotic equivalence and contiguity of some random graphs. Random Struct. Algorithms 36 (1) (2010)
Geoffrey R. Grimmett, Svante Janson
Random graphs with forbidden vertex degrees. Random Struct. Algorithms 37 (2) (2010)
Svante Janson
Renewal theory in analysis of tries and strings CoRR (2009)

Svante Janson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Svante Janson