Svante Janson

The Generalized Alice HH Vs Bob HT Problem

Janson, Svante; Nica, Mihai; Segert, Simon

Part of Journal of theoretical probability, 2025

• DOI for The Generalized Alice HH Vs Bob HT Problem

Moments of Balanced Pólya Urns

Janson, Svante

Part of Journal of theoretical probability, 2025

• DOI for Moments of Balanced Pólya Urns
• Download full text (pdf) of Moments of Balanced Pólya Urns

Fringe Trees for Random Trees With Given Vertex Degrees

Berzunza Ojeda, Gabriel; Holmgren, Cecilia; Janson, Svante

Part of Random structures & algorithms (Print), 2025

• DOI for Fringe Trees for Random Trees With Given Vertex Degrees
• Download full text (pdf) of Fringe Trees for Random Trees With Given Vertex Degrees

Approximation of subgraph counts in the uniform attachment model

Björklund, Johan; Holmgren, Cecilia; Janson, Svante; Lo, Tiffany Y. Y.

Part of Combinatorics, probability & computing, 2025

• DOI for Approximation of subgraph counts in the uniform attachment model
• Download full text (pdf) of Approximation of subgraph counts in the uniform attachment model

The critical beta-splitting random tree IV: Mellin analysis of leaf height

Aldous, David; Janson, Svante

Part of Electronic Journal of Probability, 2025

• DOI for The critical beta-splitting random tree IV: Mellin analysis of leaf height
• Download full text (pdf) of The critical beta-splitting random tree IV: Mellin analysis of leaf height

The Generalized Alice HH Vs Bob HT Problem

Janson, Svante; Nica, Mihai; Segert, Simon

Part of Journal of theoretical probability, 2025

• DOI for The Generalized Alice HH Vs Bob HT Problem

Moments of Balanced Pólya Urns

Janson, Svante

Part of Journal of theoretical probability, 2025

• DOI for Moments of Balanced Pólya Urns
• Download full text (pdf) of Moments of Balanced Pólya Urns

Fringe Trees for Random Trees With Given Vertex Degrees

Berzunza Ojeda, Gabriel; Holmgren, Cecilia; Janson, Svante

Part of Random structures & algorithms (Print), 2025

• DOI for Fringe Trees for Random Trees With Given Vertex Degrees
• Download full text (pdf) of Fringe Trees for Random Trees With Given Vertex Degrees

Approximation of subgraph counts in the uniform attachment model

Björklund, Johan; Holmgren, Cecilia; Janson, Svante; Lo, Tiffany Y. Y.

Part of Combinatorics, probability & computing, 2025

• DOI for Approximation of subgraph counts in the uniform attachment model
• Download full text (pdf) of Approximation of subgraph counts in the uniform attachment model

The critical beta-splitting random tree IV: Mellin analysis of leaf height

Aldous, David; Janson, Svante

Part of Electronic Journal of Probability, 2025

• DOI for The critical beta-splitting random tree IV: Mellin analysis of leaf height
• Download full text (pdf) of The critical beta-splitting random tree IV: Mellin analysis of leaf height

Bit-array-based alternatives to HyperLogLog

Janson, Svante; Lumbroso, Jérémie; Sedgewick, Robert

Part of Theoretical Computer Science, 2025

• DOI for Bit-array-based alternatives to HyperLogLog
• Download full text (pdf) of Bit-array-based alternatives to HyperLogLog

Consistent random vertex-orderings of graphs

Balister, Paul N.; Bollobas, Bela; Janson, Svante

Part of Journal of the European Mathematical Society (Print), p. 2623-2652, 2025

• DOI for Consistent random vertex-orderings of graphs
• Download full text (pdf) of Consistent random vertex-orderings of graphs

Depth-First Search Performance in a Random Digraph with Geometric Outdegree Distribution

Jacquet, Philippe; Janson, Svante

Part of MATEMATICA, p. 262-292, 2024

• DOI for Depth-First Search Performance in a Random Digraph with Geometric Outdegree Distribution
• Download full text (pdf) of Depth-First Search Performance in a Random Digraph with Geometric Outdegree Distribution

Conditioned Galton–Watson Trees: The Shape Functional, and More on the Sum of Powers of Subtree Sizes and Its Mean

Fill, James Allen; Janson, Svante; Wagner, Stephan

Part of La Matematica, p. 435-508, 2024

• DOI for Conditioned Galton–Watson Trees: The Shape Functional, and More on the Sum of Powers of Subtree Sizes and Its Mean
• Download full text (pdf) of Conditioned Galton–Watson Trees: The Shape Functional, and More on the Sum of Powers of Subtree Sizes and Its Mean

Central limit theorem for components in meandric systems through high moments

Janson, Svante; Thevenin, Paul

Part of Combinatorics, probability & computing, p. 597-610, 2024

• DOI for Central limit theorem for components in meandric systems through high moments
• Download full text (pdf) of Central limit theorem for components in meandric systems through high moments

The harmonic descent chain

Aldous, David J.; Janson, Svante; Li, Xiaodan

Part of Electronic Communications in Probability, 2024

• DOI for The harmonic descent chain
• Download full text (pdf) of The harmonic descent chain

On semi-restricted Rock, Paper, Scissors

Janson, Svante

Part of The Electronic Journal of Combinatorics, 2024

• DOI for On semi-restricted Rock, Paper, Scissors
• Download full text (pdf) of On semi-restricted Rock, Paper, Scissors

Quantitative bounds in the central limit theorem for m-dependent random variables

Janson, Svante; Pratelli, Luca; Rigo, Pietro

Part of Latin American Journal of Probability and Mathematical Statistics, p. 245-265, 2024

• DOI for Quantitative bounds in the central limit theorem for m-dependent random variables
• Download full text (pdf) of Quantitative bounds in the central limit theorem for m-dependent random variables

Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

Hwang, Hsien-Kuei; Janson, Svante; Tsai, Tsung-Hsi

Part of Advances in Applied Mathematics, 2024

• DOI for Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

On a central limit theorem in renewal theory

Janson, Svante

Part of Statistics and Probability Letters, 2024

• DOI for On a central limit theorem in renewal theory
• Download full text (pdf) of On a central limit theorem in renewal theory

The number of descendants in a random directed acyclic graph

Janson, Svante

Part of Random structures & algorithms (Print), p. 768-803, 2024

• DOI for The number of descendants in a random directed acyclic graph
• Download full text (pdf) of The number of descendants in a random directed acyclic graph

Phragmén's voting methods and justified representation

Brill, Markus; Freeman, Rupert; Janson, Svante; Lackner, Martin

Part of Mathematical programming, p. 47-76, 2024

• DOI for Phragmén's voting methods and justified representation
• Download full text (pdf) of Phragmén's voting methods and justified representation

Fluctuations of subgraph counts in graphon based random graphs

Bhattacharya, Bhaswar B.; Chatterjee, Anirban; Janson, Svante

Part of Combinatorics, probability & computing, p. 428-464, 2023

• DOI for Fluctuations of subgraph counts in graphon based random graphs

Fluctuations of balanced urns with infinitely many colours

Janson, Svante; Mailler, Cecile; Villemonais, Denis

Part of Electronic Journal of Probability, p. 1-72, 2023

• DOI for Fluctuations of balanced urns with infinitely many colours
• Download full text (pdf) of Fluctuations of balanced urns with infinitely many colours

Asymptotic normality for M-dependent and constrained U -statistics, with applications to pattern matching in random strings and permutations

