Svante Janson

Periodic Minimum in the Count of Binomial Coefficients not Divisible by a Prime

Hwang, Hsien-kuei; Janson, Svante; Tsai, Tsung-hsi

Ingår i Mathematics of Computation, s. 1987-2012, 2026

• DOI för Periodic Minimum in the Count of Binomial Coefficients not Divisible by a Prime

The Generalized Alice HH Vs Bob HT Problem

Janson, Svante; Nica, Mihai; Segert, Simon

Ingår i Journal of theoretical probability, 2025

• DOI för The Generalized Alice HH Vs Bob HT Problem

Moments of Balanced Pólya Urns

Janson, Svante

Ingår i Journal of theoretical probability, 2025

• DOI för Moments of Balanced Pólya Urns
• Ladda ner fulltext (pdf) av Moments of Balanced Pólya Urns

Fringe Trees for Random Trees With Given Vertex Degrees

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

Ingår i Random structures & algorithms (Print), 2025

• DOI för Fringe Trees for Random Trees With Given Vertex Degrees
• Ladda ner fulltext (pdf) av 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.

Ingår i Combinatorics, probability & computing, 2025

• DOI för Approximation of subgraph counts in the uniform attachment model
• Ladda ner fulltext (pdf) av Approximation of subgraph counts in the uniform attachment model

Periodic Minimum in the Count of Binomial Coefficients not Divisible by a Prime

Hwang, Hsien-kuei; Janson, Svante; Tsai, Tsung-hsi

Ingår i Mathematics of Computation, s. 1987-2012, 2026

• DOI för Periodic Minimum in the Count of Binomial Coefficients not Divisible by a Prime

The Generalized Alice HH Vs Bob HT Problem

Janson, Svante; Nica, Mihai; Segert, Simon

Ingår i Journal of theoretical probability, 2025

• DOI för The Generalized Alice HH Vs Bob HT Problem

Moments of Balanced Pólya Urns

Janson, Svante

Ingår i Journal of theoretical probability, 2025

• DOI för Moments of Balanced Pólya Urns
• Ladda ner fulltext (pdf) av Moments of Balanced Pólya Urns

Fringe Trees for Random Trees With Given Vertex Degrees

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

Ingår i Random structures & algorithms (Print), 2025

• DOI för Fringe Trees for Random Trees With Given Vertex Degrees
• Ladda ner fulltext (pdf) av 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.

Ingår i Combinatorics, probability & computing, 2025

• DOI för Approximation of subgraph counts in the uniform attachment model
• Ladda ner fulltext (pdf) av 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

Ingår i Electronic Journal of Probability, 2025

• DOI för The critical beta-splitting random tree IV: Mellin analysis of leaf height
• Ladda ner fulltext (pdf) av 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

Ingår i Theoretical Computer Science, 2025

• DOI för Bit-array-based alternatives to HyperLogLog
• Ladda ner fulltext (pdf) av Bit-array-based alternatives to HyperLogLog

Consistent random vertex-orderings of graphs

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

Ingår i Journal of the European Mathematical Society (Print), s. 2623-2652, 2025

• DOI för Consistent random vertex-orderings of graphs
• Ladda ner fulltext (pdf) av Consistent random vertex-orderings of graphs

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

Jacquet, Philippe; Janson, Svante

Ingår i MATEMATICA, s. 262-292, 2024

• DOI för Depth-First Search Performance in a Random Digraph with Geometric Outdegree Distribution
• Ladda ner fulltext (pdf) av 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

Ingår i La Matematica, s. 435-508, 2024

• DOI för Conditioned Galton–Watson Trees: The Shape Functional, and More on the Sum of Powers of Subtree Sizes and Its Mean
• Ladda ner fulltext (pdf) av 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

Ingår i Combinatorics, probability & computing, s. 597-610, 2024

• DOI för Central limit theorem for components in meandric systems through high moments
• Ladda ner fulltext (pdf) av Central limit theorem for components in meandric systems through high moments

The harmonic descent chain

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

Ingår i Electronic Communications in Probability, 2024

• DOI för The harmonic descent chain
• Ladda ner fulltext (pdf) av The harmonic descent chain

On semi-restricted Rock, Paper, Scissors

Janson, Svante

Ingår i The Electronic Journal of Combinatorics, 2024

• DOI för On semi-restricted Rock, Paper, Scissors
• Ladda ner fulltext (pdf) av On semi-restricted Rock, Paper, Scissors

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

Janson, Svante; Pratelli, Luca; Rigo, Pietro

Ingår i Latin American Journal of Probability and Mathematical Statistics, s. 245-265, 2024

• DOI för Quantitative bounds in the central limit theorem for m-dependent random variables
• Ladda ner fulltext (pdf) av 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

Ingår i Advances in Applied Mathematics, 2024

• DOI för Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

Phragmén's voting methods and justified representation

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

Ingår i Mathematical programming, s. 47-76, 2024

• DOI för Phragmén's voting methods and justified representation
• Ladda ner fulltext (pdf) av Phragmén's voting methods and justified representation

The number of descendants in a random directed acyclic graph

Janson, Svante

Ingår i Random structures & algorithms (Print), s. 768-803, 2024

• DOI för The number of descendants in a random directed acyclic graph
• Ladda ner fulltext (pdf) av The number of descendants in a random directed acyclic graph

On a central limit theorem in renewal theory

Janson, Svante

Ingår i Statistics and Probability Letters, 2024

• DOI för On a central limit theorem in renewal theory
• Ladda ner fulltext (pdf) av On a central limit theorem in renewal theory

On the Statistics of the Number of Fixed-Dimensional Subcubes in a Random Subset of the n-Dimensional Discrete Unit Cube

Janson, Svante; Seidler, Blair; Zeilberger, Doron

Ingår i Palestine Journal of Mathematics, s. 512-520, 2023

• Ladda ner fulltext (pdf) av On the Statistics of the Number of Fixed-Dimensional Subcubes in a Random Subset of the n-Dimensional Discrete Unit Cube

