Svante Janson
Professor i matematik vid Matematiska institutionen; Akademisk personal
- Telefon:
- 018-471 31 88
- E-post:
- Svante.Janson@math.uu.se
- Besöksadress:
- Ångströmlaboratoriet, Lägerhyddsvägen 1
- Postadress:
- Box 480
751 06 UPPSALA
Ladda ned kontaktuppgifter för Svante Janson vid Matematiska institutionen; Akademisk personal
Professor i matematik vid Matematiska institutionen; Sannolikhetsteori och kombinatorik
- Telefon:
- 018-471 31 88
- E-post:
- svante.janson@math.uu.se
- Besöksadress:
- Ångströmlaboratoriet, Lägerhyddsvägen 1
- Postadress:
- Box 480
751 06 UPPSALA
- Akademiska meriter:
- FD
- CV:
- Ladda ned CV
Kort presentation
Jag forskar främst inom sannolikhetsteori, speciellt kombinatorisk sannolikhet (framför allt slumpgrafer); ibland även i analys som tidigare varit mitt huvudområde.
Jag har skrivit 4 böcker och över 300 tidskriftsartiklar, se min publikationslista (på engelska), som även innehåller en lista på mina medförfattare. (Den automatiskt genererade listan nedan är, trots rubriken, inte fullständig.) Se även listan på några av mina föredrag samt en populär presentation.
Biografi
Jag är medlem i Kungl. Vetenskapsakademien, Kungliga Vetenskapssocieteten i Uppsala, Svenska matematikersamfundet, Svenska statistikfrämjandet och Vetenskap och Folkbildning.
Jag är förutom min matematiska forskning, se ovan, intresserad av tideräkningar och deras matematik samt valsystem.
Jag har tidigare medverkat i, och hjälpt till att starta, projektet Samnordisk runtextdatabas.
Priser och utmärkelser:
- Sparres pris (KVA) 1978
- Göran Gustafssonpris 1992
- Eva och Lars Gårdings pris (Kungl. Fysiografiska sällskapet i Lund) 2009
- Wallenberg Scholar (Knut och Alice Wallenbergs stiftelse) 2011
- Rudbeckmedaljen (Uppsala universitet) 2013
- Celsiusmedaljen (Kungl. Vetenskapssocieteten i Uppsala) 2016
Min familj består av min fru Julie White och vår dotter Sofie (född 1995), samt extrabarnen Erika (född 1979), Magnus (född 1980), Emma (född 1987) och Jesper (född 1981), som har bott hos oss ibland som barn.
Publikationer
Senaste publikationer
Central limit theorem for components in meandric systems through high moments
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
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
Ingår i Electronic Communications in Probability, 2024
On semi-restricted Rock, Paper, Scissors
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
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
Alla publikationer
Artiklar i tidskrift
Central limit theorem for components in meandric systems through high moments
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
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
Ingår i Electronic Communications in Probability, 2024
On semi-restricted Rock, Paper, Scissors
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
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
Ingår i Advances in Applied Mathematics, 2024
Phragmén's voting methods and justified representation
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
On a central limit theorem in renewal theory
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
The number of descendants in a random directed acyclic graph
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
Fluctuations of subgraph counts in graphon based random graphs
Ingår i Combinatorics, probability & computing, s. 428-464, 2023
Fluctuations of balanced urns with infinitely many colours
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
Ingår i Advances in Applied Probability, s. 841-894, 2023
The number of occurrences of patterns in a random tree or forest permutation
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
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
Ingår i Annals of Probability, s. 899-929, 2023
The sum of powers of subtree sizes for conditioned Galton-Watson trees
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
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
Ingår i European journal of combinatorics (Print), 2022
Successive minimum spanning trees
Ingår i Random structures & algorithms (Print), s. 126-172, 2022
Minimal matchings of point processes
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
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
Continuous-time digital search tree and a border aggregation model
Ingår i Bernoulli, s. 2563-2577, 2022
Short cycles in high genus unicellular maps
Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 1547-1564, 2022
Can smooth graphons in several dimensions be represented by smooth graphons on [0, 1]?
Ingår i EXAMPLES AND COUNTEREXAMPLES, 2021
Tensor norms on ordered normed spaces, polarization constants, and exchangeable distributions
Ingår i Mathematische Nachrichten, s. 1484-1522, 2021
Preferential attachment without vertex growth: Emergence of the giant component
Ingår i The Annals of Applied Probability, s. 1523-1547, 2021
On general subtrees of a conditioned Galton-Watson tree
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
Ingår i Annals of Probability, s. 2637-2667, 2021
On the probability that a binomial variable is at most its expectation
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
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
Ingår i Latin American Journal of Probability and Mathematical Statistics, s. 1353-1393, 2021
The Space D in Several Variables: Random Variables and Higher Moments
Ingår i Mathematica Scandinavica, s. 544-584, 2021
Hidden Words Statistics for Large Patterns
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
Ingår i Arkiv för matematik, s. 87-123, 2021
On the independence number of some random trees
Ingår i Electronic Communications in Probability, 2020
Asymptotic normality in random graphs with given vertex degrees
Ingår i Random structures & algorithms (Print), s. 1070-1116, 2020
Mean and variance of balanced Pólya urns
Ingår i Advances in Applied Probability, s. 1224-1248, 2020
Rate of convergence for traditional Polya urns
Ingår i Journal of Applied Probability, s. 1029-1044, 2020
Strong convergence of infinite color balanced urns under uniform ergodicity
Ingår i Journal of Applied Probability, s. 853-865, 2020
Random graphs with given vertex degrees and switchings
Ingår i Random structures & algorithms (Print), s. 3-31, 2020
Ingår i Discrete Mathematics, 2020
Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns
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
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
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
Ingår i Advances in Applied Probability, s. 1067-1108, 2019
A piecewise contractive dynamical system and Phragmèn's election method
Ingår i Bulletin de la Société Mathématique de France, s. 395-441, 2019
Competing first passage percolation on random graphs with finite variance degrees
Ingår i Random structures & algorithms (Print), s. 545-559, 2019
Patterns in random permutations avoiding the pattern 321
Ingår i Random structures & algorithms (Print), s. 249-270, 2019
Component structure of the configuration model: Barely supercritical case
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
Ingår i Combinatorics, probability & computing, s. 335-364, 2019
A modified bootstrap percolation on a random graph coupled with a lattice
Ingår i Discrete Applied Mathematics, s. 152-165, 2019
Long Term Behaviour of a Reversible System of Interacting Random Walks
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
Ingår i Random structures & algorithms (Print), s. 211-227, 2019
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
Ingår i Combinatorics, probability & computing, s. 81-99, 2019
Renewal theory for asymmetric U-statistics
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
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
Ingår i Electronic Journal of Probability, 2018
Asymptotics Of Fluctuations In Crump-Mode-Jagers Processes: The Lattice Case
Ingår i Advances in Applied Probability, s. 141-171, 2018
Sesqui-type branching processes
Ingår i Stochastic Processes and their Applications, s. 3628-3655, 2018
On Edge Exchangeable Random Graphs
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
Ingår i The Electronic Journal of Combinatorics, 2018
Tail bounds for sums of geometric and exponential variables
Ingår i Statistics and Probability Letters, s. 1-6, 2018
Graph properties, graph limits, and entropy
Ingår i Journal of Graph Theory, s. 208-229, 2018
Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
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
Ingår i Journal of Graph Theory, s. 386-407, 2017
Patterns in Random Permutations Avoiding the Pattern 132
Ingår i Combinatorics, probability & computing, s. 24-51, 2017
The Greedy Independent Set in a Random Graph with Given Degrees
Ingår i Random structures & algorithms (Print), s. 565-586, 2017
Ingår i ACM Transactions on Algorithms, 2017
Ingår i The Electronic Journal of Combinatorics, 2017
Packing Random Graphs and Hypergraphs
Ingår i Random structures & algorithms (Print), s. 3-13, 2017
Near-critical SIR epidemic on a random graph with given degrees
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
Ingår i Combinatorics, probability & computing, s. 89-107, 2016
Asymptotic Normality of Fringe Subtrees and Additive Functionals in Conditioned Galton-Watson Trees
Ingår i Random structures & algorithms (Print), s. 57-101, 2016
The lower tail: Poisson approximation revisited
Ingår i Random structures & algorithms (Print), s. 219-246, 2016
Graph limits and hereditary properties
Ingår i European journal of combinatorics (Print), s. 321-337, 2016
The inverse first-passage problem and optimal stopping
Ingår i The Annals of Applied Probability, s. 3154-3177, 2016
Ingår i Advances in Applied Probability, s. 145-152, 2016
On a representation theorem for finitely exchangeable random vectors
Ingår i Journal of Mathematical Analysis and Applications, s. 703-714, 2016
A Unified Approach to Linear Probing Hashing with Buckets
Ingår i Algorithmica, s. 724-781, 2016
Asymptotic distribution of two-protected nodes in ternary search trees
Ingår i Electronic Journal of Probability, 2015
Limit laws for functions of fringe trees for binary search trees and random recursive trees
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
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
Ingår i Journal of Combinatorics, s. 117-143, 2015
More on quasi-random graphs, subgraph counts and graph limits
Ingår i European journal of combinatorics (Print), s. 134-160, 2015
Superboolean rank and the size of the largest triangular submatrix of a random matrix
Ingår i Proceedings of the American Mathematical Society, s. 407-418, 2015
Scaling limits of random planar maps with a unique large face
Ingår i Annals of Probability, s. 1045-1081, 2015
Maximal clades in random binary search trees
Ingår i The Electronic Journal of Combinatorics, 2015
Feynman-Kac Theorems for Generalized Diffusions
Ingår i Transactions of the American Mathematical Society, s. 8051-8070, 2015
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
Higher moments of Banach space valued random variables
Ingår i Memoirs of the American Mathematical Society, s. 1-110, 2015
ON DEGENERATE SUMS OF m-DEPENDENT VARIABLES
Ingår i Journal of Applied Probability, s. 1146-1155, 2015
Bootstrap percolation on Galton-Watson trees
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
First critical probability for a problem on random orientations in G(n,p)
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)
Protected nodes and fringe subtrees in some random trees
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
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
Ingår i Random structures & algorithms (Print), s. 724-761, 2014
Asymptotic bias of some election methods
Ingår i Annals of Operations Research, s. 89-136, 2014
Weighted Random Staircase Tableaux
Ingår i Combinatorics, probability & computing, s. 1114-1147, 2014
On the Typical Structure of Graphs in a Monotone Property
Ingår i The Electronic Journal of Combinatorics, 2014
On Symmetry of Uniform and Preferential Attachment Graphs
Ingår i The Electronic Journal of Combinatorics, 2014
On the Spread of Random Graphs
Ingår i Combinatorics, probability & computing, s. 477-504, 2014
The probability that a rqandom multigraph is simple II
Ingår i Journal of Applied Probability, s. 123-137, 2014
Graphons, cut norm and distance, couplings and rearrangements
Ingår i New York Journal of Mathematics, 2013
Euler-Frobenius numbers and rounding
Ingår i Online Journal of Analytic Combinatorics, 2013
Moments of the location of the maximum of Brownian motion with parabolic drift
Ingår i Electronic Communications in Probability, s. 1-8, 2013
Coupon collecting and transversals of hypergraphs
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
Ingår i Annals of Probability, s. 1072-1087, 2013
Can time-homogeneous diffusions produce any distribution?
Ingår i Probability theory and related fields, s. 493-520, 2013
Ingår i Annals of Combinatorics, s. 27-52, 2013
Note on a partition limit theorem for rank and crank
Ingår i Bulletin of the London Mathematical Society, s. 551-553, 2013
An example of graph limits of growing sequences of random graphs
Ingår i Journal of Combinatorics, s. 67-80, 2013
The number of bit comparisons used by Quicksort: an average-case analysis
Ingår i Electronic Journal of Probability, s. 43, 2012
Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
Ingår i Probability Surveys, s. 103-252, 2012
Renewal theory in the analysis of tries and strings
Ingår i Theoretical Computer Science, s. 33-54, 2012
Hitting Times for Random Walks with Restarts
Ingår i SIAM Journal on Discrete Mathematics, s. 537-547, 2012
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf
Ingår i The Electronic Journal of Combinatorics, 2012
The probability of the Alabama paradox
Ingår i Journal of Applied Probability, s. 773-794, 2012
Generalized Galois numbers, inversions, lattice paths, Ferrers diagrams and limit theorems
Ingår i The Electronic Journal of Combinatorics, 2012
Phase transitions for modified Erdős–Rényi processes
Ingår i Arkiv för matematik, s. 305-329, 2012
Bootstrap percolation on the random graph Gn,p
Ingår i The Annals of Applied Probability, s. 1989-2047, 2012
Susceptibility in inhomogeneous random graphs
Ingår i The Electronic Journal of Combinatorics, 2012
Monotone graph limits and quasimonotone graphs
Ingår i Internet Mathematics, s. 187-231, 2012
A central limit theorem for random ordered factorizations of integers
Ingår i Electronic Journal of Probability, s. 347-361, 2011
On the total external length of the Kingman coalescent
Ingår i Electronic Journal of Probability, s. 2203-2218, 2011
Sparse Random Graphs with Clustering
Ingår i Random structures & algorithms (Print), s. 269-323, 2011
The Mahonian probability distribution on words is asymptotically normal
Ingår i Advances in Applied Mathematics, s. 109-124, 2011
On Vertex, Edge, and Vertex-Edge Random Graphs
Ingår i The Electronic Journal of Combinatorics, 2011
Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
Ingår i Arkiv för matematik, s. 79-96, 2011
On Covering by Translates of a Set
Ingår i Random structures & algorithms (Print), s. 33-67, 2011
Duality in Inhomogeneous Random Graphs, and the Cut Metric
Ingår i Random structures & algorithms (Print), s. 399-411, 2011
Distances Between Pairs of Vertices and Vertical Profile in Conditioned Galton-Watson Trees
Ingår i Random structures & algorithms (Print), s. 381-395, 2011
Quasi-random graphs and graph limits
Ingår i European journal of combinatorics (Print), s. 1054-1083, 2011
Generalized Stirling permutations, families of increasing trees and urn models
Ingår i Journal of combinatorial theory. Series A (Print), s. 94-114, 2011
Long and short paths in uniform random recursive dags
Ingår i Arkiv för matematik, s. 61-77, 2011
Random trees with superexponential branching weights
Ingår i Journal of Physics A, s. 485002, 2011
Poset limits and exchangeable random posets
Ingår i Combinatorica, s. 529-563, 2011
Correlations for Paths in Random Orientations of G(n, p) and G(n, m)
Ingår i Random structures & algorithms (Print), s. 486-506, 2011
Absolutely continuous compensators
Ingår i International Journal of Theoretical and Applied Finance, s. 335-351, 2011
Ingår i Science, s. 298-299, 2011
The maximum of Brownian motion with parabolic drift
Ingår i Electronic Journal of Probability, s. 1893-1929, 2010
A divergent generating function that can be summed and analysed analytically
Ingår i Discrete Mathematics & Theoretical Computer Science, s. 1-22, 2010
Moments of gamma type and the Brownian supremum process area
Ingår i Probability Surveys, s. 1-52, 2010
The Cut Metric, Random Graphs, and Branching Processes
Ingår i Journal of statistical physics, s. 289-335, 2010
Asymptotic Equivalence and Contiguity of Some Random Graphs
Ingår i Random structures & algorithms (Print), s. 26-45, 2010
Random Graphs with Forbidden Vertex Degrees
Ingår i Random structures & algorithms (Print), s. 137-175, 2010
Large cliques in a power-law random graph
Ingår i Journal of Applied Probability, s. 1124-1135, 2010
On the Number of Perfect Matchings in Random Lifts
Ingår i Combinatorics, probability & computing, s. 791-817, 2010
Susceptibility of random graphs with given vertex degrees
Ingår i Journal of Combinatorics, s. 357-387, 2010
On percolation in random graphs with given vertex degrees
Ingår i Electronic Journal of Probability, s. 87-118, 2009
A functional combinatorial central limit theorem
Ingår i Electronic Journal of Probability, s. 2352-2370, 2009
Zeros of sections of the binomial expansion
Ingår i Electronic Transactions on Numerical Analysis, s. 27-38, 2009
Standard representation of multivariate functions on a general probability space
Ingår i Electronic Communications in Probability, s. 343-346, 2009
A new approach to the giant component problem
Ingår i Random structures & algorithms (Print), s. 197-216, 2009
On the size of identifying codes in binary hypercubes
Ingår i Journal of combinatorial theory. Series A (Print), s. 1087-1096, 2009
Ingår i The Electronic Journal of Combinatorics, 2009
Ingår i Combinatorics, probability & computing, s. 83-106, 2009
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
Ingår i Annals of Combinatorics, s. 417-447, 2009
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
Ingår i Annals of Combinatorics, s. 403-416, 2009
The probability that a random multigraph is simple
Ingår i Combinatorics, probability & computing, s. 205-225, 2009
Convergence of some leader election algorithms
Ingår i Discrete Mathematics & Theoretical Computer Science, s. 171-196, 2008
Asymptotic normality of the k-core in random graphs
Ingår i The Annals of Applied Probability, s. 1085-1137, 2008
Local limit theorems for finite and infinite urn models
Ingår i Annals of Probability, s. 992-1022, 2008
A functional limit theorem for the profile of search trees
Ingår i The Annals of Applied Probability, s. 288-233, 2008
The size of random fragmentation trees
Ingår i Probability theory and related fields, s. 399-442, 2008
The largest component in a subcritical random graph with a power law degree distribution
Ingår i The Annals of Applied Probability, s. 1651-1668, 2008
Susceptibility in subcritical random graphs
Ingår i Journal of Mathematical Physics, s. 125207, 2008
Dismantling sparse random graphs
Ingår i Combinatorics, probability & computing, s. 259-264, 2008
Graph limits and exchangeable random graphs
Ingår i Rendiconti di Matematica e delle sue Applicazioni. Serie VII, s. 33-61, 2008
On the asymptotic joint distribution of height and width in random trees
Ingår i Studia scientiarum mathematicarum Hungarica (Print), s. 451-467, 2008
Individual displacements in hashing with coalesced chains
Ingår i Combinatorics, probability & computing, s. 799-814, 2008
Threshold graph limits and random threshold graphs
Ingår i Internet Mathematics, s. 267-320, 2008
Tail estimates for the Brownian excursion area and other Brownian areas
Ingår i Electronic Journal of Probability, s. 1600-1632, 2007
Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas
Ingår i Probability Surveys, s. 80-145, 2007
Monotonicity, asymptotic normality and vertex degrees in random graphs
Ingår i Bernoulli, s. 952-965, 2007
Ingår i Random structures & algorithms (Print), s. 239-246, 2007
Partial fillup and search time in LC tries
Ingår i ACM Transactions on Algorithms, 2007
Graphs with specified degree distributions, simple epidemics and local vaccination strategies
Ingår i Advances in Applied Probability, s. 922-948, 2007
A simple solution to the k-core problem
Ingår i Random structures & algorithms (Print), s. 50-62, 2007
Rainbow Hamilton cycles in random regular graphs
Ingår i Random structures & algorithms (Print), s. 35-49, 2007
On a random graph related to quantum theory
Ingår i Combinatorics, probability & computing, s. 757-766, 2007
A point process describing the component sizes in the critical window of the random graph evolution
Ingår i Combinatorics, probability & computing, s. 631-658, 2007
The phase transition in inhomogeneous random graphs
Ingår i Random structures & algorithms (Print), s. 3-122, 2007
The density of the ISE and local limit laws for embedded trees
Ingår i The Annals of Applied Probability, s. 1597-1632, 2006
Ingår i The Annals of Applied Probability, s. 2195-2214, 2006
Rounding of continuous random variables and oscillatory asymptotics
Ingår i Annals of Probability, s. 1807-1826, 2006
Random cutting and records in deterministic and random trees
Ingår i Random structures & algorithms (Print), s. 139-179, 2006
Left and right pathlengths in random binary trees
Ingår i Algorithmica, s. 419-429, 2006
Congruence properties of depths in some random trees
Ingår i ALEA. Latin American Journal of Probability and Mathematical Statistics, s. 347-366, 2006
Feynman-Kac formulas for Black-Scholes type operators
Ingår i Bull. London Math. Soc., s. 269-282, 2006
Superreplication of options on several underlying assets
Ingår i Journal of Applied Probability, s. 27-38, 2005
Limit theorems for triangular urn schemes
Ingår i Probability Theory and Related Fields, s. 417-452, 2005
Some remarks on the combinatorics of IS_n
Ingår i Semigroup Forum 70, s. 391-405, 2005
Asymptotic degree distribution in random recursive trees
Ingår i Random Structures Algorithms, s. 69-83, 2005
Individual displacements for linear probing hashing with different insertion policies.
Ingår i ACM Transactions on Algorithms, s. 177-213, 2005
The first eigenvalue of random graphs
Ingår i Combin. Probab. Comput., s. 815-825, 2005
The phase transition in the uniformly grown random graph has infinite order
Ingår i Random Structures Algorithms, s. 1-36, 2005
Convergence of discrete snakes
Ingår i J. Theor. Probab, s. 615-645, 2005
Convergence of coined quantum walks on R^d
Ingår i Infin. Dimens. Anal. Quantum Probab. Relat. Top., s. 129-140, 2005
Branching processes, and random-cluster measures on trees.
Ingår i J. Eur. Math. Soc., s. 253-281, 2005
Weak limits for quantum random walks
Ingår i Phys. Rev. E,, 2004
The deletion method for upper tail estimates.
Ingår i Combinatorica, s. 615-640, 2004
On generalized random railways
Ingår i Combin. Probab. Comput., s. 31-35, 2004
Rademacher chaos: tail estimates vs limit theorems
Ingår i Ark. Mat. 42, s. 13-29, 2004
Large deviations for sums of partly dependent random variables
Ingår i Random Struct. Alg., s. 234-248, 2004
Robust reconstruction on trees is determined by the second eigenvalue
Ingår i Ann. Probab., s. 2630-2649, 2004
Upper tails for subgraph counts in random graphs
Ingår i Israel Journal of Mathematics, s. 61-92, 2004
Functional limit theorems for multitype branching processes
Ingår i Stoch. Proc. Appl., s. 177-245, 2004
The center of mass of the ISE and the Wiener index of trees
Ingår i Electronic Comm. Probab., s. 178-187, 2004
On the average sequence complexity
Ingår i Theoretical Computer Science A, s. 213-227, 2004
Preservation of convexity of solutions to parabolic equations
Ingår i J. Diff. Eqs. 206 (2004), 182-226., s. 182-226, 2004
Ingår i Journal of the Iranian Statistical Society, s. 149-164, 2004
Konferensbidrag
Phragmen's Voting Methods and Justified Representation
Ingår i Thirty-First AAAI Conference On Artificial Intelligence, s. 406-413, 2017
Asymptotic normality of statistics on permutation tableaux
Ingår i Algorithmic Probability and Combinatorics, s. 83-104, 2010
Plane recursive trees, Stirling permutations and an urn model
Ingår i Proceedings, Fifth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (Blaubeuren, 2008), s. 541-548, 2008
Ingår i DMTCS Proceedings AofA 2007, 2007
Complex interpolation of compact operators into the couple (FL^oo,FL_1^oo)
Ingår i Interpolation Theory and Applications, 2007
Conditioned Galton-Watson trees do not grow
Ingår i Fourth Colloquium on Mathematics and Computer Science, 2006
Random records and cuttings in complete binary trees
Ingår i Mathematics and Computer Science III, 2004
The number of bit comparisons used by Quicksort: an average-case analysis
Ingår i Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete, 2004
Manuskript (preprint)
Rapporter
Proportionella val inom kommunfullmäktige
2019
Hitting times for random walks with restarts
2010
Moments of Gamma type and the Brownian supremum process area
2010
Graphons, cut norm and distance, couplings and rearrangements
2010
The maximum of Brownian motion with parabolic drift
2010
Bootstrap percolation on the random graph Gn,p
2010
Absolutely Continuous Compensators
2010
Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees
2010
Phase transitions for modified Erdös-Rényi processes
2010
THE MAHONIAN PROBABILITY DISTRIBUTION ON WORDS IS ASYMPTOTICALLY NORMAL
2009
ON THE SPREAD OF SUPERCRITICAL RANDOM GRAPHS
2009
The cut metric, random graphs, and branching processes
2009
Zeros of Sections of the Binomial Expansion
2009
On covering by translates of a set
2009
Renewal theory in analysis of tries and string
2009
Graphs where every k-subset of vertices is an identifying set
2009
Plane recursive trees, stirling permutations and an urn model
2008
On percolation in random graphs with given vertex degrees
2008
2008
Generalized stirling permutations, families of increasing trees and urn models
2008
Susceptibility in subcritical random graph
2008
Sparse random graphs with clustering
2008
On the Size of Identifying Codes in Binary Hypercubes
2008
Convergence of some leader election algorithms
2008
Standard representation of multivariate functions on a general probability space
2008
Asymptotic equivalence and contiguity of some random graphs
2008
On vertex, edge, and vertex-edge random graph
2008
Distances between pairs of vertices and vertical profile in conditioned galton–watson tree
2008
2007
Standard representation of multivariate functions on a general probability space
2007
Graph limits and exchangeable random graphs
2007
Random graphs with forbidden vertex degrees
2007
Random even graphs and the Ising model
2007
Dismantling sparse random graphs
2007
The largest component in a subcritical random graph with a power law degree distribution
2007
A new approach to the giant component problem
2007
Tail estimates for the Brownian excursion area and other Brownian areas
2007
The integral of the supremum process of Brownian motion
2007
Graphs with specified degree distributions, simple epidemics and local vaccination strategies
2007
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
2007
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
2007
Asymptotic normality of the k-core in random graphs
2007
The probability that a random multigraph is simple
2006
On a random graph related to quantum theory
2006
Monotonicity, asymptotic normality and vertex degrees in random graphs
2006
Local limit theorems for finite and infinite urn models
2006
A Functional Limit Theorem for The Profile of Search Trees
2006
Partial Fillup and Search Time in LC Tries
2005
A simple solution to the k-core problem
2005
Rainbow Hamilton cycles in random regular graphs
2005
The density of the ISE and local limit laws for embedded trees
2005
Congruence properties of depths in some random trees
2005
Individual displacements in hashing with coalesced chains
2005
The phase transition in inhomogeneous random graphs
2005
A point process describing the component sizes in the critical window of the random graph evolution
2005
Feynman-Kac formulas for Black-Scholes type operators
2004
Convergence of coined quantum walks on R^d
2004
Left and right pathlenghts in random binary trees
2004
Random cutting and records in deterministic and random trees
2004
Some remarks on the combinatorics of ISn
2004
On the asymptotic joint distribution of height and width in random trees
2004
Rounding of continuous random variables and oscillatory asymptotics
2004
Limit theorems for triangular urn schemes
2004
Branching processes, and random-cluster measures on trees
2004
Sorting with unreliable comparisons: a probabilistic analysis
2003
On the average sequence complexity
2003
Weak limits for quantum random walks
2003
The center of mass of the ISE and the Wiener index of trees
2003
The first eigenvalue of random graphs
2003
Superreplication of options on several underlying assets
2003
Individual displacements for linear probing hashing with different insertion policies
2003
Preservation of Convexity of Solutions to Parabolic Equations
2003
Asymptotic degree distribution in random recursive trees
2003
Functional limit theorems for multitype branching processes and generalized Pólya urns
2003
2003