Janson, Svante

Part of Advances in Applied Probability, p. 841-894, 2023

• DOI for Asymptotic normality for M-dependent and constrained U -statistics, with applications to pattern matching in random strings and permutations

The number of occurrences of patterns in a random tree or forest permutation

Janson, Svante

Part of The Electronic Journal of Combinatorics, 2023

• DOI for The number of occurrences of patterns in a random tree or forest permutation
• Download full text (pdf) of The number of occurrences of patterns in a random tree or forest permutation

Estimating global subgraph counts by sampling

Janson, Svante; Kurauskas, Valentas

Part of The Electronic Journal of Combinatorics, 2023

• DOI for Estimating global subgraph counts by sampling
• Download full text (pdf) of Estimating global subgraph counts by sampling

Unicellular maps vs. hyperbolic surfaces in large genus: Simple closed curves

Janson, Svante; Louf, Baptiste

Part of Annals of Probability, p. 899-929, 2023

• DOI for Unicellular maps vs. hyperbolic surfaces in large genus: Simple closed curves

The sum of powers of subtree sizes for conditioned Galton-Watson trees

Fill, James Allen; Janson, Svante

Part of Electronic Journal of Probability, 2022

• DOI for The sum of powers of subtree sizes for conditioned Galton-Watson trees
• Download full text (pdf) of The sum of powers of subtree sizes for conditioned Galton-Watson trees

Central limit theorems for additive functionals and fringe trees in tries

Janson, Svante

Part of Electronic Journal of Probability, p. 1-63, 2022

• DOI for Central limit theorems for additive functionals and fringe trees in tries
• Download full text (pdf) of Central limit theorems for additive functionals and fringe trees in tries

Successive minimum spanning trees

Janson, Svante; Sorkin, Gregory B.

Part of Random structures & algorithms (Print), p. 126-172, 2022

• DOI for Successive minimum spanning trees

On convergence for graphexes

Janson, Svante

Part of European journal of combinatorics (Print), 2022

• DOI for On convergence for graphexes
• Download full text (pdf) of On convergence for graphexes

Minimal matchings of point processes

Holroyd, Alexander E.; Janson, Svante; Wästlund, Johan

Part of Probability theory and related fields, p. 571-611, 2022

• DOI for Minimal matchings of point processes
• Download full text (pdf) of Minimal matchings of point processes

The distance profile of rooted and unrooted simply generated trees

Berzunza Ojeda, Gabriel; Janson, Svante

Part of Combinatorics, probability & computing, p. 368-410, 2022

• DOI for The distance profile of rooted and unrooted simply generated trees
• Download full text (pdf) of The distance profile of rooted and unrooted simply generated trees

Continuous-time digital search tree and a border aggregation model

Janson, Svante; Thacker, Debleena

Part of Bernoulli, p. 2563-2577, 2022

• DOI for Continuous-time digital search tree and a border aggregation model

Short cycles in high genus unicellular maps

Janson, Svante; Louf, Baptiste

Part of Annales de l'I.H.P. Probabilites et statistiques, p. 1547-1564, 2022

• DOI for Short cycles in high genus unicellular maps

Can smooth graphons in several dimensions be represented by smooth graphons on [0, 1]?

Janson, Svante; Olhede, Sofia

Part of EXAMPLES AND COUNTEREXAMPLES, 2021

• DOI for Can smooth graphons in several dimensions be represented by smooth graphons on [0, 1]?

Tensor norms on ordered normed spaces, polarization constants, and exchangeable distributions

Janson, Svante

Part of Mathematische Nachrichten, p. 1484-1522, 2021

• DOI for Tensor norms on ordered normed spaces, polarization constants, and exchangeable distributions

Preferential attachment without vertex growth: Emergence of the giant component

Janson, Svante; Warnke, Lutz

Part of The Annals of Applied Probability, p. 1523-1547, 2021

• DOI for Preferential attachment without vertex growth: Emergence of the giant component

On general subtrees of a conditioned Galton-Watson tree

Janson, Svante

Part of Electronic Communications in Probability, 2021

• DOI for On general subtrees of a conditioned Galton-Watson tree
• Download full text (pdf) of On general subtrees of a conditioned Galton-Watson tree

TO FIXATE OR NOT TO FIXATE IN TWO-TYPE ANNIHILATING BRANCHING RANDOM WALKS

Ahlberg, Daniel; Griffiths, Simon; Janson, Svante

Part of Annals of Probability, p. 2637-2667, 2021

• DOI for TO FIXATE OR NOT TO FIXATE IN TWO-TYPE ANNIHILATING BRANCHING RANDOM WALKS

On the probability that a binomial variable is at most its expectation

Janson, Svante

Part of Statistics and Probability Letters, 2021

• DOI for On the probability that a binomial variable is at most its expectation
• Download full text (pdf) of On the probability that a binomial variable is at most its expectation

Tree limits and limits of random trees

Janson, Svante

Part of Combinatorics, probability & computing, p. 849-893, 2021

• DOI for Tree limits and limits of random trees
• Download full text (pdf) of Tree limits and limits of random trees

On distance covariance in metric and Hilbert spaces

Janson, Svante

Part of Latin American Journal of Probability and Mathematical Statistics, p. 1353-1393, 2021

• DOI for On distance covariance in metric and Hilbert spaces

The Space D in Several Variables: Random Variables and Higher Moments

Janson, Svante

Part of Mathematica Scandinavica, p. 544-584, 2021

• DOI for The Space D in Several Variables: Random Variables and Higher Moments

Hidden Words Statistics for Large Patterns

Janson, Svante; Szpankowskit, Wojciech

Part of The Electronic Journal of Combinatorics, 2021

• DOI for Hidden Words Statistics for Large Patterns
• Download full text (pdf) of Hidden Words Statistics for Large Patterns

A.s. convergence for infinite colour Pólya urns associated with random walks

Janson, Svante

Part of Arkiv för matematik, p. 87-123, 2021

• DOI for A.s. convergence for infinite colour Pólya urns associated with random walks

On the independence number of some random trees

Janson, Svante

Part of Electronic Communications in Probability, 2020

• DOI for On the independence number of some random trees

Asymptotic normality in random graphs with given vertex degrees

Janson, Svante

Part of Random structures & algorithms (Print), p. 1070-1116, 2020

• DOI for Asymptotic normality in random graphs with given vertex degrees

Mean and variance of balanced Pólya urns

Janson, Svante

Part of Advances in Applied Probability, p. 1224-1248, 2020

• DOI for Mean and variance of balanced Pólya urns

Rate of convergence for traditional Polya urns

Janson, Svante

Part of Journal of Applied Probability, p. 1029-1044, 2020

• DOI for Rate of convergence for traditional Polya urns

Strong convergence of infinite color balanced urns under uniform ergodicity

Bandyopadhyay, Antar; Janson, Svante; Thacker, Debleena

Part of Journal of Applied Probability, p. 853-865, 2020

• DOI for Strong convergence of infinite color balanced urns under uniform ergodicity

Random graphs with given vertex degrees and switchings

Janson, Svante

Part of Random structures & algorithms (Print), p. 3-31, 2020

• DOI for Random graphs with given vertex degrees and switchings

A graphon counter example

Janson, Svante

Part of Discrete Mathematics, 2020

• DOI for A graphon counter example

Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns

Janson, Svante

Part of Algorithmica, p. 616-641, 2020

• DOI for Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns
• Download full text (pdf) of Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns

The hiring problem with rank-based strategies

Janson, Svante

Part of Electronic Journal of Probability, 2019

• DOI for The hiring problem with rank-based strategies
• Download full text (pdf) of The hiring problem with rank-based strategies

Random replacements in Polya urns with infinitely many colours

Janson, Svante

Part of Electronic Communications in Probability, 2019

• DOI for Random replacements in Polya urns with infinitely many colours
• Download full text (pdf) of Random replacements in Polya urns with infinitely many colours

Preferential attachment when stable

Janson, Svante; Sen, Subhabrata; Spencer, Joel

Part of Advances in Applied Probability, p. 1067-1108, 2019

• DOI for Preferential attachment when stable

A piecewise contractive dynamical system and Phragmèn's election method

Janson, Svante; Öberg, Anders

Part of Bulletin de la Société Mathématique de France, p. 395-441, 2019

• DOI for A piecewise contractive dynamical system and Phragmèn's election method

Competing first passage percolation on random graphs with finite variance degrees

Ahlberg, Daniel; Deijfen, Maria; Janson, Svante

Part of Random structures & algorithms (Print), p. 545-559, 2019

• DOI for Competing first passage percolation on random graphs with finite variance degrees

Patterns in random permutations avoiding the pattern 321

Janson, Svante

Part of Random structures & algorithms (Print), p. 249-270, 2019

• DOI for Patterns in random permutations avoiding the pattern 321

Component structure of the configuration model: Barely supercritical case

van der Hofstad, Remco; Janson, Svante; Luczak, Malwina

Part of Random structures & algorithms (Print), p. 3-55, 2019

• DOI for Component structure of the configuration model: Barely supercritical case
• Download full text (pdf) of Component structure of the configuration model: Barely supercritical case

Inversions in Split Trees and Conditional Galton-Watson Treest

Cai, Xing Shi; Holmgren, Cecilia; Janson, Svante; Johansson, Tony et al.

Part of Combinatorics, probability & computing, p. 335-364, 2019

• DOI for Inversions in Split Trees and Conditional Galton-Watson Treest

A modified bootstrap percolation on a random graph coupled with a lattice

Janson, Svante; Kozma, Robert; Ruszinko, Miklos; Sokolov, Yury

Part of Discrete Applied Mathematics, p. 152-165, 2019

• DOI for A modified bootstrap percolation on a random graph coupled with a lattice

Long Term Behaviour of a Reversible System of Interacting Random Walks

Janson, Svante; Shcherbakov, Vadim; Volkov, Stanislav

Part of Journal of statistical physics, p. 71-96, 2019

• DOI for Long Term Behaviour of a Reversible System of Interacting Random Walks
• Download full text (pdf) of Long Term Behaviour of a Reversible System of Interacting Random Walks

Competition in growth and urns

Ahlberg, Daniel; Griffiths, Simon; Janson, Svante; Morris, Robert

Part of Random structures & algorithms (Print), p. 211-227, 2019

• DOI for Competition in growth and urns

Random Recursive Trees and Preferential Attachment Trees are Random Split Trees

Janson, Svante

Part of Combinatorics, probability & computing, p. 81-99, 2019

• DOI for Random Recursive Trees and Preferential Attachment Trees are Random Split Trees

Renewal theory for asymmetric U-statistics

Janson, Svante

Part of Electronic Journal of Probability, 2018

• DOI for Renewal theory for asymmetric U-statistics
• Download full text (pdf) of Renewal theory for asymmetric U-statistics

On the critical probability in percolation

Janson, Svante; Warnke, Lutz

Part of Electronic Journal of Probability, 2018

• DOI for On the critical probability in percolation
• Download full text (pdf) of On the critical probability in percolation

Moment convergence of balanced Polya processes

Janson, Svante; Pouyanne, Nicolas

Part of Electronic Journal of Probability, 2018

• DOI for Moment convergence of balanced Polya processes

Asymptotics Of Fluctuations In Crump-Mode-Jagers Processes: The Lattice Case

Janson, Svante

Part of Advances in Applied Probability, p. 141-171, 2018

• DOI for Asymptotics Of Fluctuations In Crump-Mode-Jagers Processes: The Lattice Case

Sesqui-type branching processes

Janson, Svante; Riordan, Oliver; Warnke, Lutz

Part of Stochastic Processes and their Applications, p. 3628-3655, 2018

• DOI for Sesqui-type branching processes

On Edge Exchangeable Random Graphs

Janson, Svante

Part of Journal of statistical physics, p. 448-484, 2018

• DOI for On Edge Exchangeable Random Graphs
• Download full text (pdf) of On Edge Exchangeable Random Graphs

Non-fringe subtrees in conditioned Galton-Watson trees

Cai, Xing Shi; Janson, Svante

Part of The Electronic Journal of Combinatorics, 2018

• Download full text (pdf) of Non-fringe subtrees in conditioned Galton-Watson trees

Tail bounds for sums of geometric and exponential variables

Janson, Svante

Part of Statistics and Probability Letters, p. 1-6, 2018

• DOI for Tail bounds for sums of geometric and exponential variables

Graph properties, graph limits, and entropy

Hatami, Hamed; Janson, Svante; Szegedy, Balazs

Part of Journal of Graph Theory, p. 208-229, 2018

• DOI for Graph properties, graph limits, and entropy

Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees

Holmgren, Cecilia; Janson, Svante

Part of Probability Surveys, p. 53-154, 2017

• DOI for Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
• Download full text (pdf) of Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees

On String Graph Limits and the Structure of a Typical String Graph

Janson, Svante; Uzzell, Andrew J.

Part of Journal of Graph Theory, p. 386-407, 2017

• DOI for On String Graph Limits and the Structure of a Typical String Graph

Patterns in Random Permutations Avoiding the Pattern 132

Janson, Svante

Part of Combinatorics, probability & computing, p. 24-51, 2017

• DOI for Patterns in Random Permutations Avoiding the Pattern 132

The Greedy Independent Set in a Random Graph with Given Degrees

Brightwell, Graham; Janson, Svante; Luczak, Malwina

Part of Random structures & algorithms (Print), p. 565-586, 2017

• DOI for The Greedy Independent Set in a Random Graph with Given Degrees

Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications

Hwang, Hsien-Kuei; Janson, Svante; Tsai, Tsung-Hsi

Part of ACM Transactions on Algorithms, 2017

• DOI for Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications

Multivariate normal limit laws for the numbers of fringe subtrees in m-ary search trees and preferential attachment trees

Holmgren, Cecilia; Janson, Svante; Sileikis, Matas

Part of The Electronic Journal of Combinatorics, 2017

Packing Random Graphs and Hypergraphs

Bollobas, Bela; Janson, Svante; Scott, Alex

Part of Random structures & algorithms (Print), p. 3-13, 2017

• DOI for Packing Random Graphs and Hypergraphs

Near-critical SIR epidemic on a random graph with given degrees

Janson, Svante; Luczak, Malwina; Windridge, Peter; House, Thomas

Part of Journal of Mathematical Biology, p. 843-886, 2017

• DOI for Near-critical SIR epidemic on a random graph with given degrees
• Download full text (pdf) of Near-critical SIR epidemic on a random graph with given degrees

On the Length of a Random Minimum Spanning Tree

Cooper, Colin; Frieze, Alan; Ince, Nate; Janson, Svante et al.

Part of Combinatorics, probability & computing, p. 89-107, 2016

• DOI for On the Length of a Random Minimum Spanning Tree