Fluctuations of subgraph counts in graphon based random graphs

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

Ingår i Combinatorics, probability & computing, s. 428-464, 2023

• DOI för Fluctuations of subgraph counts in graphon based random graphs

Fluctuations of balanced urns with infinitely many colours

Janson, Svante; Mailler, Cecile; Villemonais, Denis

Ingår i Electronic Journal of Probability, s. 1-72, 2023

• DOI för Fluctuations of balanced urns with infinitely many colours
• Ladda ner fulltext (pdf) av 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

Ingår i Advances in Applied Probability, s. 841-894, 2023

• DOI för 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

Ingår i The Electronic Journal of Combinatorics, 2023

• DOI för The number of occurrences of patterns in a random tree or forest permutation
• Ladda ner fulltext (pdf) av The number of occurrences of patterns in a random tree or forest permutation

Estimating global subgraph counts by sampling

Janson, Svante; Kurauskas, Valentas

Ingår i The Electronic Journal of Combinatorics, 2023

• DOI för Estimating global subgraph counts by sampling
• Ladda ner fulltext (pdf) av Estimating global subgraph counts by sampling

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

Janson, Svante; Louf, Baptiste

Ingår i Annals of Probability, s. 899-929, 2023

• DOI för Unicellular maps vs. hyperbolic surfaces in large genus: Simple closed curves

Continuous-time digital search tree and a border aggregation model

Janson, Svante; Thacker, Debleena

Ingår i Bernoulli, s. 2563-2577, 2022

• DOI för Continuous-time digital search tree and a border aggregation model

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

Fill, James Allen; Janson, Svante

Ingår i Electronic Journal of Probability, 2022

• DOI för The sum of powers of subtree sizes for conditioned Galton-Watson trees
• Ladda ner fulltext (pdf) av 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

Ingår i Electronic Journal of Probability, s. 1-63, 2022

• DOI för Central limit theorems for additive functionals and fringe trees in tries
• Ladda ner fulltext (pdf) av Central limit theorems for additive functionals and fringe trees in tries

Successive minimum spanning trees

Janson, Svante; Sorkin, Gregory B.

Ingår i Random structures & algorithms (Print), s. 126-172, 2022

• DOI för Successive minimum spanning trees

On convergence for graphexes

Janson, Svante

Ingår i European journal of combinatorics (Print), 2022

• DOI för On convergence for graphexes
• Ladda ner fulltext (pdf) av On convergence for graphexes

Minimal matchings of point processes

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

Ingår i Probability theory and related fields, s. 571-611, 2022

• DOI för Minimal matchings of point processes
• Ladda ner fulltext (pdf) av Minimal matchings of point processes

The distance profile of rooted and unrooted simply generated trees

Berzunza Ojeda, Gabriel; Janson, Svante

Ingår i Combinatorics, probability & computing, s. 368-410, 2022

• DOI för The distance profile of rooted and unrooted simply generated trees
• Ladda ner fulltext (pdf) av The distance profile of rooted and unrooted simply generated trees

Short cycles in high genus unicellular maps

Janson, Svante; Louf, Baptiste

Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 1547-1564, 2022

• DOI för 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

Ingår i EXAMPLES AND COUNTEREXAMPLES, 2021

• DOI för 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

Ingår i Mathematische Nachrichten, s. 1484-1522, 2021

• DOI för 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

Ingår i The Annals of Applied Probability, s. 1523-1547, 2021

• DOI för Preferential attachment without vertex growth: Emergence of the giant component

On general subtrees of a conditioned Galton-Watson tree

Janson, Svante

Ingår i Electronic Communications in Probability, 2021

• DOI för On general subtrees of a conditioned Galton-Watson tree
• Ladda ner fulltext (pdf) av 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

Ingår i Annals of Probability, s. 2637-2667, 2021

• DOI för 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

Ingår i Statistics and Probability Letters, 2021

• DOI för On the probability that a binomial variable is at most its expectation
• Ladda ner fulltext (pdf) av On the probability that a binomial variable is at most its expectation

Tree limits and limits of random trees

Janson, Svante

Ingår i Combinatorics, probability & computing, s. 849-893, 2021

• DOI för Tree limits and limits of random trees
• Ladda ner fulltext (pdf) av Tree limits and limits of random trees

On distance covariance in metric and Hilbert spaces

Janson, Svante

Ingår i Latin American Journal of Probability and Mathematical Statistics, s. 1353-1393, 2021

• DOI för On distance covariance in metric and Hilbert spaces

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

Janson, Svante

Ingår i Mathematica Scandinavica, s. 544-584, 2021

• DOI för The Space D in Several Variables: Random Variables and Higher Moments

Hidden Words Statistics for Large Patterns

Janson, Svante; Szpankowskit, Wojciech

Ingår i The Electronic Journal of Combinatorics, 2021

• DOI för Hidden Words Statistics for Large Patterns
• Ladda ner fulltext (pdf) av Hidden Words Statistics for Large Patterns

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

Janson, Svante

Ingår i Arkiv för matematik, s. 87-123, 2021

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

On the independence number of some random trees

Janson, Svante

Ingår i Electronic Communications in Probability, 2020

• DOI för On the independence number of some random trees

Asymptotic normality in random graphs with given vertex degrees

Janson, Svante

Ingår i Random structures & algorithms (Print), s. 1070-1116, 2020

• DOI för Asymptotic normality in random graphs with given vertex degrees

Mean and variance of balanced Pólya urns

Janson, Svante

Ingår i Advances in Applied Probability, s. 1224-1248, 2020

• DOI för Mean and variance of balanced Pólya urns

Rate of convergence for traditional Polya urns

Janson, Svante

Ingår i Journal of Applied Probability, s. 1029-1044, 2020

• DOI för Rate of convergence for traditional Polya urns

Strong convergence of infinite color balanced urns under uniform ergodicity

Bandyopadhyay, Antar; Janson, Svante; Thacker, Debleena

Ingår i Journal of Applied Probability, s. 853-865, 2020

• DOI för Strong convergence of infinite color balanced urns under uniform ergodicity

Random graphs with given vertex degrees and switchings

Janson, Svante

Ingår i Random structures & algorithms (Print), s. 3-31, 2020

• DOI för Random graphs with given vertex degrees and switchings

A graphon counter example

Janson, Svante

Ingår i Discrete Mathematics, 2020

• DOI för A graphon counter example

Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns

Janson, Svante

Ingår i Algorithmica, s. 616-641, 2020

• DOI för Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns
• Ladda ner fulltext (pdf) av Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns

The hiring problem with rank-based strategies

Janson, Svante

Ingår i Electronic Journal of Probability, 2019

• DOI för The hiring problem with rank-based strategies
• Ladda ner fulltext (pdf) av The hiring problem with rank-based strategies

Random replacements in Polya urns with infinitely many colours

Janson, Svante

Ingår i Electronic Communications in Probability, 2019

• DOI för Random replacements in Polya urns with infinitely many colours
• Ladda ner fulltext (pdf) av Random replacements in Polya urns with infinitely many colours

Preferential attachment when stable

Janson, Svante; Sen, Subhabrata; Spencer, Joel

Ingår i Advances in Applied Probability, s. 1067-1108, 2019

• DOI för Preferential attachment when stable

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

Janson, Svante; Öberg, Anders

Ingår i Bulletin de la Société Mathématique de France, s. 395-441, 2019

• DOI för 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

Ingår i Random structures & algorithms (Print), s. 545-559, 2019

• DOI för Competing first passage percolation on random graphs with finite variance degrees

Patterns in random permutations avoiding the pattern 321

Janson, Svante

Ingår i Random structures & algorithms (Print), s. 249-270, 2019

• DOI för 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

Ingår i Random structures & algorithms (Print), s. 3-55, 2019

• DOI för Component structure of the configuration model: Barely supercritical case
• Ladda ner fulltext (pdf) av 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.

Ingår i Combinatorics, probability & computing, s. 335-364, 2019

• DOI för 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

Ingår i Discrete Applied Mathematics, s. 152-165, 2019

• DOI för 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

Ingår i Journal of statistical physics, s. 71-96, 2019

• DOI för Long Term Behaviour of a Reversible System of Interacting Random Walks
• Ladda ner fulltext (pdf) av Long Term Behaviour of a Reversible System of Interacting Random Walks

Competition in growth and urns

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

Ingår i Random structures & algorithms (Print), s. 211-227, 2019

• DOI för Competition in growth and urns

Random Recursive Trees and Preferential Attachment Trees are Random Split Trees

Janson, Svante

Ingår i Combinatorics, probability & computing, s. 81-99, 2019

• DOI för Random Recursive Trees and Preferential Attachment Trees are Random Split Trees

Renewal theory for asymmetric U-statistics

Janson, Svante

Ingår i Electronic Journal of Probability, 2018

• DOI för Renewal theory for asymmetric U-statistics
• Ladda ner fulltext (pdf) av Renewal theory for asymmetric U-statistics

On the critical probability in percolation

Janson, Svante; Warnke, Lutz

Ingår i Electronic Journal of Probability, 2018

• DOI för On the critical probability in percolation
• Ladda ner fulltext (pdf) av On the critical probability in percolation

Moment convergence of balanced Polya processes

Janson, Svante; Pouyanne, Nicolas

Ingår i Electronic Journal of Probability, 2018

• DOI för Moment convergence of balanced Polya processes

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

Janson, Svante

Ingår i Advances in Applied Probability, s. 141-171, 2018

• DOI för Asymptotics Of Fluctuations In Crump-Mode-Jagers Processes: The Lattice Case

Sesqui-type branching processes

Janson, Svante; Riordan, Oliver; Warnke, Lutz

Ingår i Stochastic Processes and their Applications, s. 3628-3655, 2018

• DOI för Sesqui-type branching processes

On Edge Exchangeable Random Graphs

Janson, Svante

Ingår i Journal of statistical physics, s. 448-484, 2018

• DOI för On Edge Exchangeable Random Graphs
• Ladda ner fulltext (pdf) av On Edge Exchangeable Random Graphs

Non-fringe subtrees in conditioned Galton-Watson trees

Cai, Xing Shi; Janson, Svante

Ingår i The Electronic Journal of Combinatorics, 2018

• Ladda ner fulltext (pdf) av Non-fringe subtrees in conditioned Galton-Watson trees

Tail bounds for sums of geometric and exponential variables

Janson, Svante

Ingår i Statistics and Probability Letters, s. 1-6, 2018

• DOI för Tail bounds for sums of geometric and exponential variables

Graph properties, graph limits, and entropy

Hatami, Hamed; Janson, Svante; Szegedy, Balazs

Ingår i Journal of Graph Theory, s. 208-229, 2018

• DOI för Graph properties, graph limits, and entropy

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

Holmgren, Cecilia; Janson, Svante

Ingår i Probability Surveys, s. 53-154, 2017

• DOI för Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
• Ladda ner fulltext (pdf) av 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.

Ingår i Journal of Graph Theory, s. 386-407, 2017

• DOI för On String Graph Limits and the Structure of a Typical String Graph

Patterns in Random Permutations Avoiding the Pattern 132

Janson, Svante

Ingår i Combinatorics, probability & computing, s. 24-51, 2017

• DOI för 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

Ingår i Random structures & algorithms (Print), s. 565-586, 2017

• DOI för 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

Ingår i ACM Transactions on Algorithms, 2017

• DOI för 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

Ingår i The Electronic Journal of Combinatorics, 2017

Packing Random Graphs and Hypergraphs

Bollobas, Bela; Janson, Svante; Scott, Alex

Ingår i Random structures & algorithms (Print), s. 3-13, 2017