Asymptotic Normality of Fringe Subtrees and Additive Functionals in Conditioned Galton-Watson Trees

Janson, Svante

Part of Random structures & algorithms (Print), p. 57-101, 2016

• DOI for Asymptotic Normality of Fringe Subtrees and Additive Functionals in Conditioned Galton-Watson Trees

The lower tail: Poisson approximation revisited

Janson, Svante; Warnke, Lutz

Part of Random structures & algorithms (Print), p. 219-246, 2016

• DOI for The lower tail: Poisson approximation revisited

Graph limits and hereditary properties

Janson, Svante

Part of European journal of combinatorics (Print), p. 321-337, 2016

• DOI for Graph limits and hereditary properties

The inverse first-passage problem and optimal stopping

Ekström, Erik; Janson, Svante

Part of The Annals of Applied Probability, p. 3154-3177, 2016

• DOI for The inverse first-passage problem and optimal stopping

Influence in product spaces

Grimmett, Geoffrey R.; Janson, Svante; Norris, James R.

Part of Advances in Applied Probability, p. 145-152, 2016

• DOI for Influence in product spaces

On a representation theorem for finitely exchangeable random vectors

Janson, Svante; Konstantopoulos, Takis; Yuan, Linglong

Part of Journal of Mathematical Analysis and Applications, p. 703-714, 2016

• DOI for On a representation theorem for finitely exchangeable random vectors

A Unified Approach to Linear Probing Hashing with Buckets

Janson, Svante; Viola, Alfredo

Part of Algorithmica, p. 724-781, 2016

• DOI for A Unified Approach to Linear Probing Hashing with Buckets

Asymptotic distribution of two-protected nodes in ternary search trees

Holmgren, Cecilia; Janson, Svante

Part of Electronic Journal of Probability, 2015

• DOI for Asymptotic distribution of two-protected nodes in ternary search trees

Limit laws for functions of fringe trees for binary search trees and random recursive trees

Holmgren, Cecilia; Janson, Svante

Part of Electronic Journal of Probability, 2015

• DOI for Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Download full text (pdf) of Limit laws for functions of fringe trees for binary search trees and random recursive trees

On the tails of the limiting Quicksort distribution

Janson, Svante

Part of Electronic Communications in Probability, p. 1-7, 2015

• DOI for On the tails of the limiting Quicksort distribution
• Download full text (pdf) of On the tails of the limiting Quicksort distribution

On the asymptotic statistics of the number of occurrences of multiple permutation patterns

Janson, Svante; Nakamura, Brian; Zeilberger, Doron

Part of Journal of Combinatorics, p. 117-143, 2015

• DOI for On the asymptotic statistics of the number of occurrences of multiple permutation patterns

Scaling limits of random planar maps with a unique large face

Janson, Svante; Stefánsson, Sigurdur Örn

Part of Annals of Probability, p. 1045-1081, 2015

• DOI for Scaling limits of random planar maps with a unique large face

Maximal clades in random binary search trees

Janson, Svante

Part of The Electronic Journal of Combinatorics, 2015

More on quasi-random graphs, subgraph counts and graph limits

Janson, Svante; Sos, Vera T.

Part of European journal of combinatorics (Print), p. 134-160, 2015

• DOI for More on quasi-random graphs, subgraph counts and graph limits

Superboolean rank and the size of the largest triangular submatrix of a random matrix

Izhakian, Zur; Janson, Svante; Rhodes, John

Part of Proceedings of the American Mathematical Society, p. 407-418, 2015

• DOI for Superboolean rank and the size of the largest triangular submatrix of a random matrix

Feynman-Kac Theorems for Generalized Diffusions

Ekström, Erik; Janson, Svante; Tysk, Johan

Part of Transactions of the American Mathematical Society, p. 8051-8070, 2015

Asymptotic Distribution Of The Maximum Interpoint Distance In A Sample Of Random Vectors With A Spherically Symmetric Distribution

Jammalamadaka, Sreenivasa Rao; Janson, Svante

Part of The Annals of Applied Probability, p. 3571-3591, 2015

• DOI for Asymptotic Distribution Of The Maximum Interpoint Distance In A Sample Of Random Vectors With A Spherically Symmetric Distribution
• Download full text (pdf) of Asymptotic Distribution Of The Maximum Interpoint Distance In A Sample Of Random Vectors With A Spherically Symmetric Distribution

ON DEGENERATE SUMS OF m-DEPENDENT VARIABLES

Janson, Svante

Part of Journal of Applied Probability, p. 1146-1155, 2015

Higher moments of Banach space valued random variables

Janson, Svante; Kaijser, Sten

Part of Memoirs of the American Mathematical Society, p. 1-110, 2015

• DOI for Higher moments of Banach space valued random variables

First critical probability for a problem on random orientations in G(n,p)

Alm, Sven Erick; Janson, Svante; Linusson, Svante

Part of Electronic Journal of Probability, p. 69, 2014

• DOI for First critical probability for a problem on random orientations in G(n,p)
• Download full text (pdf) of First critical probability for a problem on random orientations in G(n,p)

Bootstrap percolation on Galton-Watson trees

Bollobas, Bela; Gunderson, Karen; Holmgren, Cecilia; Janson, Svante et al.

Part of Electronic Journal of Probability, p. 1-27, 2014

• DOI for Bootstrap percolation on Galton-Watson trees
• Download full text (pdf) of Bootstrap percolation on Galton-Watson trees

Protected nodes and fringe subtrees in some random trees

Devroye, Luc; Janson, Svante

Part of Electronic Communications in Probability, p. 1-10, 2014

• DOI for Protected nodes and fringe subtrees in some random trees
• Download full text (pdf) of Protected nodes and fringe subtrees in some random trees

Graphs where every k-subset of vertices is an identifying set

Gravier, Sylvain; Janson, Svante; Laihonen, Tero; Ranto, Sanna

Part of Discrete Mathematics & Theoretical Computer Science, p. 73-88, 2014

Law of Large Numbers for the SIR Epidemic on a Random Graph with Given Degrees

Janson, Svante; Luczak, Malwina; Windridge, Peter

Part of Random structures & algorithms (Print), p. 724-761, 2014

• DOI for Law of Large Numbers for the SIR Epidemic on a Random Graph with Given Degrees

Asymptotic bias of some election methods

Janson, Svante

Part of Annals of Operations Research, p. 89-136, 2014

• DOI for Asymptotic bias of some election methods

Weighted Random Staircase Tableaux

Hitczenko, Pawel; Janson, Svante

Part of Combinatorics, probability & computing, p. 1114-1147, 2014

• DOI for Weighted Random Staircase Tableaux

On the Spread of Random Graphs

Addario-Berry, Louigi; Janson, Svante; McDiarmid, Colin

Part of Combinatorics, probability & computing, p. 477-504, 2014

• DOI for On the Spread of Random Graphs

On the Typical Structure of Graphs in a Monotone Property

Janson, Svante; Uzzell, Andrew J.

Part of The Electronic Journal of Combinatorics, 2014

On Symmetry of Uniform and Preferential Attachment Graphs

Magner, Abram; Janson, Svante; Kollias, Giorgos; Szpankowski, Wojciech

Part of The Electronic Journal of Combinatorics, 2014

The probability that a rqandom multigraph is simple II

Janson, Svante

Part of Journal of Applied Probability, p. 123-137, 2014

Graphons, cut norm and distance, couplings and rearrangements

Janson, Svante