• DOI för Packing Random Graphs and Hypergraphs

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

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

Ingår i Journal of Mathematical Biology, s. 843-886, 2017

• DOI för Near-critical SIR epidemic on a random graph with given degrees
• Ladda ner fulltext (pdf) av 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.

Ingår i Combinatorics, probability & computing, s. 89-107, 2016

• DOI för On the Length of a Random Minimum Spanning Tree

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

Janson, Svante

Ingår i Random structures & algorithms (Print), s. 57-101, 2016

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

The lower tail: Poisson approximation revisited

Janson, Svante; Warnke, Lutz

Ingår i Random structures & algorithms (Print), s. 219-246, 2016

• DOI för The lower tail: Poisson approximation revisited

Graph limits and hereditary properties

Janson, Svante

Ingår i European journal of combinatorics (Print), s. 321-337, 2016

• DOI för Graph limits and hereditary properties

The inverse first-passage problem and optimal stopping

Ekström, Erik; Janson, Svante

Ingår i The Annals of Applied Probability, s. 3154-3177, 2016

• DOI för The inverse first-passage problem and optimal stopping

Influence in product spaces

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

Ingår i Advances in Applied Probability, s. 145-152, 2016

• DOI för Influence in product spaces

On a representation theorem for finitely exchangeable random vectors

Janson, Svante; Konstantopoulos, Takis; Yuan, Linglong

Ingår i Journal of Mathematical Analysis and Applications, s. 703-714, 2016

• DOI för On a representation theorem for finitely exchangeable random vectors

A Unified Approach to Linear Probing Hashing with Buckets

Janson, Svante; Viola, Alfredo

Ingår i Algorithmica, s. 724-781, 2016

• DOI för A Unified Approach to Linear Probing Hashing with Buckets

Asymptotic distribution of two-protected nodes in ternary search trees

Holmgren, Cecilia; Janson, Svante

Ingår i Electronic Journal of Probability, 2015

• DOI för 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

Ingår i Electronic Journal of Probability, 2015

• DOI för Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Ladda ner fulltext (pdf) av 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

Ingår i Electronic Communications in Probability, s. 1-7, 2015

• DOI för On the tails of the limiting Quicksort distribution
• Ladda ner fulltext (pdf) av 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

Ingår i Journal of Combinatorics, s. 117-143, 2015

• DOI för On the asymptotic statistics of the number of occurrences of multiple permutation patterns

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

Izhakian, Zur; Janson, Svante; Rhodes, John

Ingår i Proceedings of the American Mathematical Society, s. 407-418, 2015

• DOI för Superboolean rank and the size of the largest triangular submatrix of a random matrix

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

Janson, Svante; Sos, Vera T.

Ingår i European journal of combinatorics (Print), s. 134-160, 2015

• DOI för More on quasi-random graphs, subgraph counts and graph limits

Maximal clades in random binary search trees

Janson, Svante

Ingår i The Electronic Journal of Combinatorics, 2015

Scaling limits of random planar maps with a unique large face

Janson, Svante; Stefánsson, Sigurdur Örn

Ingår i Annals of Probability, s. 1045-1081, 2015

• DOI för Scaling limits of random planar maps with a unique large face

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

Jammalamadaka, Sreenivasa Rao; Janson, Svante

Ingår i The Annals of Applied Probability, s. 3571-3591, 2015

• DOI för Asymptotic Distribution Of The Maximum Interpoint Distance In A Sample Of Random Vectors With A Spherically Symmetric Distribution
• Ladda ner fulltext (pdf) av Asymptotic Distribution Of The Maximum Interpoint Distance In A Sample Of Random Vectors With A Spherically Symmetric Distribution

Feynman-Kac Theorems for Generalized Diffusions

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

Ingår i Transactions of the American Mathematical Society, s. 8051-8070, 2015

ON DEGENERATE SUMS OF m-DEPENDENT VARIABLES

Janson, Svante

Ingår i Journal of Applied Probability, s. 1146-1155, 2015

Higher moments of Banach space valued random variables

Janson, Svante; Kaijser, Sten

Ingår i Memoirs of the American Mathematical Society, s. 1-110, 2015

• DOI för 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

Ingår i Electronic Journal of Probability, s. 69, 2014

• DOI för First critical probability for a problem on random orientations in G(n,p)
• Ladda ner fulltext (pdf) av 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.

Ingår i Electronic Journal of Probability, s. 1-27, 2014

• DOI för Bootstrap percolation on Galton-Watson trees
• Ladda ner fulltext (pdf) av Bootstrap percolation on Galton-Watson trees

Protected nodes and fringe subtrees in some random trees

Devroye, Luc; Janson, Svante

Ingår i Electronic Communications in Probability, s. 1-10, 2014

• DOI för Protected nodes and fringe subtrees in some random trees
• Ladda ner fulltext (pdf) av 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

Ingår i Discrete Mathematics & Theoretical Computer Science, s. 73-88, 2014

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

Janson, Svante; Luczak, Malwina; Windridge, Peter

Ingår i Random structures & algorithms (Print), s. 724-761, 2014

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

On Symmetry of Uniform and Preferential Attachment Graphs

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

Ingår i The Electronic Journal of Combinatorics, 2014

On the Typical Structure of Graphs in a Monotone Property

Janson, Svante; Uzzell, Andrew J.

Ingår i The Electronic Journal of Combinatorics, 2014

On the Spread of Random Graphs

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

Ingår i Combinatorics, probability & computing, s. 477-504, 2014

• DOI för On the Spread of Random Graphs

Weighted Random Staircase Tableaux

Hitczenko, Pawel; Janson, Svante

Ingår i Combinatorics, probability & computing, s. 1114-1147, 2014

• DOI för Weighted Random Staircase Tableaux

Asymptotic bias of some election methods

Janson, Svante

Ingår i Annals of Operations Research, s. 89-136, 2014

• DOI för Asymptotic bias of some election methods

The probability that a rqandom multigraph is simple II

Janson, Svante

Ingår i Journal of Applied Probability, s. 123-137, 2014

Graphons, cut norm and distance, couplings and rearrangements

Janson, Svante

Ingår i New York Journal of Mathematics, 2013

Euler-Frobenius numbers and rounding

Janson, Svante

Ingår i Online Journal of Analytic Combinatorics, 2013

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

Janson, Svante

Ingår i Electronic Communications in Probability, s. 1-8, 2013

• DOI för 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

Ingår i Discrete Mathematics & Theoretical Computer Science, s. 259-270, 2013

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

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

Ingår i Annals of Probability, s. 1072-1087, 2013

• DOI för 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

Ingår i Probability theory and related fields, s. 493-520, 2013

• DOI för Can time-homogeneous diffusions produce any distribution?

Interval Graph Limits

Diaconis, Persi; Holmes, Susan; Janson, Svante

Ingår i Annals of Combinatorics, s. 27-52, 2013

• DOI för Interval Graph Limits

Note on a partition limit theorem for rank and crank

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

Ingår i Bulletin of the London Mathematical Society, s. 551-553, 2013

• DOI för 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

Ingår i Journal of Combinatorics, s. 67-80, 2013

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

Fill, James Allen; Janson, Svante

Ingår i Electronic Journal of Probability, s. 43, 2012

• DOI för 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

Ingår i Probability Surveys, s. 103-252, 2012

The probability of the Alabama paradox

Janson, Svante; Linusson, Svante

Ingår i Journal of Applied Probability, s. 773-794, 2012

• DOI för The probability of the Alabama paradox

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

Janson, Svante

Ingår i The Electronic Journal of Combinatorics, 2012

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

Janson, Svante; Spencer, Joel

Ingår i Arkiv för matematik, s. 305-329, 2012

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

Hitting Times for Random Walks with Restarts

Janson, Svante; Peres, Yuval

Ingår i SIAM Journal on Discrete Mathematics, s. 537-547, 2012

• DOI för Hitting Times for Random Walks with Restarts

Renewal theory in the analysis of tries and strings

Janson, Svante

Ingår i Theoretical Computer Science, s. 33-54, 2012

• DOI för 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

Ingår i The Electronic Journal of Combinatorics, 2012

Bootstrap percolation on the random graph Gn,p

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

Ingår i The Annals of Applied Probability, s. 1989-2047, 2012

• DOI för Bootstrap percolation on the random graph Gn,p

Susceptibility in inhomogeneous random graphs

Janson, Svante; Riordan, Oliver

Ingår i The Electronic Journal of Combinatorics, 2012

Monotone graph limits and quasimonotone graphs

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

Ingår i Internet Mathematics, s. 187-231, 2012

A central limit theorem for random ordered factorizations of integers

Hwang, Hsien-Kuei; Janson, Svante

Ingår i Electronic Journal of Probability, s. 347-361, 2011

On the total external length of the Kingman coalescent

Janson, Svante; Kersting, Goetz

Ingår i Electronic Journal of Probability, s. 2203-2218, 2011

On Covering by Translates of a Set

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

Ingår i Random structures & algorithms (Print), s. 33-67, 2011

• DOI för On Covering by Translates of a Set

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

Janson, Svante; Rucinski, Andrzej

Ingår i Arkiv för matematik, s. 79-96, 2011

• DOI för 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

Ingår i Arkiv för matematik, s. 61-77, 2011

• DOI för Long and short paths in uniform random recursive dags

Sparse Random Graphs with Clustering

Bollobas, Bela; Janson, Svante; Riordan, Oliver

Ingår i Random structures & algorithms (Print), s. 269-323, 2011

• DOI för Sparse Random Graphs with Clustering

The Mahonian probability distribution on words is asymptotically normal

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

Ingår i Advances in Applied Mathematics, s. 109-124, 2011

• DOI för 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.

Ingår i The Electronic Journal of Combinatorics, 2011

Duality in Inhomogeneous Random Graphs, and the Cut Metric

Janson, Svante; Riordan, Oliver

Ingår i Random structures & algorithms (Print), s. 399-411, 2011

• DOI för Duality in Inhomogeneous Random Graphs, and the Cut Metric

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

Devroye, Luc; Janson, Svante

Ingår i Random structures & algorithms (Print), s. 381-395, 2011

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

Quasi-random graphs and graph limits

Janson, Svante

Ingår i European journal of combinatorics (Print), s. 1054-1083, 2011

• DOI för Quasi-random graphs and graph limits

Generalized Stirling permutations, families of increasing trees and urn models

Janson, Svante; Kuba, Markus; Panholzer, Alois

Ingår i Journal of combinatorial theory. Series A (Print), s. 94-114, 2011

• DOI för Generalized Stirling permutations, families of increasing trees and urn models

Random trees with superexponential branching weights

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

Ingår i Journal of Physics A, s. 485002, 2011

• DOI för Random trees with superexponential branching weights

Poset limits and exchangeable random posets

Janson, Svante

Ingår i Combinatorica, s. 529-563, 2011

• DOI för 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

Ingår i Random structures & algorithms (Print), s. 486-506, 2011

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

Absolutely continuous compensators

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

Ingår i International Journal of Theoretical and Applied Finance, s. 335-351, 2011

Networking - smoothly does it

Janson, Svante

Ingår i Science, s. 298-299, 2011

• DOI för Networking - smoothly does it

The maximum of Brownian motion with parabolic drift

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

Ingår i Electronic Journal of Probability, s. 1893-1929, 2010

A divergent generating function that can be summed and analysed analytically

Janson, Svante

Ingår i Discrete Mathematics & Theoretical Computer Science, s. 1-22, 2010

Moments of gamma type and the Brownian supremum process area

Janson, Svante

Ingår i Probability Surveys, s. 1-52, 2010

• DOI för Moments of gamma type and the Brownian supremum process area

Large cliques in a power-law random graph