Part of New York Journal of Mathematics, 2013

Euler-Frobenius numbers and rounding

Janson, Svante

Part of Online Journal of Analytic Combinatorics, 2013

Moments of the location of the maximum of Brownian motion with parabolic drift

Janson, Svante

Part of Electronic Communications in Probability, p. 1-8, 2013

• DOI for Moments of the location of the maximum of Brownian motion with parabolic drift

Coupon collecting and transversals of hypergraphs

Wild, Marcel; Janson, Svante; Wagner, Stephan; Laurie, Dirk

Part of Discrete Mathematics & Theoretical Computer Science, p. 259-270, 2013

Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees

Addario-Berry, Louigi; Devroye, Luc; Janson, Svante

Part of Annals of Probability, p. 1072-1087, 2013

• DOI for Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees

Can time-homogeneous diffusions produce any distribution?

Ekström, Erik; Hobson, David; Janson, Svante; Tysk, Johan

Part of Probability theory and related fields, p. 493-520, 2013

• DOI for Can time-homogeneous diffusions produce any distribution?

Interval Graph Limits

Diaconis, Persi; Holmes, Susan; Janson, Svante

Part of Annals of Combinatorics, p. 27-52, 2013

• DOI for Interval Graph Limits

Note on a partition limit theorem for rank and crank

Diaconis, Persi; Janson, Svante; Rhoades, Robert C.

Part of Bulletin of the London Mathematical Society, p. 551-553, 2013

• DOI for Note on a partition limit theorem for rank and crank

An example of graph limits of growing sequences of random graphs

Janson, Svante; Severini, Simone

Part of Journal of Combinatorics, p. 67-80, 2013

The number of bit comparisons used by Quicksort: an average-case analysis

Fill, James Allen; Janson, Svante

Part of Electronic Journal of Probability, p. 43, 2012

• DOI for The number of bit comparisons used by Quicksort: an average-case analysis

Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation

Janson, Svante

Part of Probability Surveys, p. 103-252, 2012

The probability of the Alabama paradox

Janson, Svante; Linusson, Svante

Part of Journal of Applied Probability, p. 773-794, 2012

• DOI for The probability of the Alabama paradox

Generalized Galois numbers, inversions, lattice paths, Ferrers diagrams and limit theorems

Janson, Svante

Part of The Electronic Journal of Combinatorics, 2012

Phase transitions for modified Erdős–Rényi processes

Janson, Svante; Spencer, Joel

Part of Arkiv för matematik, p. 305-329, 2012

• DOI for Phase transitions for modified Erdős–Rényi processes

Hitting Times for Random Walks with Restarts

Janson, Svante; Peres, Yuval

Part of SIAM Journal on Discrete Mathematics, p. 537-547, 2012

• DOI for Hitting Times for Random Walks with Restarts

Renewal theory in the analysis of tries and strings

Janson, Svante

Part of Theoretical Computer Science, p. 33-54, 2012

• DOI for Renewal theory in the analysis of tries and strings

Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf

Fill, James Allen; Janson, Svante; Ward, Mark Daniel

Part of The Electronic Journal of Combinatorics, 2012

Bootstrap percolation on the random graph Gn,p

Janson, Svante; Luczak, Tomasz; Turova, Tatyana; Vallier, Thomas

Part of The Annals of Applied Probability, p. 1989-2047, 2012

• DOI for Bootstrap percolation on the random graph Gn,p

Susceptibility in inhomogeneous random graphs

Janson, Svante; Riordan, Oliver

Part of The Electronic Journal of Combinatorics, 2012

Monotone graph limits and quasimonotone graphs

Bollobás, Béla; Janson, Svante; Riordan, Oliver

Part of Internet Mathematics, p. 187-231, 2012

On the total external length of the Kingman coalescent

Janson, Svante; Kersting, Goetz

Part of Electronic Journal of Probability, p. 2203-2218, 2011

A central limit theorem for random ordered factorizations of integers

Hwang, Hsien-Kuei; Janson, Svante

Part of Electronic Journal of Probability, p. 347-361, 2011

Quasi-random graphs and graph limits

Janson, Svante

Part of European journal of combinatorics (Print), p. 1054-1083, 2011

• DOI for Quasi-random graphs and graph limits

Distances Between Pairs of Vertices and Vertical Profile in Conditioned Galton-Watson Trees

Devroye, Luc; Janson, Svante

Part of Random structures & algorithms (Print), p. 381-395, 2011

• DOI for Distances Between Pairs of Vertices and Vertical Profile in Conditioned Galton-Watson Trees

Duality in Inhomogeneous Random Graphs, and the Cut Metric

Janson, Svante; Riordan, Oliver

Part of Random structures & algorithms (Print), p. 399-411, 2011

• DOI for Duality in Inhomogeneous Random Graphs, and the Cut Metric

On Covering by Translates of a Set

Bollobás, Béla; Janson, Svante; Riordan, Oliver

Part of Random structures & algorithms (Print), p. 33-67, 2011

• DOI for On Covering by Translates of a Set

Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs

Janson, Svante; Rucinski, Andrzej

Part of Arkiv för matematik, p. 79-96, 2011

• DOI for Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs

Long and short paths in uniform random recursive dags

Devroye, Luc; Janson, Svante

Part of Arkiv för matematik, p. 61-77, 2011

• DOI for Long and short paths in uniform random recursive dags

Sparse Random Graphs with Clustering

Bollobas, Bela; Janson, Svante; Riordan, Oliver

Part of Random structures & algorithms (Print), p. 269-323, 2011

• DOI for Sparse Random Graphs with Clustering

The Mahonian probability distribution on words is asymptotically normal

Canfield, E. Rodney; Janson, Svante; Zeilberger, Doron

Part of Advances in Applied Mathematics, p. 109-124, 2011

• DOI for The Mahonian probability distribution on words is asymptotically normal

On Vertex, Edge, and Vertex-Edge Random Graphs

Beer, Elizabeth; Fill, James Allen; Janson, Svante; Scheinerman, Edward R.

Part of The Electronic Journal of Combinatorics, 2011

Generalized Stirling permutations, families of increasing trees and urn models

Janson, Svante; Kuba, Markus; Panholzer, Alois

Part of Journal of combinatorial theory. Series A (Print), p. 94-114, 2011

• DOI for Generalized Stirling permutations, families of increasing trees and urn models

Random trees with superexponential branching weights

Janson, Svante; Jonsson, Thordur; Stefansson, Sigurdur Örn

Part of Journal of Physics A, p. 485002, 2011

• DOI for Random trees with superexponential branching weights

Poset limits and exchangeable random posets

Janson, Svante

Part of Combinatorica, p. 529-563, 2011

• DOI for Poset limits and exchangeable random posets

Correlations for Paths in Random Orientations of G(n, p) and G(n, m)

Alm, Sven Erick; Janson, Svante; Linusson, Svante

Part of Random structures & algorithms (Print), p. 486-506, 2011

• DOI for Correlations for Paths in Random Orientations of G(n, p) and G(n, m)

Absolutely continuous compensators

Janson, Svante; M'Baye, Sokhna; Protter, Philip

Part of International Journal of Theoretical and Applied Finance, p. 335-351, 2011

Networking - smoothly does it

Janson, Svante

Part of Science, p. 298-299, 2011

• DOI for Networking - smoothly does it

The maximum of Brownian motion with parabolic drift

Janson, Svante; Louchard, Guy; Martin-Löf, Anders