Janson, Svante; Luczak, Tomasz; Norros, Ilkka

Ingår i Journal of Applied Probability, s. 1124-1135, 2010

Random Graphs with Forbidden Vertex Degrees

Grimmett, Geoffrey; Janson, Svante

Ingår i Random structures & algorithms (Print), s. 137-175, 2010

• DOI för Random Graphs with Forbidden Vertex Degrees

The Cut Metric, Random Graphs, and Branching Processes

Bollobas, Bela; Janson, Svante; Riordan, Oliver

Ingår i Journal of statistical physics, s. 289-335, 2010

• DOI för The Cut Metric, Random Graphs, and Branching Processes

Asymptotic Equivalence and Contiguity of Some Random Graphs

Janson, Svante

Ingår i Random structures & algorithms (Print), s. 26-45, 2010

• DOI för Asymptotic Equivalence and Contiguity of Some Random Graphs

On the Number of Perfect Matchings in Random Lifts

Greenhill, Catherine; Janson, Svante; Rucinski, Andrzej

Ingår i Combinatorics, probability & computing, s. 791-817, 2010

• DOI för On the Number of Perfect Matchings in Random Lifts

Susceptibility of random graphs with given vertex degrees

Janson, Svante

Ingår i Journal of Combinatorics, s. 357-387, 2010

A functional combinatorial central limit theorem

Barbour, Andrew; Janson, Svante

Ingår i Electronic Journal of Probability, s. 2352-2370, 2009

On percolation in random graphs with given vertex degrees

Janson, Svante

Ingår i Electronic Journal of Probability, s. 87-118, 2009

Zeros of sections of the binomial expansion

Janson, Svante; Norfolk, Timothy

Ingår i Electronic Transactions on Numerical Analysis, s. 27-38, 2009

Standard representation of multivariate functions on a general probability space

Janson, Svante

Ingår i Electronic Communications in Probability, s. 343-346, 2009

A new approach to the giant component problem

Janson, Svante; Luczak, Malwina J.

Ingår i Random structures & algorithms (Print), s. 197-216, 2009

• DOI för A new approach to the giant component problem

The probability that a random multigraph is simple

Janson, Svante

Ingår i Combinatorics, probability & computing, s. 205-225, 2009

• DOI för The probability that a random multigraph is simple

Line-of-sight percolation

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

Ingår i Combinatorics, probability & computing, s. 83-106, 2009

• DOI för Line-of-sight percolation

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

Fill, James Allen; Janson, Svante

Ingår i Annals of Combinatorics, s. 403-416, 2009

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

On the size of identifying codes in binary hypercubes

Janson, Svante; Laihonen, Tero

Ingår i Journal of combinatorial theory. Series A (Print), s. 1087-1096, 2009

• DOI för On the size of identifying codes in binary hypercubes

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

Janson, Svante

Ingår i Annals of Combinatorics, s. 417-447, 2009

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

Random even graphs

Grimmett, Geoffrey; Janson, Svante

Ingår i The Electronic Journal of Combinatorics, 2009

Convergence of some leader election algorithms

Janson, Svante; Lavault, Christian; Louchard, Guy

Ingår i Discrete Mathematics & Theoretical Computer Science, s. 171-196, 2008

Graph limits and exchangeable random graphs

Janson, Svante; Diaconis, Persi

Ingår i Rendiconti di Matematica e delle sue Applicazioni. Serie VII, s. 33-61, 2008

Asymptotic normality of the k-core in random graphs

Janson, Svante; Luczak, Malwina J.

Ingår i The Annals of Applied Probability, s. 1085-1137, 2008

• DOI för Asymptotic normality of the k-core in random graphs

Local limit theorems for finite and infinite urn models

Hwang, Hsien-Kuei; Janson, Svante

Ingår i Annals of Probability, s. 992-1022, 2008

• DOI för Local limit theorems for finite and infinite urn models

Dismantling sparse random graphs

Janson, Svante; Thomason, Andrew

Ingår i Combinatorics, probability & computing, s. 259-264, 2008

• DOI för Dismantling sparse random graphs

Susceptibility in subcritical random graphs

Janson, Svante; Luczak, Malwina

Ingår i Journal of Mathematical Physics, s. 125207, 2008

• DOI för Susceptibility in subcritical random graphs

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

Janson, Svante

Ingår i The Annals of Applied Probability, s. 1651-1668, 2008

• DOI för The largest component in a subcritical random graph with a power law degree distribution

The size of random fragmentation trees

Janson, Svante; Neininger, Ralph

Ingår i Probability theory and related fields, s. 399-442, 2008

• DOI för The size of random fragmentation trees

A functional limit theorem for the profile of search trees

Drmota, Michael; Janson, Svante; Neininger, Ralph

Ingår i The Annals of Applied Probability, s. 288-233, 2008

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

Individual displacements in hashing with coalesced chains

Janson, Svante

Ingår i Combinatorics, probability & computing, s. 799-814, 2008

• DOI för Individual displacements in hashing with coalesced chains

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

Janson, Svante

Ingår i Studia scientiarum mathematicarum Hungarica (Print), s. 451-467, 2008

• DOI för 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

Ingår i Internet Mathematics, s. 267-320, 2008

Tail estimates for the Brownian excursion area and other Brownian areas

Janson, Svante; Louchard, Guy

Ingår i Electronic Journal of Probability, s. 1600-1632, 2007

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

Janson, Svante

Ingår i Probability Surveys, s. 80-145, 2007

• DOI för 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

Ingår i ACM Transactions on Algorithms, 2007

• DOI för Partial fillup and search time in LC tries

Spread-out percolation in R-d

Bollobas, Bela; Janson, Svante; Riordan, Oliver

Ingår i Random structures & algorithms (Print), s. 239-246, 2007

• DOI för Spread-out percolation in R-d

Monotonicity, asymptotic normality and vertex degrees in random graphs

Janson, Svante

Ingår i Bernoulli, s. 952-965, 2007

• DOI för 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

Ingår i Advances in Applied Probability, s. 922-948, 2007

• DOI för Graphs with specified degree distributions, simple epidemics and local vaccination strategies

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

Janson, Svante; Spencer, Joel

Ingår i Combinatorics, probability & computing, s. 631-658, 2007

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

The phase transition in inhomogeneous random graphs

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

Ingår i Random structures & algorithms (Print), s. 3-122, 2007

• DOI för The phase transition in inhomogeneous random graphs

A simple solution to the k-core problem

Janson, Svante; Luczak, Malwina J.

Ingår i Random structures & algorithms (Print), s. 50-62, 2007

• DOI för A simple solution to the k-core problem

Rainbow Hamilton cycles in random regular graphs

Janson, Svante; Wormald, Nicholas

Ingår i Random structures & algorithms (Print), s. 35-49, 2007

• DOI för Rainbow Hamilton cycles in random regular graphs

On a random graph related to quantum theory

Janson, Svante

Ingår i Combinatorics, probability & computing, s. 757-766, 2007

• DOI för On a random graph related to quantum theory

Random cutting and records in deterministic and random trees

Janson, Svante

Ingår i Random structures & algorithms (Print), s. 139-179, 2006

• DOI för Random cutting and records in deterministic and random trees

Rounding of continuous random variables and oscillatory asymptotics

Janson, Svante

Ingår i Annals of Probability, s. 1807-1826, 2006

• DOI för 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

Ingår i The Annals of Applied Probability, s. 2195-2214, 2006

• DOI för 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

Ingår i The Annals of Applied Probability, s. 1597-1632, 2006

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

Left and right pathlengths in random binary trees

Janson, Svante

Ingår i Algorithmica, s. 419-429, 2006

• DOI för Left and right pathlengths in random binary trees

Feynman-Kac formulas for Black-Scholes type operators

Janson, Svante; Tysk, Johan

Ingår i Bull. London Math. Soc., s. 269-282, 2006

Congruence properties of depths in some random trees

Janson, Svante

Ingår i ALEA. Latin American Journal of Probability and Mathematical Statistics, s. 347-366, 2006

Superreplication of options on several underlying assets

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

Ingår i Journal of Applied Probability, s. 27-38, 2005

Limit theorems for triangular urn schemes

Janson, Svante

Ingår i Probability Theory and Related Fields, s. 417-452, 2005

Some remarks on the combinatorics of IS_n

Janson, Svante; Mazorchuk, Volodymyr

Ingår i Semigroup Forum 70, s. 391-405, 2005

Convergence of coined quantum walks on R^d

Janson, Svante; Gottlieb, Alex; Scudo, Petra

Ingår i Infin. Dimens. Anal. Quantum Probab. Relat. Top., s. 129-140, 2005

Convergence of discrete snakes

Janson, Svante; Marckert, Jean-Francois

Ingår i J. Theor. Probab, s. 615-645, 2005

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

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

Ingår i Random Structures Algorithms, s. 1-36, 2005

The first eigenvalue of random graphs

Janson, Svante

Ingår i Combin. Probab. Comput., s. 815-825, 2005

Individual displacements for linear probing hashing with different insertion policies.

Janson, Svante

Ingår i ACM Transactions on Algorithms, s. 177-213, 2005

Asymptotic degree distribution in random recursive trees

Janson, Svante

Ingår i Random Structures Algorithms, s. 69-83, 2005

Branching processes, and random-cluster measures on trees.

Janson, Svante; Grimmett, Geoffrey

Ingår i J. Eur. Math. Soc., s. 253-281, 2005

On generalized random railways

Janson, Svante; Garmo, Hans; Karonski, Michal

Ingår i Combin. Probab. Comput., s. 31-35, 2004

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

Janson, Svante; Chassaing, Philippe

Ingår i Electronic Comm. Probab., s. 178-187, 2004

Upper tails for subgraph counts in random graphs

Janson, Svante; Oleszkiewicz, Krzysztof; Rucinski, Andrzej

Ingår i Israel Journal of Mathematics, s. 61-92, 2004

Rademacher chaos: tail estimates vs limit theorems

Janson, Svante; Blei, Ron

Ingår i Ark. Mat. 42, s. 13-29, 2004

Preservation of convexity of solutions to parabolic equations

Tysk, Johan; Janson, Svante

Ingår i J. Diff. Eqs. 206 (2004), 182-226., s. 182-226, 2004

Large deviations for sums of partly dependent random variables

Janson, Svante

Ingår i Random Struct. Alg., s. 234-248, 2004

Functional limit theorems for multitype branching processes

Janson, Svante

Ingår i Stoch. Proc. Appl., s. 177-245, 2004

On the average sequence complexity

Janson, Svante; Lonardi, Stefano; Szpankowski, Wojciech

Ingår i Theoretical Computer Science A, s. 213-227, 2004

One-sided interval trees

Janson, Svante

Ingår i Journal of the Iranian Statistical Society, s. 149-164, 2004

Weak limits for quantum random walks

Janson, Svante; Grimmett, Geoffrey; Scudo, Petra

Ingår i Phys. Rev. E,, 2004

Robust reconstruction on trees is determined by the second eigenvalue

Janson, Svante; Mossel, Elchanan

Ingår i Ann. Probab., s. 2630-2649, 2004

The deletion method for upper tail estimates.

Janson, Svante; Rucinski, Andrzej

Ingår i Combinatorica, s. 615-640, 2004

Depth-First Search Performance in Random Digraphs

Jacquet, Philippe; Janson, Svante

Ingår i 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AOFA 2024, s. 1-15, 2024

• DOI för Depth-First Search Performance in Random Digraphs
• Ladda ner fulltext (pdf) av Depth-First Search Performance in Random Digraphs

Bit-Array-Based Alternatives to HyperLogLog

Janson, Svante; Lumbroso, Jeremie; Sedgewick, Robert