Part of Electronic Journal of Probability, p. 1893-1929, 2010

A divergent generating function that can be summed and analysed analytically

Janson, Svante

Part of Discrete Mathematics & Theoretical Computer Science, p. 1-22, 2010

Moments of gamma type and the Brownian supremum process area

Janson, Svante

Part of Probability Surveys, p. 1-52, 2010

• DOI for Moments of gamma type and the Brownian supremum process area

Random Graphs with Forbidden Vertex Degrees

Grimmett, Geoffrey; Janson, Svante

Part of Random structures & algorithms (Print), p. 137-175, 2010

• DOI for Random Graphs with Forbidden Vertex Degrees

Large cliques in a power-law random graph

Janson, Svante; Luczak, Tomasz; Norros, Ilkka

Part of Journal of Applied Probability, p. 1124-1135, 2010

The Cut Metric, Random Graphs, and Branching Processes

Bollobas, Bela; Janson, Svante; Riordan, Oliver

Part of Journal of statistical physics, p. 289-335, 2010

• DOI for The Cut Metric, Random Graphs, and Branching Processes

Asymptotic Equivalence and Contiguity of Some Random Graphs

Janson, Svante

Part of Random structures & algorithms (Print), p. 26-45, 2010

• DOI for Asymptotic Equivalence and Contiguity of Some Random Graphs

On the Number of Perfect Matchings in Random Lifts

Greenhill, Catherine; Janson, Svante; Rucinski, Andrzej

Part of Combinatorics, probability & computing, p. 791-817, 2010

• DOI for On the Number of Perfect Matchings in Random Lifts

Susceptibility of random graphs with given vertex degrees

Janson, Svante

Part of Journal of Combinatorics, p. 357-387, 2010

On percolation in random graphs with given vertex degrees

Janson, Svante

Part of Electronic Journal of Probability, p. 87-118, 2009

A functional combinatorial central limit theorem

Barbour, Andrew; Janson, Svante

Part of Electronic Journal of Probability, p. 2352-2370, 2009

Zeros of sections of the binomial expansion

Janson, Svante; Norfolk, Timothy

Part of Electronic Transactions on Numerical Analysis, p. 27-38, 2009

Standard representation of multivariate functions on a general probability space

Janson, Svante

Part of Electronic Communications in Probability, p. 343-346, 2009

A new approach to the giant component problem

Janson, Svante; Luczak, Malwina J.

Part of Random structures & algorithms (Print), p. 197-216, 2009

• DOI for A new approach to the giant component problem

The probability that a random multigraph is simple

Janson, Svante

Part of Combinatorics, probability & computing, p. 205-225, 2009

• DOI for The probability that a random multigraph is simple

Precise logarithmic asymptotics for the right tails of some limit random variables for random trees

Fill, James Allen; Janson, Svante

Part of Annals of Combinatorics, p. 403-416, 2009

• DOI for Precise logarithmic asymptotics for the right tails of some limit random variables for random trees

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence

Janson, Svante

Part of Annals of Combinatorics, p. 417-447, 2009

• DOI for Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence

Line-of-sight percolation

Bollobás, Béla; Janson, Svante; Riordan, Oliver

Part of Combinatorics, probability & computing, p. 83-106, 2009

• DOI for Line-of-sight percolation

Random even graphs

Grimmett, Geoffrey; Janson, Svante

Part of The Electronic Journal of Combinatorics, 2009

On the size of identifying codes in binary hypercubes

Janson, Svante; Laihonen, Tero

Part of Journal of combinatorial theory. Series A (Print), p. 1087-1096, 2009

• DOI for On the size of identifying codes in binary hypercubes

Convergence of some leader election algorithms

Janson, Svante; Lavault, Christian; Louchard, Guy

Part of Discrete Mathematics & Theoretical Computer Science, p. 171-196, 2008

Asymptotic normality of the k-core in random graphs

Janson, Svante; Luczak, Malwina J.

Part of The Annals of Applied Probability, p. 1085-1137, 2008

• DOI for Asymptotic normality of the k-core in random graphs

Local limit theorems for finite and infinite urn models

Hwang, Hsien-Kuei; Janson, Svante

Part of Annals of Probability, p. 992-1022, 2008

• DOI for Local limit theorems for finite and infinite urn models

A functional limit theorem for the profile of search trees

Drmota, Michael; Janson, Svante; Neininger, Ralph

Part of The Annals of Applied Probability, p. 288-233, 2008

• DOI for A functional limit theorem for the profile of search trees

The size of random fragmentation trees

Janson, Svante; Neininger, Ralph

Part of Probability theory and related fields, p. 399-442, 2008

• DOI for The size of random fragmentation trees

The largest component in a subcritical random graph with a power law degree distribution

Janson, Svante

Part of The Annals of Applied Probability, p. 1651-1668, 2008

• DOI for The largest component in a subcritical random graph with a power law degree distribution

Susceptibility in subcritical random graphs

Janson, Svante; Luczak, Malwina

Part of Journal of Mathematical Physics, p. 125207, 2008

• DOI for Susceptibility in subcritical random graphs

Dismantling sparse random graphs

Janson, Svante; Thomason, Andrew

Part of Combinatorics, probability & computing, p. 259-264, 2008

• DOI for Dismantling sparse random graphs

Graph limits and exchangeable random graphs

Janson, Svante; Diaconis, Persi

Part of Rendiconti di Matematica e delle sue Applicazioni. Serie VII, p. 33-61, 2008

Individual displacements in hashing with coalesced chains

Janson, Svante

Part of Combinatorics, probability & computing, p. 799-814, 2008

• DOI for Individual displacements in hashing with coalesced chains

On the asymptotic joint distribution of height and width in random trees

Janson, Svante

Part of Studia scientiarum mathematicarum Hungarica (Print), p. 451-467, 2008

• DOI for On the asymptotic joint distribution of height and width in random trees

Threshold graph limits and random threshold graphs

Diaconis, Persi; Janson, Svante; Holmes, Susan

Part of Internet Mathematics, p. 267-320, 2008

Tail estimates for the Brownian excursion area and other Brownian areas

Janson, Svante; Louchard, Guy

Part of Electronic Journal of Probability, p. 1600-1632, 2007

Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas

Janson, Svante

Part of Probability Surveys, p. 80-145, 2007

• DOI for Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas

Partial fillup and search time in LC tries

Janson, Svante; Szpankowski, Wojciech

Part of ACM Transactions on Algorithms, 2007

• DOI for Partial fillup and search time in LC tries

Spread-out percolation in R-d

Bollobas, Bela; Janson, Svante; Riordan, Oliver

Part of Random structures & algorithms (Print), p. 239-246, 2007

• DOI for Spread-out percolation in R-d

Monotonicity, asymptotic normality and vertex degrees in random graphs

Janson, Svante

Part of Bernoulli, p. 952-965, 2007

• DOI for Monotonicity, asymptotic normality and vertex degrees in random graphs

Graphs with specified degree distributions, simple epidemics and local vaccination strategies

Britton, Tom; Janson, Svante; Martin-Löf, Anders

Part of Advances in Applied Probability, p. 922-948, 2007

• DOI for Graphs with specified degree distributions, simple epidemics and local vaccination strategies

The phase transition in inhomogeneous random graphs

Bollobás, Béla; Janson, Svante; Riordan, Oliver

Part of Random structures & algorithms (Print), p. 3-122, 2007

• DOI for The phase transition in inhomogeneous random graphs