Ingår i 35th International Conference On Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AOFA 2024, 2024

• DOI för Bit-Array-Based Alternatives to HyperLogLog
• Ladda ner fulltext (pdf) av Bit-Array-Based Alternatives to HyperLogLog

Fringe Trees for Random Trees with Given Vertex Degrees

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

Ingår i 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), 2024

• DOI för Fringe Trees for Random Trees with Given Vertex Degrees
• Ladda ner fulltext (pdf) av Fringe Trees for Random Trees with Given Vertex Degrees

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

Jacquet, Philippe; Janson, Svante

Ingår i 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022), 2022

• DOI för Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution
• Ladda ner fulltext (pdf) av Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution

Phragmen's Voting Methods and Justified Representation

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

Ingår i Thirty-First AAAI Conference On Artificial Intelligence, s. 406-413, 2017

Asymptotic normality of statistics on permutation tableaux

Hitczenko, Pawel; Janson, Svante

Ingår i Algorithmic Probability and Combinatorics, s. 83-104, 2010

Plane recursive trees, Stirling permutations and an urn model

Janson, Svante

Ingår i Proceedings, Fifth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (Blaubeuren, 2008), s. 541-548, 2008

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

Cwikel, Michael; Janson, Svante

Ingår i Interpolation Theory and Applications, 2007

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

Janson, Svante

Ingår i DMTCS Proceedings AofA 2007, 2007

Conditioned Galton-Watson trees do not grow

Janson, Svante

Ingår i Fourth Colloquium on Mathematics and Computer Science, 2006

Random records and cuttings in complete binary trees

Janson, Svante

Ingår i Mathematics and Computer Science III, 2004

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

Janson, Svante; Fill, Jim

Ingår i Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete, 2004

Proportionella valmetoder

Janson, Svante

Proportionella val inom kommunfullmäktige

Janson, Svante; Linusson, Svante

2019

• Ladda ner fulltext (pdf) av 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

• Ladda ner fulltext (pdf) av 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

• Ladda ner fulltext (pdf) av Graphons, cut norm and distance, couplings and rearrangements

Absolutely Continuous Compensators

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

2010

• Ladda ner fulltext (pdf) av Absolutely Continuous Compensators

Hitting times for random walks with restarts

Janson, Svante; Peres, Yuval

2010

• Ladda ner fulltext (pdf) av Hitting times for random walks with restarts

Bootstrap percolation on the random graph Gn,p

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

2010

• Ladda ner fulltext (pdf) av 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

• Ladda ner fulltext (pdf) av The maximum of Brownian motion with parabolic drift

Moments of Gamma type and the Brownian supremum process area

Janson, Svante

2010

• Ladda ner fulltext (pdf) av Moments of Gamma type and the Brownian supremum process area

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

Janson, Svante; Spencer, Joel

2010

• Ladda ner fulltext (pdf) av 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

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

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

2009

Renewal theory in analysis of tries and string

Janson, Svante

2009

Susceptibility in subcritical random graph

Janson, Svante; Luczak, Malwina J.

2008

Plane recursive trees, stirling permutations and an urn model

Janson, Svante

2008

On percolation in random graphs with given vertex degrees

Janson, Svante

2008

Generalized stirling permutations, families of increasing trees and urn models

Janson, Svante; Kuba, Markus; Panholzer, Alois

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

Connectedness in graph limits

Janson, Svante

2008

Line-of-sight percolation

Bollobas, Bela; Janson, Svante; Riordan, Oliver

2007

Random graphs with forbidden vertex degrees

Grimmett, Geoffrey; Janson, Svante

2007

Graph limits and exchangeable random graphs

Diaconis, Persi; 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

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

Janson, Svante

2007

A new approach to the giant component problem

Janson, Svante; Luczak, Malwina

2007

Tail estimates for the Brownian excursion area and other Brownian areas

Janson, Svante; Louchard, Guy

2007

The integral of the supremum process of Brownian motion

Janson, Svante; Petersson, Niclas

2007

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

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

2007

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

Janson, Svante

2007

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

Fill, Jim; Janson, Svante

2007

Asymptotic normality of the k-core in random graphs

Janson, Svante; Luczak, Malwina

2007

Random even graphs and the Ising model

Grimmett, Geoffrey; Janson, Svante

2007

Local limit theorems for finite and infinite urn models

Hwang, Hsien-Kuei; Janson, Svante

2006

Monotonicity, asymptotic normality and vertex degrees in random graphs

Janson, Svante

2006

On a random graph related to quantum theory

Janson, Svante

2006

A Functional Limit Theorem for The Profile of Search Trees

Drmota, Michael; Janson, Svante; Neininger, Ralph

2006

The probability that a random multigraph is simple

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

Rainbow Hamilton cycles in random regular graphs

Janson, Svante; Wormald, Nicholas

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

The phase transition in inhomogeneous random graphs

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

2005

Individual displacements in hashing with coalesced chains

Janson, Svante

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

Rounding of continuous random variables and oscillatory asymptotics

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

Limit theorems for triangular urn schemes

Janson, Svante

2004

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

Janson, Svante

2004

Branching processes, and random-cluster measures on trees

Janson, Svante

2004

Individual displacements for linear probing hashing with different insertion policies

Janson, Svante

2003

Sorting with unreliable comparisons: a probabilistic analysis

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

2003

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

Janson, Svante

2003

Asymptotic degree distribution in random recursive trees

Janson, Svante

2003

Superreplication of options on several underlying assets

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

2003

The first eigenvalue of random graphs

Janson, Svante

2003

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

Janson, Svante; Chassaing, Philippe

2003

Weak limits for quantum random walks

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

2003

One-sided interval trees

Janson, Svante

2003

On the average sequence complexity

Lonardi, Stefano; Janson, Svante; Szpankowski, Wojciech

2003

Preservation of Convexity of Solutions to Parabolic Equations

Janson, Svante; Tysk, Johan

2003