A point process describing the component sizes in the critical window of the random graph evolution

Janson, Svante; Spencer, Joel

Part of Combinatorics, probability & computing, p. 631-658, 2007

• DOI for A point process describing the component sizes in the critical window of the random graph evolution

On a random graph related to quantum theory

Janson, Svante

Part of Combinatorics, probability & computing, p. 757-766, 2007

• DOI for On a random graph related to quantum theory

A simple solution to the k-core problem

Janson, Svante; Luczak, Malwina J.

Part of Random structures & algorithms (Print), p. 50-62, 2007

• DOI for A simple solution to the k-core problem

Rainbow Hamilton cycles in random regular graphs

Janson, Svante; Wormald, Nicholas

Part of Random structures & algorithms (Print), p. 35-49, 2007

• DOI for Rainbow Hamilton cycles in random regular graphs

Random cutting and records in deterministic and random trees

Janson, Svante

Part of Random structures & algorithms (Print), p. 139-179, 2006

• DOI for Random cutting and records in deterministic and random trees

Rounding of continuous random variables and oscillatory asymptotics

Janson, Svante

Part of Annals of Probability, p. 1807-1826, 2006

• DOI for Rounding of continuous random variables and oscillatory asymptotics

The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance

Blum, Michael; Francois, Olivier; Janson, Svante

Part of The Annals of Applied Probability, p. 2195-2214, 2006

• DOI for The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance

The density of the ISE and local limit laws for embedded trees

Bousquet-Mélou, Mireille; Janson, Svante

Part of The Annals of Applied Probability, p. 1597-1632, 2006

• DOI for The density of the ISE and local limit laws for embedded trees

Left and right pathlengths in random binary trees

Janson, Svante

Part of Algorithmica, p. 419-429, 2006

• DOI for Left and right pathlengths in random binary trees

Congruence properties of depths in some random trees

Janson, Svante

Part of ALEA. Latin American Journal of Probability and Mathematical Statistics, p. 347-366, 2006

Feynman-Kac formulas for Black-Scholes type operators

Janson, Svante; Tysk, Johan

Part of Bull. London Math. Soc., p. 269-282, 2006

Superreplication of options on several underlying assets

Ekström, Erik; Janson, Svante; Tysk, Johan

Part of Journal of Applied Probability, p. 27-38, 2005

Limit theorems for triangular urn schemes

Janson, Svante

Part of Probability Theory and Related Fields, p. 417-452, 2005

Some remarks on the combinatorics of IS_n

Janson, Svante; Mazorchuk, Volodymyr

Part of Semigroup Forum 70, p. 391-405, 2005

Asymptotic degree distribution in random recursive trees

Janson, Svante

Part of Random Structures Algorithms, p. 69-83, 2005

Individual displacements for linear probing hashing with different insertion policies.

Janson, Svante

Part of ACM Transactions on Algorithms, p. 177-213, 2005

The first eigenvalue of random graphs

Janson, Svante

Part of Combin. Probab. Comput., p. 815-825, 2005

The phase transition in the uniformly grown random graph has infinite order

Janson, Svante; Bollobás, Béla; Riordan, Oliver

Part of Random Structures Algorithms, p. 1-36, 2005

Convergence of discrete snakes

Janson, Svante; Marckert, Jean-Francois

Part of J. Theor. Probab, p. 615-645, 2005

Convergence of coined quantum walks on R^d

Janson, Svante; Gottlieb, Alex; Scudo, Petra

Part of Infin. Dimens. Anal. Quantum Probab. Relat. Top., p. 129-140, 2005

Branching processes, and random-cluster measures on trees.

Janson, Svante; Grimmett, Geoffrey

Part of J. Eur. Math. Soc., p. 253-281, 2005

The deletion method for upper tail estimates.

Janson, Svante; Rucinski, Andrzej

Part of Combinatorica, p. 615-640, 2004

On generalized random railways

Janson, Svante; Garmo, Hans; Karonski, Michal

Part of Combin. Probab. Comput., p. 31-35, 2004

Rademacher chaos: tail estimates vs limit theorems

Janson, Svante; Blei, Ron

Part of Ark. Mat. 42, p. 13-29, 2004

Large deviations for sums of partly dependent random variables

Janson, Svante

Part of Random Struct. Alg., p. 234-248, 2004

Robust reconstruction on trees is determined by the second eigenvalue

Janson, Svante; Mossel, Elchanan

Part of Ann. Probab., p. 2630-2649, 2004

Upper tails for subgraph counts in random graphs

Janson, Svante; Oleszkiewicz, Krzysztof; Rucinski, Andrzej

Part of Israel Journal of Mathematics, p. 61-92, 2004

One-sided interval trees

Janson, Svante

Part of Journal of the Iranian Statistical Society, p. 149-164, 2004

Functional limit theorems for multitype branching processes

Janson, Svante

Part of Stoch. Proc. Appl., p. 177-245, 2004

The center of mass of the ISE and the Wiener index of trees

Janson, Svante; Chassaing, Philippe

Part of Electronic Comm. Probab., p. 178-187, 2004

Weak limits for quantum random walks

Janson, Svante; Grimmett, Geoffrey; Scudo, Petra

Part of Phys. Rev. E,, 2004

Preservation of convexity of solutions to parabolic equations

Tysk, Johan; Janson, Svante

Part of J. Diff. Eqs. 206 (2004), 182-226., p. 182-226, 2004

On the average sequence complexity

Janson, Svante; Lonardi, Stefano; Szpankowski, Wojciech

Part of Theoretical Computer Science A, p. 213-227, 2004

Phragmen's Voting Methods and Justified Representation

Brill, Markus; Freeman, Rupert; Janson, Svante; Lackner, Martin

Part of Thirty-First AAAI Conference On Artificial Intelligence, p. 406-413, 2017

Asymptotic normality of statistics on permutation tableaux

Hitczenko, Pawel; Janson, Svante

Part of Algorithmic Probability and Combinatorics, p. 83-104, 2010

Plane recursive trees, Stirling permutations and an urn model

Janson, Svante

Part of Proceedings, Fifth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (Blaubeuren, 2008), p. 541-548, 2008

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract

Janson, Svante

Part of DMTCS Proceedings AofA 2007, 2007

Complex interpolation of compact operators into the couple (FL^oo,FL_1^oo)

Cwikel, Michael; Janson, Svante

Part of Interpolation Theory and Applications, 2007

Conditioned Galton-Watson trees do not grow

Janson, Svante

Part of Fourth Colloquium on Mathematics and Computer Science, 2006

Random records and cuttings in complete binary trees

Janson, Svante

Part of Mathematics and Computer Science III, 2004

The number of bit comparisons used by Quicksort: an average-case analysis

Janson, Svante; Fill, Jim

Part of Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete, 2004

Proportionella val inom kommunfullmäktige

Janson, Svante; Linusson, Svante

2019

• Download full text (pdf) of Proportionella val inom kommunfullmäktige

Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees

Janson, Svante; Addario-Berry, Louigi; Devroye, Luc

2010

• Download full text (pdf) of Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees

Graphons, cut norm and distance, couplings and rearrangements

Janson, Svante

2010

• Download full text (pdf) of Graphons, cut norm and distance, couplings and rearrangements

Absolutely Continuous Compensators

Janson, Svante; M'Baye, Sokhna; Protter, Philip

2010

• Download full text (pdf) of Absolutely Continuous Compensators

Hitting times for random walks with restarts

Janson, Svante; Peres, Yuval

2010

• Download full text (pdf) of Hitting times for random walks with restarts

Bootstrap percolation on the random graph Gn,p

Janson, Svante; Luczak, Tomasz; Turova, Tatyana; Vallier, Thomas

2010

• Download full text (pdf) of Bootstrap percolation on the random graph Gn,p

The maximum of Brownian motion with parabolic drift

Janson, Svante; Louchard, Guy; Martin-Löf, Anders

2010

• Download full text (pdf) of The maximum of Brownian motion with parabolic drift

Moments of Gamma type and the Brownian supremum process area

Janson, Svante

2010

• Download full text (pdf) of Moments of Gamma type and the Brownian supremum process area

Phase transitions for modified Erdös-Rényi processes

Janson, Svante; Spencer, Joel

2010

• Download full text (pdf) of Phase transitions for modified Erdös-Rényi processes

THE MAHONIAN PROBABILITY DISTRIBUTION ON WORDS IS ASYMPTOTICALLY NORMAL

Janson, Svante; Canfield, E. Rodney; Zeilberger, Doron

2009

ON THE SPREAD OF SUPERCRITICAL RANDOM GRAPHS

Janson, Svante; Addario-Berry, Louigi; McDiarmid, Colin

2009

The cut metric, random graphs, and branching processes

Janson, Svante; Bollobas, Bela; Riordan, Oliver

2009

Zeros of Sections of the Binomial Expansion

Janson, Svante; Norfolk, Timothy S.

2009

On covering by translates of a set

Janson, Svante; Bollobás, Béla; Riordan, Oliver

2009

Renewal theory in analysis of tries and string

Janson, Svante

2009

Graphs where every k-subset of vertices is an identifying set

Janson, Svante; Gravier, Sylvain; Laihonen, Tero; Ranto, Sanna

2009

Plane recursive trees, stirling permutations and an urn model

Janson, Svante

2008

On percolation in random graphs with given vertex degrees

Janson, Svante

2008

Connectedness in graph limits

Janson, Svante

2008

Generalized stirling permutations, families of increasing trees and urn models

Janson, Svante; Kuba, Markus; Panholzer, Alois

2008

Susceptibility in subcritical random graph

Janson, Svante; Luczak, Malwina J.

2008

Sparse random graphs with clustering

Janson, Svante; Bollobás, Béla; Riordan, Oliver

2008

On the Size of Identifying Codes in Binary Hypercubes

Janson, Svante; Laihonen, Tero

2008

Convergence of some leader election algorithms

Janson, Svante; Lavault, Christian; Louchard, Guy

2008

Standard representation of multivariate functions on a general probability space

Janson, Svante

2008

Asymptotic equivalence and contiguity of some random graphs

Janson, Svante

2008

On vertex, edge, and vertex-edge random graph

Janson, Svante; Beer, Elisabeth; Fill, James Allen; Scheinerman, Edward R.

2008

Distances between pairs of vertices and vertical profile in conditioned galton–watson tree

Janson, Svante; Devroye, Luc

2008

Line-of-sight percolation

Bollobas, Bela; Janson, Svante; Riordan, Oliver

2007

Random even graphs and the Ising model

Grimmett, Geoffrey; Janson, Svante

2007

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence

Janson, Svante

2007

Graphs with specified degree distributions, simple epidemics and local vaccination strategies

Britton, Tom; Janson, Svante; Martin-Löf, Anders

2007

The integral of the supremum process of Brownian motion

Janson, Svante; Petersson, Niclas

2007

Tail estimates for the Brownian excursion area and other Brownian areas

Janson, Svante; Louchard, Guy

2007

A new approach to the giant component problem

Janson, Svante; Luczak, Malwina

2007

Random graphs with forbidden vertex degrees

Grimmett, Geoffrey; Janson, Svante

2007

Asymptotic normality of the k-core in random graphs

Janson, Svante; Luczak, Malwina

2007

Precise logarithmic asymptotics for the right tails of some limit random variables for random trees

Fill, Jim; Janson, Svante

2007

The largest component in a subcritical random graph with a power law degree distribution

Janson, Svante

2007

Dismantling sparse random graphs

Janson, Svante; Thomason, Andrew

2007

Standard representation of multivariate functions on a general probability space

Janson, Svante

2007

Graph limits and exchangeable random graphs

Diaconis, Persi; Janson, Svante

2007

The probability that a random multigraph is simple

Janson, Svante

2006

A Functional Limit Theorem for The Profile of Search Trees

Drmota, Michael; Janson, Svante; Neininger, Ralph

2006

Monotonicity, asymptotic normality and vertex degrees in random graphs

Janson, Svante

2006

Local limit theorems for finite and infinite urn models

Hwang, Hsien-Kuei; Janson, Svante

2006

On a random graph related to quantum theory

Janson, Svante

2006

The density of the ISE and local limit laws for embedded trees

Janson, Svante; Bousquet-Mélou, Mireille

2005

Congruence properties of depths in some random trees

Janson, Svante

2005

A simple solution to the k-core problem

Janson, Svante; Luczak, Malwina

2005

The phase transition in inhomogeneous random graphs

Janson, Svante; Bollobás, Béla; Riordan, Oliver

2005

Partial Fillup and Search Time in LC Tries

Janson, Svante; Szpankowski, Wojciech

2005

A point process describing the component sizes in the critical window of the random graph evolution

Janson, Svante; Spencer, Joel

2005

Individual displacements in hashing with coalesced chains

Janson, Svante

2005

Rainbow Hamilton cycles in random regular graphs

Janson, Svante; Wormald, Nicholas

2005

Feynman-Kac formulas for Black-Scholes type operators

Janson, Svante; Tysk, Johan

2004

Convergence of coined quantum walks on R^d

Janson, Svante; Gottlieb, Alex D.; Scudo, Petra F.

2004

Left and right pathlenghts in random binary trees

Janson, Svante

2004

Some remarks on the combinatorics of ISn

Janson, Svante; Mazorchuk, Volodymyr

2004

Random cutting and records in deterministic and random trees

Janson, Svante

2004

On the asymptotic joint distribution of height and width in random trees

Janson, Svante

2004

Rounding of continuous random variables and oscillatory asymptotics

Janson, Svante

2004

Limit theorems for triangular urn schemes

Janson, Svante

2004

Branching processes, and random-cluster measures on trees

Janson, Svante

2004

Sorting with unreliable comparisons: a probabilistic analysis

Janson, Svante; Alonso, Laurent; Chassaing, Philippe; Gillet, Florent et al.

2003

On the average sequence complexity

Lonardi, Stefano; Janson, Svante; Szpankowski, Wojciech

2003

One-sided interval trees

Janson, Svante

2003

Weak limits for quantum random walks

Grimmet, Geoffrey; Janson, Svante; Scudo, Petra F.

2003

The center of mass of the ISE and the Wiener index of trees

Janson, Svante; Chassaing, Philippe

2003

The first eigenvalue of random graphs

Janson, Svante

2003

Superreplication of options on several underlying assets

Ekström, Erik; Janson, Svante; Tysk, Johan

2003

Individual displacements for linear probing hashing with different insertion policies

Janson, Svante

2003

Preservation of Convexity of Solutions to Parabolic Equations

Janson, Svante; Tysk, Johan

2003

Asymptotic degree distribution in random recursive trees

Janson, Svante

2003

Functional limit theorems for multitype branching processes and generalized Pólya urns

Janson, Svante

2003