orcid.org/0000-0002-9680-2790
There is also a separate page with some talks (as pdf files), with links to the list below.
Disclaimer: The files are preprints.
They often do NOT contain the latest versions of the papers.
Conversely, the versions posted here may be revised later.
For published papers, use the corresponding publications for the
final version.
The copyright for published papers is (usually) owned by the publishers.
[IV]
Random Graphs.
(With Tomasz Łuczak and Andrzej Ruciński.)
Wiley, New York, 2000.
ISBN: 0-471-17541-2.
Cover,
Table of Contents,
Errata,
pages 180-181 (missing in some copies).
[III] Gaussian Hilbert Spaces. Cambridge University Press, Cambridge, UK, 1997. ISBN: 0-521-56128-0.
[II] Orthogonal Decompositions and Functional Limit Theorems for Random Graph Statistics. Memoirs Amer. Math. Soc., vol. 111, no. 534, American Mathematical Society, Providence, R.I., 1994. ISBN: 0-8218-2595-X.
[I] Poisson Approximation. (With Andrew D. Barbour and Lars Holst.) Oxford University Press, Oxford, UK, 1992. ISBN: 0-19-852235-5.
[391] The number of descendants in a preferential attachment graph. (With Tiffany Y. Y. Lo.)
[390] The critical beta-splitting random tree IV: Mellin analysis of leaf height. (With David J. Aldous.) arXiv:2412.12319 pdf
[389] The critical beta-splitting random tree III: The exchangeable partition representation and the fringe tree. (With David J. Aldous.) arXiv:2412.09655 pdf
[388] Periodic minimum in the count of binomial coefficients not divisible by a prime. (With Hsien-Kuei Hwang and Tsung-Hsi Tsai.) arXiv:2408.06817 pdf
[387] The critical beta-splitting random tree II: overview and open problems. (With David J. Aldous.) arXiv:2303.02529v2 pdf
[386] The harmonic descent chain. (With David J. Aldous and Xiaodan Li.) Electronic Communications in Probability, 29 (2024), paper no. 77, 1-10. pdf
[385] Fringe trees of Patricia tries and compressed binary search trees. arXiv:2405.01239 pdf
[384] Extended abstract: Depth-First Search performance in random digraphs. (With Philippe Jacquet.) 35rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), LIPIcs, Volume 302, pp. 30:1-30:15, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik (2024) pdf
[383] Bit-array-based alternatives to HyperLogLog. (With Robert Sedgewick and Jérémie Lumbroso.) 35rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), LIPIcs, Volume 302, pp. 5:1-5:19, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik (2024). pdf
[382] Better-than-average uniform random variables and Eulerian numbers, or: How many candidates should a voter approve? (With Warren D. Smith.) arXiv:2403.02670 pdf
[381] On semi-restricted Rock, Paper, Scissors. Electronic J. Combinatorics 31:2 (2024), P2.20. pdf
[380] Almost sure and moment convergence for triangular Pólya urns. arXiv:2402.01299 pdf
[379] Uncovering a graph. arXiv:2312.13823 pdf
[378]
Fringe trees for random trees with given vertex degrees.
(With Gabriel Berzunza Ojeda and Cecilia Holmgren.)
arXiv:2312.04243
pdf
[378x]
Extended abstract:
Fringe trees for random trees with given vertex degrees.
(With Gabriel Berzunza Ojeda and Cecilia Holmgren.)
35rd International Conference on Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms (AofA 2024),
LIPIcs, Volume 302, pp. 1:1-1:13,
Schloss Dagstuhl -- Leibniz-Zentrum für Informatik (2024).
pdf
[377] Approximation of subgraph counts in the uniform attachment model. (With Johan Björklund, Cecilia Holmgren, and Tiffany Y. Y. Lo.) Combinatorics, Probability and Computing, to appear. arXiv:2311.04184 pdf
[376] On a central limit theorem in renewal theory. Statistics & Probability Letters 204 (2024), 109948. pdf
[375] Central limit theorem for components in meandric systems through high moments. (With Paul Thévenin.) Combinatorics, Probability and Computing, to appear. arXiv:2303.01900 pdf
[374] The number of descendants in a random directed acyclic graph. Random Structures Algorithms 64:3 (2024), 768-803. pdf
[373]
On the statistics of the number of fixed-dimensional subcubes in a random
subset of the n-dimensional discrete unit cube.
(With Blair Seidler and Doron Zeilberger.)
Palestinian Journal of Mathematics,
12:3 (2023), 512-520.
pdf
See also the
web page with Maple package (by Doron Zeilberger).
[372]
On Knuth's conjecture
for back and forward arcs in Depth-First Search in a random digraph with
geometric outdegree distribution.
January 2023.
arXiv:2301.04131
pdf
(The conjecture made here was quickly proved by Zipei Nie
arXiv:2301.05704.)
[371] Conditioned Galton-Watson trees: The shape functional, and more on the sum of powers of subtree sizes. (With James A. Fill and Stephan Wagner.) La Matematica (2024). pdf
[370] Estimating global subgraph counts by sampling. (With Valentas Kurauskas.) Electronic J. Combinatorics 30:2 (2023), P2.24. pdf
[369]
Identities and periodic oscillations of divide-and-conquer
recurrences splitting at half.
(With Hsien-Kuei Hwang and Tsung-Hsi Tsai.)
Advances in Applied Mathematics
155 (2024), 102653.
Full version:
arXiv:2210.10968
pdf
[368] Quantitative bounds in the central limit theorem for m-dependent random variables. (With Luca Pratelli and Pietro Rigo.} Alea Lat. Am. J. Probab. Math. Stat., 21 (2024), 245-265. pdf
[367] The number of occurrences of patterns in a random tree or forest permutation. Electronic J. Combinatorics 30:2 (2023), P2.27. pdf
[366] Edge coherence in multiplex networks. (With Swati Chandna and Sofia C. Olhede.) arXiv:2202.09326 pdf
[365] Fluctuations of subgraph counts in graphon based random graphs. (With Bhaswar B. Bhattacharya and Anirban Chatterjee.) Combinatorics, Probability and Computing 32:3 (2023), 428-464. pdf
[364]
Depth-First Search performance in a random digraph with geometric
outdegree distribution.
(With Philippe Jacquet.)
La Matematica
(2024).
pdf
[364x]
Extended abstract:
Depth-First Search performance in a random digraph with geometric degree
distribution.
(With Philippe Jacquet.)
33rd International Conference on Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms (AofA 2022),
LIPIcs
225.
pdf
[363] Fluctuations of balanced urns with infinitely many colours. (With Cécile Mailler and Denis Villemonais.) Electronic Journal of Probability 28 (2023), paper no. 82, 1-72. pdf
[362] Unicellular maps vs hyperbolic surfaces in large genus: simple closed curves. (With Baptiste Louf.) Annals of Probability, 51:3 (2023), 899-929. pdf
[361] A central limit theorem for m-dependent variables. arXiv:2108.12263 pdf
[360] Asymptotic normality for m-dependent and constrained U-statistics, with applications to pattern matching in random strings and permutations. Advances in Applied Probability 55 (2023), 841-894. pdf
[359]
The sum of powers of subtree sizes for conditioned Galton-Watson trees.
(With James Allen Fill.)
Electronic Journal of Probability
27 (2022), article no. 114, 1-77.
pdf
Corrigendum:
Electronic Journal of Probability
28 (2023), article no. 23, 1-2.
pdf
[358] Short cycles in high genus unicellular maps. (With Baptiste Louf.) Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 58:3 (2022), 1547-1564. pdf
[357] Can smooth graphons in several dimensions be represented by smooth graphons on [0,1]? (With Sofia Olhede.) Examples and Counterexamples 1 (2021), 100011. pdf
[356] Minimal matchings of point processes. (With Alexander E. Holroyd and Johan Wästlund.) Probability Theory and Related Fields, 184 (2022), 571-611. pdf
[355] On general subtrees of a conditioned Galton--Watson tree. Electronic Communications in Probability, 26 (2021), paper no. 23, 1-12. pdf
[354] On the probability that a binomial variable is at most its expectation. Statistics & Probability Letters 171 (2021), 109020. pdf
[353] The distance profile of rooted and unrooted simply generated trees. (With Gabriel Berzunza Ojeda.) Combinatorics, Probability and Computing 31:3 (2022) 368-410. pdf
[352] Tree limits and limits of random trees. Combinatorics, Probability and Computing 30 (2021), 849-893. pdf
[351] Continuous time digital search tree and a border aggregation model. (With Debleena Thacker.) Bernoulli 28(4) (2022), 2563-2577. pdf
[350] The space D in several variables: random variables and higher moments. Mathematica Scandinavica 127 (2021), 544-584 pdf
[349]
Hidden words statistics for large patterns.
(With Wojciech Szpankowski.)
Electronic J. Combinatorics 28:2 (2021), P2.36.
pdf
[349x]
Extended abstract:
Hidden words statistics for large patterns.
(With Wojciech Szpankowski.)
31st International Conference on Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms (AofA 2020),
LIPIcs
159.
pdf
[348] On the independence number of some random trees. Electronic Communications in Probability 25 (2020), paper no. 63, 1-14. pdf
[347] Central limit theorems for additive functionals and fringe trees in tries. Electronic J. Probability 27 (2022), paper no. 47, 1-63. pdf
[346] To fixate or not to fixate in two-type annihilating branching random walks. (With Daniel Ahlberg and Simon Griffiths.) Annals of Probability 49:5 (2021), 2637-2667. pdf
[345] Rate of convergence for traditional Pólya urns. Journal of Applied Probability 57:4 (2020), 1029-1044. pdf
[344] On distance covariance in metric and Hilbert spaces. Alea Lat. Am. J. Probab. Math. Stat. 18 (2021), 1353-1393. pdf
[343] A graphon counter example. Discrete Math., 343:6 (2020), 111836. pdf
[342]
Successive minimum spanning trees.
(With Gregory Sorkin.)
Random Structures Algorithms 61 (2022), no. 1, 126-172.
pdf
[342x]
Extended abstract:
Successive minimum spanning trees
(With Gregory Sorkin.)
APPROX/RANDOM 2019,
LIPIcs 145.
[341] Preferential attachment without vertex growth: emergence of the giant component. (With Lutz Warnke.) Annals of Applied Probability, 31 (2021), no. 4, 1523-1547. pdf
[340] Strong convergence of infinite color balanced urns under uniform ergodicity. (With Antar Bandyopadhyay and Debleena Thacker.) Journal of Applied Probability 57:3, 853-865. arXiv:1904.06144 pdf
[339] Random graphs with given vertex degrees and switchings. Random Structures Algorithms 57:1 (2020), 3-31. pdf
[338] Asymptotic normality in random graphs with given vertex degrees. Random Structures Algorithms 56:4 (2020), 1070-1116. pdf
[337] Tensor norms on ordered normed spaces, polarization constants, and exchangeable distributions. Math. Nachrichten 294:8 (2021), 1484-1522. pdf
[336] Long term behaviour of a reversible system of interacting random walks. (With Vadim Shcherbakov and Stanislav Volkov.) Journal of Statistical Physics 175:1 (2019), 71-96. pdf
[335] The hiring problem with rank-based strategies. Electronic J. Probability 24 (2019), paper no. 125, 1-35. pdf
[334] Preferential attachment when stable. (With Subhabrata Sen and Joel Spencer.) Advances in Applied Probability 51:4 (2019), 1067-1108. pdf
[333]
Patterns in random permutations avoiding some sets of multiple patterns.
Algorithmica
82 (2020), 616-641.
pdf
[333x]
Extended abstract:
Patterns in random permutations avoiding some other patterns.
Proceedings of the
29th International Conference on Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms, AofA 2018, (Uppsala, Sweden, 2018)
pdf
[332] Renewal theory for asymmetric U-statistics. Electronic J. Probability 23 (2018), paper no. 129, 27 pp. pdf
[331] A.s. convergence for infinite colour Pólya urns associated with random walks. Ark. Mat. 59 (2021), 87-123. pdf
[330] Non-fringe subtrees in conditioned Galton-Watson trees. (With Xing Shi Cai.) Electronic J. Combinatorics 25 (2018), no. 3, paper P3.40. pdf
[329]
Asymptotics of fluctuations in Crump--Mode--Jagers processes:
the lattice case.
Advances in Applied Probability,
Special Volume 50A (2018), 141-171.
pdf
This version includes [326].
Earlier shorter version, now obsolete:
Fluctuations in Crump-Mode-Jagers processes: the lattice case.
arXiv:1712.02648v1
pdf
[328] Tail bounds for sums of geometric and exponential variables. Statistics Probability Letters 135 (2018), 1-6. pdf
[327] Random replacements in Pólya urns with infinitely many colours. Electronic Communications in Probability 24 (2019), paper no. 23, 1-11. pdf
[326]
Asymptotic normality in Crump-Mode-Jagers processes: the lattice case.
arXiv:1711.06514
pdf
This paper is now obsolete; it is included in the final version of
[329],
published in
Advances in Applied Probability
Special Volume 50A (2018).
[325] Competing first passage percolation on random graphs with finite variance degrees. (With Daniel Ahlberg and Maria Deijfen.) Random Structures Algorithms 55 (2019), no. 3, 545-559. pdf
[324] Patterns in random permutations avoiding the pattern 321. Random Structures Algorithms 55 (2019), no. 2, 249-270. pdf
[323] A piecewise contractive dynamical system and election methods. (With Anders Öberg.) Bulletin de la Société Mathématique de France 147:3 (2019), 395-411. pdf
[322]
Inversions in split trees and conditional Galton-Watson trees.
(With Xing Shi Cai, Cecilia Holmgren, Tony Johansson and Fiona Skerman.)
Combin. Probab. Comput.
28:3 (2019), 335-364.
pdf
[322x]
Extended abstract:
Inversions in split trees and conditional Galton-Watson trees.
(With Xing Shi Cai, Cecilia Holmgren, Tony Johansson and Fiona Skerman.)
Proceedings of the
29th International Conference on Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms, AofA 2018, (Uppsala, Sweden, 2018)
pdf
[321]
Phragmén's voting methods and justified representation.
(With Markus Brill, Rupert Freeman and Martin Lackner.)
Mathematical Programming
203 (2024), 47-76.
pdf
[321x]
Conference version:
Phragmén's voting methods and justified representation.
(With Markus Brill, Rupert Freeman and Martin Lackner.)
Proceedings,
Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017),
AAAI Press, Palo Alto, CA, 2017,
406-413.
pdf
[320] Random recursive trees and preferential attachment trees are random split trees. Combin. Probab. Comput. 28:1 (2019), 81-99. pdf
[319] Sesqui-type branching processes. (With Oliver Riordan and Lutz Warnke.) Stoch. Proc. Appl. 128 (2018), 3268-3655. pdf
[318] Comments on Sparse graphs using exchangeable random measures by François Caron and Emily B. Fox. (Written contribution to a Royal Statistical Society discussion meeting.) J. Royal Statistical Society Series B 79 (2017), 1352. (The paper by Caron and Fox with discussion: pp. 1295-1366.) pdf
[317] On edge exchangeable random graphs. J. Statistical Physics 173 (2018), no. 3-4, 448-484. pdf (JSP, view-only) pdf
[316] On convergence for graphexes. European J. Combinatorics 104 (2022), Paper No. 103549, 13 pp. pdf
[315] Exact and asymptotic solutions of a divide-and-conquer recurrence dividing at half: theory and applications. (With Hsien-Kuei Hwang and Tsung-Hsi Tsai.) ACM Transactions on Algorithms (TALG) 13:4 (2017), Article No. 47. pdf
[314] On the critical probability in percolation. (With Lutz Warnke.) Electronic J. Probability 23 (2018), paper no. 1, 25 pp. pdf
[313] Component structure of the configuration model: barely supercritical case. (With Remco van der Hofstad and Malwina Luczak.) Random Structures Algorithms, 55:1 (2019), 3-55. pdf
[312] Competition in growth and urns. (With Daniel Ahlberg, Simon Griffiths, and Robert Morris.) Random Structures Algorithms, 54:2 (2019), 211-227. pdf
[311] Graphons and cut metric on σ-finite measure spaces. arXiv:1608.01833 pdf
[310] Moment convergence of balanced Pólya processes. (With Nicolas Pouyanne.) Electronic J. Probability 23 (2018), paper no. 34, 1-13. pdf
[309]
Multivariate normal limit laws for the numbers of fringe subtrees
in m-ary search trees and preferential attachment trees.
(With Cecilia Holmgren and Matas Šileikis.)
Electronic J. Combinatorics
24 (2017), no. 2, paper #P2.51.
[309x]
Extended abstract:
Using Pólya urns to show normal limit laws for fringe subtrees
in m-ary search trees.
(With Cecilia Holmgren and Matas Šileikis.)
Proceedings of the 27th International Conference on Probabilistic,
Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA'16
(Krakow, Poland, 2016).
pdf
[308] On a representation theorem for finitely exchangeable random vectors. (With Takis Konstantopoulos and Linglong Yuan.) Journal of Mathematical Analysis and Applications, 442 (2016), 703-714. pdf
[307] Mean and variance of balanced Pólya urns. Advances in Applied Probability 52:4 (2020), 1224-1248. pdf
[306] Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees. (With Cecilia Holmgren.) Probability Surveys 14 (2017), 53-154. pdf
[305] A modified bootstrap percolation on a random graph coupled with a lattice. (With Robert Kozma, Miklós Ruszinkó, Yury Sokolov.) Discrete Applied Mathematics, 258 (2019), 152-165. pdf
[304] The greedy independent set in a random graph with given degrees. (With Graham Brightwell and Malwina Luczak.) Random Structures Algorithms 51:4 (2017), 565-586. pdf
[303] The inverse first-passage problem and optimal stopping. (With Erik Ekström.) Annals of Applied Probability, 26 (2016), no. 5, 3154-3177. pdf
[302] On the tails of the limiting Quicksort distribution. Electronic Communications in Probability 20 (2015), no. 81, 7 pp. pdf
[301] Consistent random vertex-orderings of graphs. (With Paul Balister and Béla Bollobás.) arXiv:1506.03343 pdf
[300] Near-critical SIR epidemic on a random graph with given degrees. (With Malwina Luczak, Peter Windridge and Thomas House.) Journal of Mathematical Biology 74 (2017), no. 4, 843-886. pdf (Springer, view-only) pdf
[299] Maximal clades in random binary search trees. Electronic J. Combinatorics 22 (2015), no. 1, paper #P1.31. pdf
[298] Packing random graphs and hypergraphs. (With Béla Bollobás and Alex Scott.) Random Structures Algorithms, 51:1 (2017), 3-13. pdf
[297]
A unified approach to linear probing hashing with buckets.
(With Alfredo Viola.)
Algorithmica, 75 (2016), no. 4, 724-781.
pdf (Springer, view-only)
pdf
[297x]
Extended abstract:
A unified approach to linear probing hashing. (With Alfredo Viola.)
Proceedings of the 25th International Conference on Probabilistic,
Combinatorial and Asymptotic Methods for the Analysis of Algorithms,
(AofA '14; Paris, 2014),
DMTCS-HAL Proceedings Series BA, 2014, 205-216.
pdf
[296]
Limit laws for functions of fringe trees for binary search trees and
recursive trees.
(With Cecilia Holmgren.)
Electronic J. Probability
20 (2015), no. 4, 1-51.
pdf
Extended abstract:
Using Stein's method to show Poisson and normal limit laws for fringe trees.
(With Cecilia Holmgren.)
Proceedings of the 25th International Conference on Probabilistic,
Combinatorial and Asymptotic Methods for the Analysis of Algorithms,
(AofA '14; Paris, 2014),
DMTCS-HAL Proceedings Series BA, 2014, 169-180.
pdf
[295]
The lower tail: Poisson approximation revisited.
(With Lutz Warnke.)
Random Structures Algorithms 48 (2016), no. 2, 219-246.
pdf
Extended abstract:
The lower tail: Poisson approximation revisited.
(With Lutz Warnke.)
In
Extended Abstracts Summer 2015,
Strategic Behavior in Combinatorial Structures,
Research Perspectives CRM Barcelona, Birkhäuser, 2017.
[294] More on quasi-random graphs, subgraph counts and graph limits. (With Vera T. Sós.) European J. Combinatorics 46 (2015), 134-160. pdf
[293] On the typical structure of graphs in a monotone property. (With Andrew J. Uzzell.) Electronic J. Combinatorics 21 (2014), no. 3, paper #P3.34. pdf
[292] Asymptotic distribution of two-protected nodes in ternary search trees. (With Cecilia Holmgren.) Electronic J. Probability 20 (2015), no. 9, 1-20. pdf
[291] On string graph limits and the structure of a typical string graph. (With Andrew J. Uzzell.) J. Graph Theory 84:4 (2017), 386-407. arXiv:1403.2911 pdf
[290]
Patterns in random permutations avoiding the pattern 132,
Combin. Probab. Comput.,
26 (2017), 24-51.
pdf
(c) Cambridge University Press
Longer version:
arXiv:1401.5679
[289]
On symmetry of uniform and preferential attachment graphs.
(With Abram Magner, Giorgos Kollias and Wojciech Szpankowski.)
Electronic J. Combinatorics
21 (2014), no. 3, paper #P3.32.
pdf
[289x]
Extended abstract.
Proceedings of the 25th International Conference on Probabilistic,
Combinatorial and Asymptotic Methods for the Analysis of Algorithms,
(AofA '14; Paris, 2014),
DMTCS-HAL Proceedings Series BA, 2014, 277-288.
pdf
[288] Graph properties, graph limits and entropy. (With Hamed Hatami and Balázs Szegedy.) J. Graph Theory 87:2 (2018), 208-229. pdf
[287]
On the asymptotic statistics of the number of occurrences of multiple
permutation patterns.
(With Brian Nakamura and Doron Zeilberger.)
Journal of Combinatorics 6 (2015), no. 1-2, 117-143.
pdf
See also
Maple packages and comments (by Doron Zeilberger).
[286] On degenerate sums of m-dependent variables. Journal of Applied Probability 52 (2015), no. 4, 1146-1155. arXiv:1312.1563 pdf
[285]
Asymptotic normality of fringe subtrees and additive functionals
in conditioned Galton-Watson trees.
Random Structures Algorithms,
48 (2016), no. 1, 57-101.
pdf
[285x]
Extended abstract:
Proceedings of the 25th International Conference on Probabilistic,
Combinatorial and Asymptotic Methods for the Analysis of Algorithms,
(AofA '14; Paris, 2014),
DMTCS-HAL Proceedings Series BA, 2014, 193-204.
pdf
[284] VCG auction mechanism cost expectations and variances. (With Gregory Sorkin.) arXiv:1310.1777 pdf
[283] Protected nodes and fringe subtrees in some random trees. (With Luc Devroye.) Electronic Communications in Probability 19 (2014), no. 6, 1-10. pdf
[282] Law of large numbers for the SIR epidemic on a random graph with given degrees. (With Malwina Luczak and Peter Windridge.) Random Structures Algorithms 45 (2014), no. 4, 726-763. pdf
[281] The probability that a random multigraph is simple, II. Journal of Applied Probability 51A (2014), 123-137. pdf
[280] Euler-Frobenius numbers and rounding. Online Journal of Analytic Combinatorics 8 (2013), Paper 5. pdf
[279] Bootstrap percolation on Galton-Watson trees. (With Béla Bollobás, Karen Gunderson, Cecilia Holmgren and Michał Przykucki.) Electronic J. Probability 19 (2014), Article 13, 1-27. pdf
[278] First critical probability for a problem on random orientations in G(n,p). (With Sven Erick Alm and Svante Linusson.) Electronic J. Probability, 19 (2014), Article 69. pdf
[277] On the length of a random minimum spanning tree. (With Colin Cooper, Alan Frieze, Nate Ince and Joel Spencer.) Combin. Probab. Comput., 25:1 (2016), 89-107. pdf ps
[276]
Weighted random staircase tableaux.
(With Pawel Hitczenko.)
Combin. Probab. Comput.
23 (2014), special issue 6, 1114-1147.
(Published online 15 July 2014.)
pdf
ps
[276x]
Extended abstract (with Pawel Hitczenko):
Weighted staircase tableaux, asymmetric exclusion process,
and Eulerian type recurrences.
LATIN 2014: Theoretical Informatics
(Proceedings, 11th Latin American Symposium, Montevideo, Uruguay, 2014),
Lecture Notes in Computer Science 8392, Springer, 2014.
pdf
[275] Scaling limits of random planar maps with a unique large face. (With Sigurður Örn Stefánsson.) Annals of Probability, 43 (2015), no. 3, 1045-1081. pdf
[274] Asymptotic distribution of the maximum interpoint distance in a sample of random vectors with a spherically symmetric distribution. (With Sreenivasa Rao Jammalamadaka.) Annals of Applied Probability 25 (2015), no. 6, 3571-3591. pdf
[273] Feynman-Kac theorems for generalized diffusions. (With Erik Ekström and Johan Tysk.) Trans. Amer. Math. Soc. 367 (2015), no. 11, 8051-8070. arXiv:1210.6472 [math.AP] pdf ps
[272] Moments of the location of the maximum of Brownian motion with parabolic drift. Electronic Communications in Probability, 18 (2013), no. 15, 1-8. pdf ps
[271] Higher moments of Banach space valued random variables. (With Sten Kaijser.) Memoirs Amer. Math. Soc., vol. 238, no. 1127 (2015). pdf ps
[270] Influences in product spaces. (With Geoffrey Grimmett and James Norris.) Advances in Applied Probability 48A (2016), 145-152. pdf
[269] An example of graph limits of growing sequences of random graphs. (With Simone Severini.) Journal of Combinatorics 4 (2013), no. 1, 67-80. pdf ps
[268] Note on a partition limit theorem for rank and crank. (With Persi Diaconis and Robert C. Rhoades.) Bulletin London Math. Soc. 45 (2013), no. 3, 551-553. pdf ps
[267] Generalized Galois numbers, inversions, lattice paths, Ferrers diagrams and limit theorems. Electronic J. Combin. 19(3) (2012), #P34. pdf ps
[266] Partitions with distinct multiplicities of parts: on an ``unsolved problem'' posed by Herbert Wilf. (With James Allen Fill and Mark Daniel Ward.) Electronic J. Combin. 19(2) (2012), #P18. pdf ps
[265]
The number of bit comparisons used by Quicksort: an average-case analysis.
(With James Allen Fill.)
Electronic J. Probability 17 (2012), Article 43, 1-22.
pdf
ps
Extended abstract: [160]
[264]
Simply generated trees, conditioned Galton-Watson trees,
random allocations and condensation.
Probability Surveys, 9 (2012), 103-252.
pdf
ps
[264x]
Extended abstract:
Proceedings, 2012 Conference on Analysis of Algorithms, AofA '12
(Montreal, 2012),
DMTCS Proceedings 2012, 479-490.
pdf
ps
[263] Coupon collecting with or without replacement, and with multipurpose coupons. (With Marcel Wild, Stephan Wagner and Dirk Laurie.) Discrete Mathematics & Theoretical Computer Science (DMTCS), 15:2 (2013), 259-270. arXiv:1107.1401 [math.PR] pdf
[262] Asymptotic bias of some election methods. Annals of Operations Research, 215:1 (2014), 89-136. pdf ps
[261] Superboolean rank and the size of the largest triangular submatrix of a random matrix. (With Zur Izhakian and John Rhodes.) Proc. Amer. Math. Soc., 143 (2015), no. 1, 407-418. pdf ps
[260] Networking - smoothly does it. Science 333, no. 6040, 298-299, 15 July 2011. Reprint Summary
[259] Random trees with superexponential branching weights. (With Thordur Jonsson and Sigurður Stefánsson.) J. Phys. A: Math. Theor. 44 (2011) 485002. pdf ps
[258] The probability of the Alabama paradox. (With Svante Linusson.) Journal of Applied Probability 49 (2012), no. 3, 773-794. pdf ps
[257] Limits of interval orders and semiorders. Journal of Combinatorics 3 (2012), no. 2, 163-183. pdf ps
[256] Can time-homogeneous diffusions produce any distribution? (With Erik Ekström, David Hobson and Johan Tysk.) Probability Theory and Related Fields 155 (2013), no. 3-4, 493-520. pdf ps
[255] Graph limits and hereditary properties. European J. Combinatorics, 52 (2016), 321-337. pdf ps
[254] Interval graph limits. (With Persi Diaconis and Susan Holmes.) Annals of Combinatorics 17 (2013), no. 1, 27-52. pdf
[253] Monotone graph limits and quasimonotone graphs. (With Béla Bollobás and Oliver Riordan.) Internet Mathematics, 8 (2012) no. 3, 187-231. pdf ps
[252] On the total external length of the Kingman coalescent. (With Götz Kersting.) Electronic J. Probability 16 (2011), Paper 80, pages 2203-2218. pdf ps
[251] Bootstrap percolation on the random graph G_{n,p}. (With Tomasz Łuczak, Tatyana Turova and Thomas Vallier.) Annals of Applied Probability 22 (2012), No. 5, 1989-2047. pdf ps
[250] Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees. (With Louigi Addario-Berry and Luc Devroye.) Ann. Probab. 41 (2013), no. 2, 1072-1087. pdf ps
[249] Graphons, cut norm and distance, couplings and rearrangements. NYJM Monographs 4, 2013. pdf ps
[248] Correlations for paths in random orientations of G(n,p) and G(n,m). (With Sven Erick Alm and Svante Linusson.) Random Structures Algorithms 39 (2011), no. 4, 486-506. pdf ps
[247] Phase transitions for modified Erdös-Rényi processes. (With Joel Spencer.) Ark. Mat. 50 (2012), no. 2, 305-329. pdf ps
[246] Absolutely continuous compensators. (With Sokhna M'Baye and Philip Protter.) International Journal of Theoretical & Applied Finance (IJTAF) 14 (2011), no. 3, 335-351. pdf ps
[245] Hitting times for random walks with restarts. (With Yuval Peres.) SIAM J. Discrete Math. 26 (2012), no. 2, 537-547. pdf ps
[244]
Moments of Gamma type and the Brownian supremum process area.
Probability Surveys, 7 (2010), 1-52.
pdf
ps
[244-add]
Addendum:
Probability Surveys, 7 (2010), 207-208.
pdf
ps
[244-appendix]
Appendix with further examples:
arXiv:1204.5637 [math.PR]
pdf
ps
[243]
The maximum of Brownian motion with parabolic drift.
(With Guy Louchard and Anders Martin-Löf.)
Electronic J. Probab. 15 (2010),
paper 61, pp. 1893-1929.
pdf
[243x]
Extended abstract:
Proceedings, 2010 Conference on Analysis of Algorithms, AofA '10
(Vienna, 2010),
DMTCS Proceedings 2010, 427-438.
pdf
ps
[242]
Renewal theory in the analysis of tries and strings.
Theoretical Computer Science
416 (2012), 33-54.
pdf
ps
[242x]
Extended abstract:
Proceedings, 2010 Conference on Analysis of Algorithms, AofA '10
(Vienna, 2010),
DMTCS Proceedings 2010, 415-426.
pdf
ps
[241] Susceptibility of random graphs with given vertex degrees. Journal of Combinatorics 1 (2010), no. 3-4, 357-387. pdf ps
[240] On covering by translates of a set. (With Béla Bollobás and Oliver Riordan.) Random Structures Algorithms 38 (2011), no. 1/2, 33-67. pdf ps
[239]
The Mahonian probability distribution on words is asymptotically normal.
(With E. Rodney Canfield and Doron Zeilberger.)
Adv. Appl. Math.
46 (2011), no. 1-4,
109-124.
pdf
ps
Erratum:
pdf
ps
See also the Maple package
MahonianStat (by Doron Zeilberger).
[238] Threshold graph limits and random threshold graphs. (With Persi Diaconis and Susan Holmes.) Internet Mathematics 5 (2008), no. 3, 267-318. pdf
[237] On the number of perfect matchings in random lifts. (With Catherine Greenhill and Andrzej Ruciński.) Combin. Probab. Comput. 19 (2010), no. 5-6, 791-817. pdf ps
[236] A functional combinatorial central limit theorem. (With Andrew Barbour.) Electronic J. Probab. 14 (2009), paper 81, 2352-2370. pdf ps
[235] Long and short paths in uniform random recursive dags. (With Luc Devroye.) Ark. Mat. 49 (2011), no. 1, 61-77. pdf ps
[234] Quasi-random graphs and graph limits. European J. Combinatorics 32 (2011), 1054-1083. pdf ps
[233] Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs. (With Andrzej Ruciński.) Ark. Mat. 49 (2011), no. 1, 79-96. pdf ps
[232] Susceptibility in inhomogeneous random graphs. (With Oliver Riordan.) Electronic J. Combin. 19(1) (2012), #P31. pdf ps
[231] Large cliques in a power-law random graph. (With Tomasz Łuczak and Ilkka Norros.) Journal of Applied Probability 47 (2010), no. 4, 1124-1135. pdf ps
[230] Duality in inhomogeneous random graphs, and the cut metric. (With Oliver Riordan.) Random Structures Algorithms 39 (2011), no. 3, 399-411. pdf ps
[229] Asymptotic normality of statistics on permutation tableaux. (With Pawel Hitczenko.) Algorithmic Probability and Combinatorics (DePaul, 2007), Contemporary Mathematics 520, Amer. Math. Soc., Providence, RI, 2010, pp. 83-104. pdf ps
[228] Zeros of sections of the binomial expansion. (With Timothy Norfolk.) Electron. Trans. Numer. Anal. (ETNA) 36 (2009), 27-38. pdf ps
[227]
A central limit theorem for random ordered factorizations of integers.
(With Hsien-Kuei Hwang.)
Electronic J. Probab. 16 (2011), Paper 12, 347-361.
pdf
ps
Erratum:
Electronic J. Probab. 18 (2013), Paper 16, 1-3.
pdf
[226]
On the spread of random graphs.
(With Louigi Addario-Berry and Colin McDiarmid.)
Combin. Probab. Comput. 23 (2014), no. 4, 477-504.
pdf
Revised 9 August 2012. Earlier version:
On the spread of supercritical random graphs.
[225] Graphs where every k-subset of vertices is an identifying set. (With Sylvain Gravier, Tero Laihonen and Sanna Ranto.) Discrete Mathematics & Theoretical Computer Science (DMCTS) 16 (2014), no. 1, 73-88. pdf ps
[224]
Poset limits and exchangeable random posets.
Combinatorica
31 (2011), no. 5, 529-563.
Preprint version:
arXiv:0902.0306 [math.PR]
pdf
ps
[223] The cut metric, random graphs, and branching processes. (With Béla Bollobás and Oliver Riordan.) Journal of Statistical Physics 140:2 (2010), 289-335. pdf ps
[222] Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. (With Luc Devroye.) Random Structures Algorithms 38 (2011), no. 4, 381-395. pdf ps
[221]
On vertex, edge, and vertex-edge random graphs.
(With Elizabeth Beer, James Allen Fill and Edward R. Scheinerman.)
Electronic J. Combin.
18(1) (2011), #P110.
pdf
[221x]
Extended abstract:
Proceedings, Workshop on Analytic Algorithms and Combinatorics,
ANALCO'11 (San Francisco, 2011),
pdf;
[220] A divergent generating function that can be summed and analysed analytically. Discrete Mathematics & Theoretical Computer Science (DMTCS) 12:2 (2010), 1-22. pdf ps
[219] Sparse random graphs with clustering. (With Béla Bollobás and Oliver Riordan.) Random Structures Algorithms 38 (2011), no. 3, 269-323. pdf ps
[218] Susceptibility in subcritical random graphs. (With Malwina Luczak.) J. Math. Phys. 49:12 (2008), 125207. pdf ps
[217] Generalized Stirling permutations, families of increasing trees and urn models. (With Markus Kuba and Alois Panholzer.) J. Combin. Theory Ser. A, 118 (2010), 94-114. pdf
[216]
On the size of identifying codes in binary hypercubes.
(With Tero Laihonen.)
J. Combin. Theory Ser. A,
116 (2009), no. 5, 1087-1096.
pdf
ps
[216x]
Extended abstract:
An optimal result for codes identifying sets of words.
2009 IEEE International Symposium on Information Theory (ISIT2009),
2547-2551.
[215] On percolation in random graphs with given vertex degrees. Electronic J. Probab. 14 (2009), Paper 5, 86-118. pdf ps
[214]
Plane recursive trees, Stirling permutations and an urn model
.
Proceedings,
Fifth Colloquium on Mathematics and Computer Science
(Blaubeuren, 2008)
,
DMTCS Proceedings
AI (2008), 541-548.
pdf
ps
Corrigendum:
pdf
ps
[213] Connectedness in graph limits. Tech. Report 2008:8, Uppsala. arXiv:0802.3795 [math.CO] pdf ps
[212] Asymptotic equivalence and contiguity of some random graphs. Random Structures Algorithms, 36 (2010), no. 1, 26-45. pdf ps
[211] Convergence of some leader election algorithms. (With Christian Lavault and Guy Louchard.) Discrete Mathematics & Theoretical Computer Science (DMTCS) 10:3, (2008), 171-196. pdf ps
[210] Standard representation of multivariate functions on a general probability space. Electronic Comm. Probab. 14 (2009), paper 34, 343-346. pdf ps
[209] Graph limits and exchangeable random graphs. (With Persi Diaconis.) Rendiconti di Matematica, 28 (2008), 33-61. pdf ps
[208] Random graphs with forbidden vertex degrees. (With Geoffrey Grimmett.) Random Structures Algorithms, 37:2 (2010), 137-175. pdf ps
[207]
Random even graphs.
(With Geoffrey Grimmett.)
Electronic J. Combin.
16(1) (2009), #R46.
pdf
ps
(Older version:
Random even graphs and the Ising model.
pdf
ps)
[206] Dismantling sparse random graphs. (With Andrew Thomason.) Combin. Probab. Comput. 17 (2008), 259-264. pdf ps
[205] The largest component in a subcritical random graph with a power law degree distribution. Annals of Applied Probability 18 (2008), no. 4, 1651-1668. pdf ps
[204] A new approach to the giant component problem. (With Malwina Luczak.) Random Structures Algorithms, 34 (2008), no. 2, 197-216. pdf ps
[203] Tail estimates for the Brownian excursion area and other Brownian areas. (With Guy Louchard.) Electronic J. Probab. 12 (2007), no. 58, 1600-1632. pdf ps
[202] The integral of the supremum process of Brownian motion. (With Niclas Petersson.) Journal of Applied Probability, 46 (2009), no. 2, 593-600. pdf ps
[201] Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas. Probability Surveys 3 (2007), 80-145. pdf ps
[200] Line-of-sight percolation. (With Béla Bollobás and Oliver Riordan.) Combin. Probab. Comput. 18 (2009), 83-106. pdf ps
[199] Graphs with specified degree distributions, simple epidemics and local vaccination strategies. (With Tom Britton and Anders Martin-Löf.) Advances in Applied Probabability 39 (2007), no. 4, 922-948. pdf ps
[198]
Sorting using complete subintervals and the maximum number of runs in
a randomly evolving sequence.
Annals of Combinatorics
12 (2009), no. 4, 417-447.
pdf
ps
[198x]
Extended abstract,
Proceedings, 2007 Conference on Analysis of Algorithms, AofA 07
(Juan-les-Pins, 2007),
DMTCS Proceedings 2007.
pdf
[197] Precise logarithmic asymptotics for the right tails of some limit random variables for random trees. (With Jim Fill.) Annals of Combinatorics 12 (2009), no. 4, 403-416. pdf ps
[196] Asymptotic normality of the k-core in random graphs. (With Malwina Luczak.) Annals of Applied Probability 18 (2008), no. 3, 1085-1137. pdf ps
[195] The probability that a random multigraph is simple. Combin. Probab. Comput. 18 (2009), no. 1-2, 205-225. pdf ps
[194] A functional limit theorem for the profile of search trees. (With Michael Drmota and Ralph Neininger.) Annals of Applied Probability 18 (2008), 288-333. pdf ps
[193] The size of random fragmentation trees. (With Ralph Neininger.) Probability Theory and Related Fields 142 (2008), no. 3-4, 399-442. pdf ps
[192] Complex interpolation of compact operators mapping into the couple (FL°°,FL°°1). (With Michael Cwikel.) Interpolation Theory and Applications (Proc. Conference on Interpolation Theory and Applications in honor of Professor Michael Cwikel, Miami, 2006), Contemporary Mathematics 445, Amer. Math. Soc., Providence, R.I., 2007. pdf ps
[191] On a random graph related to quantum theory. Combin. Probab. Comput. 16 (2007), 757-766. pdf ps
[190] Monotonicity, asymptotic normality and vertex degrees in random graphs. Bernoulli 13(4) (2007), 952-965. pdf (ps)
[189] Local limit theorems for finite and infinite urn models. (With Hsien-Kuei Hwang.) Annals of Probability 36 (2008), no. 3, 992-1022. pdf ps
[188] Conditioned Galton-Watson trees do not grow. Proceedings, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (Nancy, 2006), DMTCS Proceedings AG (2006), 331-334. pdf ps
[187] Complex interpolation of compact operators. An update. (With Michael Cwikel.) Proceedings of Estonian Academy of Sciences. Physics and Mathematics 55 (2006), no. 3, 164-169. pdf ps
[186] Congruence properties of depths in some random trees. Alea Lat. Am. J. Probab. Math. Stat. 1 (2006), 347-366. pdf ps
[185] The density of the ISE and local limit laws for embedded trees. (With Mireille Bousquet-Mélou.) Annals of Applied Probability 16 (2006), no. 3, 1597-1632. pdf ps
[184] A simple solution to the k-core problem. (With Malwina Luczak.) Random Structures Algorithms 30 (2007), no. 1-2, 50-62. pdf ps
[183]
Spread-out percolation in Rd.
(With Béla Bollobás and Oliver Riordan.)
Random Structures Algorithms
31 (2007), 239-246.
pdf
ps
(Earlier preprint title:
Long-range percolation in Rd.)
[182] Rainbow Hamilton cycles in random regular graphs. (With Nicholas Wormald.) Random Structures Algorithms 30 (2007), no. 1-2, 35-49. pdf ps
[181] Partial Fillup and Search Time in LC Tries. (With Wojciech Szpankowski.) ACM Transactions on Algorithms 3 (2007), no. 4, Article 44. pdf ps
[180] The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance. (With Michael Blum and Olivier François.) Annals of Applied Probability 16 (2006), no. 4, 2195-2214. pdf ps
[179] A point process describing the component sizes in the critical window of the random graph evolution. (With Joel Spencer.) Combin. Probab. Comput. 16 (2007), 631-658. pdf ps
[178] The phase transition in inhomogeneous random graphs. (With Béla Bollobás and Oliver Riordan.) Random Structures Algorithms 31 (2007), 3-122. pdf ps
[177] Individual displacements in hashing with coalesced chains. Combin. Probab. Comput., 17 (2008), 799-814. pdf ps
[176] Left and right pathlengths in random binary trees. Algorithmica 46 (2006), no. 3/4, 419-429. pdf ps
[175] Rounding of continuous random variables and oscillatory asymptotics. Annals of Probability 34 (2006), no. 5, 1807-1826. pdf ps
[174] On the asymptotic joint distribution of height and width in random trees. Studia Sci. Math. Hungarica 45(4) (2008), 451-467. pdf ps
[173] Branching processes, and random-cluster measures on trees. (With Geoffrey Grimmett.) J. Eur. Math. Soc. (JEMS) 7 (2005), no. 2, 253-281. pdf ps
[172] Feynman-Kac formulas for Black-Scholes type operators. (With Johan Tysk.) Bull. London Math. Soc. 38 (2006), no. 2, 262-289. pdf ps
[171] Convergence of coined quantum walks on Rd. (With Alex Gottlieb and Petra Scudo.) Infin. Dimens. Anal. Quantum Probab. Relat. Top. 8 (2005), no. 1, 129-140. pdf ps (Older version: pdf ps)
[170] Random records and cuttings in complete binary trees. Mathematics and Computer Science III, Algorithms, Trees, Combinatorics and Probabilities (Vienna 2004), Eds. M. Drmota, P. Flajolet, D. Gardy, B. Gittenberger, Birkhäuser, Basel, 2004, ISBN 3-7643-7128-5, pp. 241-253. pdf ps
[169] Limit theorems for triangular urn schemes. Probability Theory and Related Fields 134 (2005), 417-452. pdf ps
[168] Some remarks on the combinatorics of ISn. (With Volodymyr Mazorchuk.) Semigroup Forum 70 (2005), no. 3, 391-405. pdf ps
[167] Random cutting and records in deterministic and random trees. Random Structures Algorithms 29 (2006), no. 2, 139-179. pdf ps
[166] On the average sequence complexity. (With Stefano Lonardi and Wojciech Szpankowski.) Theoretical Computer Science A 326 (2004), no. 1-3, 213-227. pdf ps
[165] One-sided interval trees. Journal of the Iranian Statistical Society 3 (2004), no. 2, 149-164. pdf ps
[164] Convergence of discrete snakes. (With Jean-François Marckert.) J. Theor. Probab. 18 (2005), no. 3, 615-645. pdf ps
[163] The phase transition in the uniformly grown random graph has infinite order. (With Béla Bollobás and Oliver Riordan.) Random Structures Algorithms 26 (2005), no. 1-2, 1-36. pdf ps
[162] Weak limits for quantum random walks. (With Geoffrey Grimmett and Petra Scudo.) Phys. Rev. E 69 (2004), 026119. pdf ps
[161] The center of mass of the ISE and the Wiener index of trees. (With Philippe Chassaing.) Electronic Comm. Probab. 9 (2004), paper 20, 178-187. pdf ps
[160]
The number of bit comparisons used by Quicksort: an average-case analysis.
(With Jim Fill.)
Extended abstract.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete
Algorithms
, SIAM, 2004.
pdf
ps
Full-length paper: [265]
[159] The first eigenvalue of random graphs. Combin. Probab. Comput. 14 (2005), 815-828. pdf ps dvi
[158] Superreplication of options on several underlying assets. (With Erik Ekström and Johan Tysk.) Journal of Applied Probability 42 (2005), no. 1, 27-38. pdf ps dvi
[157] Individual displacements for linear probing hashing with different insertion policies. ACM Transactions on Algorithms 1 (2005), no. 2, 177-213. pdf ps dvi
[156] Preservation of convexity of solutions to parabolic equations. (With Johan Tysk.) J. Diff. Eq. 206 (2004), 182-226. pdf ps dvi
[155] Asymptotic degree distribution in random recursive trees. Random Structures Algorithms 26 (2005), no. 1-2, 69-83. pdf ps dvi
[154]
Functional limit theorems for multitype branching processes
and generalized Pólya urns.
Stoch. Proc. Appl. 110 (2004), no. 2, 177-245.
Preprint, first version
pdf
ps
dvi;
revised version
pdf
ps
dvi
[154-note]
A note on the variance calculation for generalized Pólya urns.
pdf
[153] Quicksort with unreliable comparisons: a probabilistic analysis. (With Laurent Alonso, Philippe Chassaing, Florent Gillet, Edward M. Reingold and René Schott.) Combin. Probab. Comput. 13 (2004), no. 4-5, 419-449. pdf ps dvi
[152] Upper tails for subgraph counts in random graphs. (With Krzysztof Oleszkiewicz and Andrzej Ruciński.) Israel J. Math. 141 (2004), 61-92. ps pdf
[151] Robust reconstruction on trees is determined by the second eigenvalue. (With Elchanan Mossel.) Annals of Probability 32 (2004), no. 3B, 2630-2649. pdf (Older version: ps dvi )
[150] Large deviations for sums of partly dependent random variables. Random Structures Algorithms 24 (2004), no. 3, 234-248. ps pdf dvi
[149] On smallest triangles. (With Geoffrey Grimmett.) Random Structures Algorithms 23 (2003), no. 2, 206-223. ps pdf dvi
[148]
Rademacher chaos: tail estimates vs limit theorems.
(With Ron Blei.)
Ark. Mat.
no. 1 (2004),
13-29.
ps
pdf
dvi
Preprint version: Tech. Report No. 9, 2001/2002, Institut Mittag-Leffler
ps
pdf
dvi
[147] On generalized random railways. (With Hans Garmo and Michał Karoński.) Combin. Probab. Comput. 13 (2004), 31-35. ps pdf dvi
[146] The Wiener index of simply generated random trees. Random Structures Algorithms 22 (2003), no. 4, 337-358. ps pdf dvi
[145] Properties of options on several underlying assets. (With Johan Tysk.) To appear, 2nd World Congress of the Bachelier Society, Crete 2002. ps pdf dvi
[144] Ideals in a forest, one-way infinite binary trees and the contraction method. Mathematics and Computer Science II, Algorithms, Trees, Combinatorics and Probabilities (Versailles 2002), eds. B. Chauvin, P. Flajolet, D. Gardy and A. Mokkadem, Birkhäuser, Basel, 2002, pp. 393-414. ps pdf dvi
[143]
Volatility time and properties of option prices.
(With Johan Tysk.)
Annals of Applied Probability
13 (2003), No. 3, 890-913.
pdf
ps
dvi
Summary:
ps
pdf
dvi
[142] Random dyadic tilings of the unit square. (With Dana Randall and Joel Spencer.) Random Structures Algorithms 21 (2002), no. 3-4, 225-251 ps pdf dvi. Remarks.
[141] Quicksort asymptotics. (With Jim Fill.) J. Algorithms 44 (2002), no. 1, 4-28. ps pdf dvi Appendix.
[140] Permutation pseudographs and contiguity. (With Catherine Greenhill, Jeong Han Kim and Nick Wormald.) Combin. Probab. Comput. 11 (2002), no. 3, 273-298. ps pdf dvi
[139] An interesting class of operators with unusual Schatten-von Neumann behavior. (With Alexei B. Aleksandrov, Vladimir V. Peller and Richard Rochberg.) Function Spaces, Interpolation Theory and Related Topics (Proceedings of the International Conference in honour of Jaak Peetre on his 65th birthday, Lund 2000), eds. M. Cwikel, M. Englis, A. Kufner, L.-E. Persson and G. Sparr, Walter de Gruyter, Berlin, 2002, pp. 61-150. ps pdf dvi
[138] Approximating the limiting Quicksort distribution. (With Jim Fill.) Random Structures Algorithms 19 (2001), no. 3-4, 376-406. ps pdf dvi
[137] The infamous upper tail. (With Andrzej Ruciński.) Random Structures Algorithms 20 (2002), no. 3, 317-342. ps pdf dvi
[136] Cycles and unicyclic components in random graphs. Combin. Probab. Comput. 12 (2003), 27-52. ps pdf dvi
[135] The deletion method for upper tail estimates. (With Andrzej Ruciński.) Combinatorica 24 (2004), no. 4, 615-640. ps pdf dvi
[134] A characterization of the set of fixed points of the Quicksort transformation. (With Jim Fill.) Electronic Comm. Probab. 5 (2000), no. 9, 77-84. ps pdf dvi
[133] Asymptotic distribution for the cost of linear probing hashing. Random Structures Algorithms 19 (2001), no. 3-4, 438-471. ps pdf dvi
[132] Moment convergence in conditional limit theorems. Journal of Applied Probability 38 (2001), no. 2, 421-437. ps pdf dvi
[131] Smoothness and decay properties of the limiting Quicksort density function. (With Jim Fill.) Mathematics and Computer Science (Proceedings, Colloquium on Mathematics and Computer Science, Versailles 2000), eds. D. Gardy and A. Mokkadem, Trends in Mathematics, Birkhäuser, Basel, 2000, pp. 53-64. ISBN 3-7643-6430-0. ps pdf dvi
[130] Growth of components in random graphs. Random Structures Algorithms 17 (2000), no. 3-4, 343-356. ps pdf dvi
[129] A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0. (With Philippe Chassaing.) Annals of Probability 29 (2001), no. 4, 1755-1779. dvi (without figures) ps pdf
[128] Tightness and weak convergence for jump processes. (With Allan Gut.) Statist. Probab. Letters 52 (2001), no. 1, 101-107. dvi ps pdf
[127]
Bounding the unsatisfiability threshold of random 3-SAT.
(With Yannis C. Stamatiou
and
Malvina Vamvakari.)
Random Structures Algorithms
17 (2000), no. 2, 103-116.
dvi
ps
pdf
Erratum
Random Structures Algorithms
18 (2001), no. 1, 99-100.
(Older, obsolete version:
On random 3-SAT.
dvi
ps)
[126] On concentration of probability. Contemporary Combinatorics (Proceedings, Workshop on Probabilistic Combinatorics at the Paul Erdös Summer Research Center, Budapest 1998), ed. B. Bollobás, Bolyai Society Mathematical Studies 10, János Bolyai Mathematical Society, Budapest and Springer, Berlin, 2002, pp. 289-301. dvi ps pdf
[125] Q spaces of several real variables. (With Matts Essén, Lizhong Peng and Jie Xiao.) Indiana Univ. Math. J. 49 (2000), no. 2, 575-615. dvi ps pdf
[124] On the variance of the random sphere of influence graph. (With Pawel Hitczenko and Joseph E. Yukich.) Random Structures Algorithms 14 (1999), 139-152. dvi ps pdf
[123] One, two and three times log n/n for paths in a complete graph with random weights. Combin. Probab. Comput. 8 (1999), 347-361. dvi ps pdf
[122] Hook lengths in a skew Young diagram . Electronic J. Combin. 4(1) (1997), #R24. (dvi ps pdf)
[121] New versions of Suen's correlation inequality. Random Structures Algorithms 13 (1998), 467-483. dvi ps pdf
[120] On the space Qp and its dyadic counterpart. Complex Analysis and Differential Equations (Proceedings, Marcus Wallenberg Symposium in Honor of Matts Essén, Uppsala 1997) , eds. C. Kiselman and A. Vretblad, Uppsala Univ., 1999. dvi ps pdf
[119] On complex hypercontractivity. J. Funct. Anal. 151 (1997), 270-280. dvi ps pdf
([118] = [III]; see Books.)
[117] Random Sidon sequences. (With Anant Godbole, Nicholas W. Locantore and Rebecca Rapoport.) J. Number Th. 75 (1999), 7-22. dvi ps pdf
[116] Analysis of an asymmetric leader election algorithm. (With Wojciech Szpankowski.) Electronic J. Combin. 4(1) (1997), #R17.
[115] Random covering designs. (With Anant Godbole.) J. Combinatorial Theory Ser. A 75 (1996), 85-98. dvi ps pdf
[114] On the traveling fly problem. Graph Theory Notes of New York XXXI (1996), 17. dvi ps pdf
[113] Shellsort with three increments. (With Donald Knuth.) Random Structures Algorithms 10 (1997), 125-142. dvi ps pdf
[112] Complex method interpolation defined using a half-plane or full disc. Function Spaces, Interpolation Spaces, and Related Topics, eds. Y. Brudnyi, M. Cwikel and Y. Sagher, Israel Math. Conf. Proc. 13 (1999), Bar-Ilan University, 88-101. dvi ps pdf
[111] A note on triangle-free graphs. (With Paul Erdös, Tomasz Łuczak and Joel Spencer.) Random Discrete Structures (Proceedings, Minneapolis 1993), IMA Vol. Math. Appl. 76, Springer, New York 1996, 117-119. dvi ps pdf
[110]
The minimal spanning tree in a complete graph and a functional limit theorem
for trees in a random graph.
Random Structures Algorithms
7 (1995), 337-355.
dvi
ps
pdf
Addendum (with Johan Wästlund).
Random Structures Algorithms
28 (2006), no. 4, 511-512.
pdf
ps
[109] Metrics on compositions and coincidences among renewal sequences. (With Persi Diaconis, Susan Holmes, Stephen Lalley and Robin Pemantle.) Random Discrete Structures (Proceedings, Minneapolis 1993), IMA Vol. Math. Appl. 76, Springer, New York 1996, 81-101.
[108] The random cluster process on the complete graph. (With Béla Bollobás and Geoffrey Grimmett.) Probab. Th. Rel. Fields 104 (1996), 283-317. ps
[107] Large deviation inequalities for sums of indicator variables. Tech. Report 1994:34, Uppsala. arXiv:1609.00533 pdf ps
[106] Perfect matchings in random s-uniform hypergraphs. (With Alan Frieze.) Random Structures Algorithms 7 (1995), 41-57. dvi ps
[105] The second moment method, conditioning and approximation. Random Discrete Structures (Proceedings, Minneapolis 1993), IMA Vol. Math. Appl. 76, Springer, New York 1996, 175-183. dvi ps
[104] On certain quotients of Hardy spaces. Integral Eq. Oper. Th. 20 (1994), 238-242. dvi ps
[103] Random regular graphs: asymptotic distributions and contiguity. Combin. Probab. Comput. 4 (1995), 369-405. dvi ps
[102] Hamilton cycles in a random tournament. Random Structures Algorithms 6 (1995), 213-219. dvi ps
[101.5] Random graphs. Festschrift in Honour of Lennart Carleson and Yngve Domar (Uppsala, 1993), Acta Univ. Upsaliensis Skr. Uppsala Univ. C Organ. Hist. 58, Uppsala Univ., Uppsala 1995, 185-190. dvi ps
[101] On the length of the longest increasing subsequence in a random permutation. (With Béla Bollobás.) Combinatorics, Geometry and Probability (Proceedings, P. Erdös' 80th Birthday, Cambridge 1993), Cambridge Univ. Press, Cambridge 1997, 121-128. dvi ps
[100] Self-couplings and the concentration function. Acta Appl. Math. 34 (1994), 5-6. dvi ps
[99.5] Coupling and Poisson approximation. Acta Appl. Math. 34 (1994), 7-15. dvi ps
[99] The numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph. Combin. Probab. Comput. 3 (1994), 97-126. dvi ps
[98] Schatten-norm identities for Hankel operators. (With Harald Upmeier and Robert Wallstén.) J. Funct. Anal. 119 (1994), 210-216.
[97] The birth of the giant component. (With Donald Knuth, Tomasz Łuczak and Boris Pittel.) Random Structures Algorithms 4 (1993), 233-358. dvi ps
[96] Uncorrelated associated variables are independent. (With Tomasz Łuczak.) Tech. Report 1992:9, Uppsala.
[95] Linear extensions of a random partial order. (With Noga Alon, Béla Bollobás and Graham Brightwell.) Annals of Applied Probability 4 (1994), 108-123. dvi ps
([94] = [II]; see Books.)
([93] = [I]; see Books.)
[92] Interpolation of subcouples and quotient couples. Ark. Mat. 31 (1993), 307-338. dvi ps
[91] Multicyclic components in a random graph process. Random Structures Algorithms 4 (1993), 71-84.
[90] Hankel operators on Bergman spaces with change of weight. Math. Scand. 71 (1992), 267-276.
[89] Singular values of Hankel operators. Linear and Complex Analysis Problem Book 3 Part I, eds. Havin and Nikolskii. Lecture Notes in Math. 1573, Springer, Berlin 1994, 303-305.
[88] Probabilistic construction of proportional graphs. (With Joel Spencer.) Random Structures Algorithms 3 (1992), 127-137.
[87] A graph Fourier transform and proportional graphs. Random Structures Algorithms 6 (1995), 341-351.
[86] Intermediate Hankel operators on the Bergman space. (With Richard Rochberg.) J. Operator Th. 29 (1993), 137-155. dvi ps
[85] Proportional graphs. (With Jan Kratochvíl.) Random Structures Algorithms 2 (1991), 209-224.
[84] Thresholds for classes of intersection graphs. (With Jan Kratochvíl.) Discrete Math. 108 (1992), 307-326.
[83] On the optimal asymptotic eigenvalue behaviour of weakly singular integral operators. (With Fernando Cobos and Thomas Kühn.) Proc. Amer. Math. Soc. 113 (1991), 1017-1022.
[82] Small cliques in random graphs. (With Andrew Barbour, Michał Karoński and Andrzej Ruciński.) Random Structures Algorithms 1 (1990), 403-434.
[81] Poisson approximation for large deviations. Random Structures Algorithms 1 (1990), 221-229.
[80] The asymptotic distribution of generalized U-statistics with applications to random graphs. (With Krzysztof Nowicki.) Probab. Th. Rel. Fields 90 (1991), 341-375.
[79] A functional limit theorem for random graphs with applications to subgraph count statistics. Random Structures Algorithms 1 (1990), 15-37.
[78] Membership of Hankel operators on the ball in unitary ideals. (With Jonathan Arazy, Stephen Fisher and Jaak Peetre.) J. London Math. Soc. (2) 43 (1991), 485-508.
[77] Poisson approximation using the Stein-Chen method and coupling: number of exceedances of Gaussian random variables. (With Lars Holst.) Annals of Probability 18 (1990), 713-723.
[76] Poisson approximation with the Stein-Chen method and coupling. (With Andrew Barbour and Lars Holst.) Tech. Report, Uppsala 1988.
[75] An identity for reproducing kernels in a planar domain and Hilbert-Schmidt Hankel operators. (With Jonathan Arazy, Stephen Fisher and Jaak Peetre.) J. reine angew. Math. 406 (1990), 179-199.
[74] Poisson approximation in occupancy problems. (With Andrew Barbour and Lars Holst.) Tech. Report, Uppsala 1988.
[73] A new look on Hankel forms over Fock space. (With Jaak Peetre and Robert Wallstén.) Studia Math. 95 (1989), 33-41.
[72] An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. (With Tomasz Łuczak and Andrzej Ruciński.) Random Graphs '87 (Proceedings, Poznan 1987), John Wiley & Sons 1990, 73-87.
[71] Big Hankel operators of higher weight. (With Jan Boman and Jaak Peetre.) Rend. Circ. Mat. Palermo 38 (1989), 65-78.
[70] Completely continuous Hankel operators on Hoo and Bourgain algebras. (With Joseph Cima and Keith Yale.) Proc. Amer. Math. Soc. 105 (1989), 121-125.
[69] On functions with derivatives in H1. Harmonic Analysis and Partial Differential Equations (Proceedings, El Escorial 1987), Lecture Notes in Math. 1384, Springer, Berlin 1989, 193-201.
[68] Weak factorization in periodic Fock space. (With Jaak Peetre.) Math. Nachrichten 146 (1990), 159-165.
[67] Hankel operators between weighted Bergman spaces. Ark. Mat. 26 (1988), 205-219.
[66] Random self-avoiding walks on one-dimensional lattices. (With Sven Erick Alm.) Comm. Statist. Stochastic Models 6 (1990), 169-212.
[65] Some pairwise independent sequences for which the central limit theorem fails. Stochastics 23 (1988), 439-448.
[64] On interpolation of multi-linear operators. Function Spaces and Applications (Proceedings, Lund 1986), Lecture Notes in Math. 1302, Springer, Berlin 1988, 290-302.
[63] Birthday problems, randomly coloured graphs and Poisson limits of sums of dissociated variables. Tech. Report, Uppsala 1986.
[62] On dominations between measures of dependence. (With Richard Bradley and Wlodzimierz Bryc.) J. Multivar. Anal. 23 (1987), 312-329.
[61] Poisson convergence and Poisson processes with applications to random graphs. Stoch. Proc. Appl. 26 (1987), 1-30.
[60] Hankel forms and the Fock space. (With Jaak Peetre and Richard Rochberg.) Revista Math. Iberoamericana 3 (1987), 61-129.
[59] A new generalization of Hankel operators (the case of higher weights). (With Jaak Peetre.) Math. Nachrichten 132 (1987), 313-328.
[58] Normal convergence by higher semiinvariants with applications to sums of dependent random variables and random graphs. Annals of Probability 16 (1988), 305-312.
[57] Random trees in a graph and trees in a random graph. Math. Proc. Camb. Phil. Soc. 100 (1986), 319-330.
[56] Random self-avoiding walks in some one-dimensional lattices. Ann. Discrete Math. 33 (1987), 91-109.
[55] Paracommutators - boundedness and Schatten-von Neumann properties. (With Jaak Peetre.) Trans. Amer. Math. Soc. 305 (1988), 467-504.
[54] Random coverings of the circle by arcs with restricted endpoints. Journal of Applied Probability 25 (1988), 215-219.
[53] Remarks on the foundations of measures of dependence. (With Richard Bradley and Wlodzimierz Bryc.) New Perspectives in Theoretical and Applied Statistics, John Wiley & Sons, New York 1987, 421-437.
[52] Moments for first passage and last exit times, the minimum, and related quantities for random walks with positive drift. Advances in Applied Probability 18 (1986), 865-879.
[51.5] From Bieberbach's conjecture to de Branges' proof. Expo. Math. 4 (1986), 87-96.
[51] Means and their iterations. (With Jonathan Arazy, Tomas Claesson and Jaak Peetre.) Proceedings of the Nineteenth Nordic Congress of Mathematicians (Reykjavik 1984), Reykjavik 1985, 191-212.
[50.5] Hankel and Toeplitz operators on some function spaces. Proceedings of the Nineteenth Nordic Congress of Mathematicians (Reykjavik 1984), Reykjavik 1985, 135-137.
[50] Converse results for existence of moments and uniform integrability for stopped random walks. (With Allan Gut.) Annals of Probability 14 (1986), 1296-1317.
[49] Real and complex interpolation methods for finite and infinite families of Banach spaces. (With Michael Cwikel.) Adv. Math. 66 (1987), 234-290.
[48] Limit theorems for a triangular scheme of U-statistics with applications to inter-point distances. (With Sreenivasa Rao Jammalamadaka.) Annals of Probability 14 (1986), 1347-1358.
[47] Random coverings of thin sets. Ark. Mat. 24 (1986), 93-102.
[46] On waiting times in games with disasters. Contributions to Probability and Statistics in Honour of Gunnar Blom, Studentlitteratur, Lund 1985, 195-204.
[45] Maximal spacings in several dimensions. Annals of Probability 15 (1987), 274-280.
[44] On the action of Hankel and Toeplitz operators on some function spaces. (With Jaak Peetre and Stephen Semmes.) Duke Math. J. 51 (1984), 937-958.
[43] On the limiting distribution of the number of "near-matches". (With Sreenivasa Rao Jammalamadaka.) Statist. Probab. Letters 2 (1984), 353-355.
[42] On moment conditions for normed sums of independent variables and martingale differences. (With Carl-Gustav Esseen.) Stoch. Proc. Appl. 19 (1985), 173-189.
[41] Higher order commutators of singular integral operators. (With Jaak Peetre.) Interpolation Spaces and Allied Topics in Analysis (Proceedings, Lund 1983), Lecture Notes in Math. 1070, Springer, Berlin 1984, 125-142.
[40] Harmonic interpolation. (With Jaak Peetre.) Interpolation Spaces and Allied Topics in Analysis (Proceedings, Lund 1983), Lecture Notes in Math. 1070, Springer, Berlin 1984, 92-124.
[39] Random coverings in several dimensions. Acta Math. 156 (1986), 83-118.
[38] Runs in m-dependent sequences. Annals of Probability 12 (1984), 805-818.
[37] Bounds on the distribution of extremal values of a scanning process. Stoch. Proc. Appl. 18 (1984), 313-328.
[36] Random coverings of the circle with arcs of random lengths. Probability and Mathematical Statistics. Essays in honour of Carl-Gustav Esseen, Uppsala 1983, 62-73.
[35] Elementary characterizations of the Morrey-Campanato Spaces. (With Mitchell Taibleson and Guido Weiss.) Harmonic Analysis (Proceedings, Cortona 1982), Lecture Notes in Math. 992, Springer, Berlin 1983, 101-114.
[34] Notes on Wolff's note on interpolation spaces. (With Per Nilsson and Jaak Peetre.) Proc. London Math. Soc. 48 (1984), 283-299.
[33.3] Optimal numerical differentiation using N function evaluations. (With J. Marshall Ash and Roger Jones.) Calcolo 21 (1984), no. 2, 151-169.
[33] Limit theorems for some sequential occupancy problems. Journal of Applied Probability 20 (1983), 545-553.
[32] Limit theorems for certain branching random walks on compact groups and homogeneous spaces. Annals of Probability 11 (1983), 909-930.
[31] Interpolation of analytic families of operators. (With Michael Cwikel.) Studia Math. 79 (1984), 61-71.
[30] Converse hypercontractivity. (With Christer Borell.) Séminaire Initiation à l'Analyse, 21e année, 1981/1982, Publ. Math. Univ. Pierre Marie Curie 54 No. 4. pdf
[29] Renewal theory for m-dependent variables. Annals of Probability 11 (1983), 558-568.
[28] The limiting behaviour of certain stopped sums and some applications. (With Allan Gut.) Scand. J. Statistics 10 (1983), 281-292.
[27] Minimal and maximal methods of interpolation of Banach spaces. Conference on Harmonic Analysis in Honor of Antoni Zygmund, Wadsworth, Belmont 1983, 732-739.
[26] Convolution inequalities on the circle. (With William Beckner and David Jerison.) Conference on Harmonic Analysis in Honor of Antoni Zygmund, Wadsworth, Belmont 1983, 32-43.
[25] I teoremi di rappresentazione di Calderon. (With Mitchell Taibleson.) Rend. Sem. Mat. Univers. Torino 39 (1982), 27-35.
[24] On the interpolation of sublinear operators. Studia Math. 75 (1982), 51-53.
[23] Schatten classes and commutators of singular integral operators. (With Tom Wolff.) Ark. Mat. 20 (1982), 301-310.
[22] Invariance principles for stochastic area and related stochastic integrals. (With Michael Wichura.) Stoch. Proc. Appl. 16 (1984), 71-84.
[21] Interpolation between Hp spaces: the complex method. (With Peter Jones.) J. Funct. Anal. 48 (1982), 58-80.
[20] Upper bounds for the connectivity constant. (With Ragnar Ahlberg.) Tech. Report, Uppsala 1981. pdf
[19] On hypercontractivity for multipliers on orthogonal polynomials. Ark. Mat. 21 (1983), 97-110.
[18] The asymptotic distribution of incomplete U-statistics. Z. Wahrscheinlichkeitstheorie verw. Geb. 66 (1984), 495-505.
[17] Minimal and maximal methods of interpolation. J. Funct. Anal. 44 (1981), 50-73.
[16] Maximizing the intersection density of fibre processes. (With Olav Kallenberg.) Journal of Applied Probability 18 (1981), 820-828.
[15] Lipschitz spaces and bounded mean oscillation. Suppl. Rend. Circ. Mat. Palermo 1 (1981), 111-114.
[14] Generalizations of Lipschitz spaces and an application to Hardy spaces and bounded mean oscillation. Duke Math. J. 47 (1980), 959-982.
[13] A note on H1 q-martingales. (With Jia-Arng Chao.) Pac. J. Math. 97 (1981), 307-317.
[12] A two-dimensional martingale counter example. Tech. Report, Institute Mittag-Leffler 1979.
[11] BMO and commutators of martingale transforms. Ann. Inst. Fourier. 31,1 (1981), 265-270.
[10] An upper bound for the velocity of first-passage percolation. Journal of Applied Probability 18 (1981), 256-262.
[9] The asymptotic distribution of degenerate U-statistics. Tech. Report, Uppsala 1979:5.
[8.5] Snabba tunnlar. Nordisk Matematisk Tidskrift 25-26 (1978), 175-180.
[8] Non-homogeneous multipliers characterizing H1 on local fields. Tech. Report, Institute Mittag-Leffler 1978.
[7] Limit theorems for sums of rotationally invariant functions of n-tuples of points on spheres. Tech. Report, Uppsala 1978.
[6] Singular integrals on local fields and generalizations to martingales. Harmonic Analysis in Euclidean Spaces (Proceedings, Williamstown 1978), Proceedings of Symposia in Pure Mathematics XXXV:2, Amer. Math. Soc., Providence, R.I. 1979, 317-319.
[5] On random divisions of a convex set. Journal of Applied Probability 15 (1978), 645-649.
[4] Mean oscillation and commutators of singular integral operators. Ark. Mat. 16 (1978), 263-270.
[3] On tensor products in concrete categories. Tech. Report, Uppsala 1976.
[2] Characterizations of H1 by singular integral transforms on martingales and Rn. Math. Scand. 41 (1977), 140-152.
[1] On functions with conditions on the mean oscillation. Ark. Mat. 14 (1976), 189-196.
[OWR2017] Edge exchangeable random graphs. Oberwolfach Reports 14:4, 2017 (Network Models: Structure and Function, 2017) . pdf
[OWR2016] Successive minimum spanning trees. (With Gregory Sorkin.) Oberwolfach Reports 13:2, 2016 (Combinatorics and Probability, 2016) . pdf
[OWR2014] Maximal clades in random binary search trees. Oberwolfach Reports 11:4, 2014 (Probability, Trees and Algorithms, 2014). pdf
[OWR2013] The largest triangular submatrix of a random matrix. (With Zur Izhakian and John Rhodes.) Oberwolfach Reports 10:2, 2013 (Combinatorics and Probability, 2013). pdf
[OWR2011] Simply generated trees and conditioned Galton-Watson trees. Oberwolfach Reports 8:2, 2011 (Random Trees, Information and Algorithms, 2011). pdf ps
[OWR2009] Bootstrap percolation on G(n,p). (With Tomasz Łuczak, Tatyana Turova, Thomas Vallier.) Oberwolfach Reports 6:2, 2009 (Combinatorics and Probability, 2009). pdf ps
[OWR2006] The probability that a random multigraph is simple. Oberwolfach Reports 3:4, 2006 (Combinatorics, Probability and Computing, 2006). pdf ps
[OWR2004d] The contraction method in infinite-dimensional spaces. (With Michael Drmota and Ralph Neininger.) Oberwolfach Reports 1:3, 2004 (Probability Theory on Trees and Analysis of Algorithms, 2004). pdf ps
[OWR2004c] Asymptotics for tails and moments. (With Jim Fill and probably others.) Oberwolfach Reports 1:3, 2004 (Probability Theory on Trees and Analysis of Algorithms, 2004). pdf ps
[OWR2004b] Branching random walks on trees and the Brownian snake. (With Jean-Francois Marckert.) Oberwolfach Reports 1:3, 2004 (Probability Theory on Trees and Analysis of Algorithms, 2004). pdf ps
[OWR2004a] Random records and cuttings in trees. Oberwolfach Reports 1:3, 2004 (Probability Theory on Trees and Analysis of Algorithms, 2004). pdf ps
[V14] Småpartispärren öppnar för politiskt fiffel. (Med Svante Linusson.) Dagens Nyheter, 10 September 2023.
[V13] Dubbelvalsavveckling och splittring på olika valsedlar med heltalsmetoden. (Med Svante Linusson.) Rapport till regeringskansliet 13 december 2021. pdf
[V12] Systemet är enkelt, robust och rättvist. (Med Svante Linusson.) Svenska Dagbladet, nätupplagan (www.svd.se), 18 februari 2020.
[V11]
Problem med proportionella val i kommuner.
(Med Svante Linusson.)
Statsvetenskaplig tidskrift 3/2022.
Tidigare version:
Proportionella val inom kommunfullmäktige, DIVA, 39 s., April 2019.
pdf
Sammanfattning som debattartikel:
Stoppa röstkupper. (Med Svante Linusson.)
Upsala Nya Tidning, 23 april 2019.
[V10] Thresholds quantifying proportionality criteria for election methods. October 2018. arXiv:1810.06377 pdf
[V9] Phragmén's and Thiele's election methods. November 2016. arXiv:1611.08826 pdf
[V8] Föreslagna ändringar i Sveriges valsystem. (Med Svante Linusson.) SMS bulletinen nr 11, maj 2014, Svenska matematikersamfundet. pdf
[V7] Den naturliga spärren. Bilaga 3 till SOU 2012:94, Proportionalitet i val samt förhandsanmälan av partier och kandidater, Delbetänkande av 2011 års vallagskommitté, Stockholm 2012. pdf ps
[V6] Proportionella valmetoder. 20 augusti 2012. 303 s. pdf Innehållsförteckning
[V5]
Den naturliga spärren med jämkade uddatalsmetoden.
Rapport till 2011 års vallagskommitté.
6 februari 2012, 11 s.
pdf
ps
[V5a]
Sammanfattning till 2011 års vallagskommitté.
21 januari 2012.
pdf
[V5b]
Sammanfattning till Kommittén för förstärkning av den kommunala
demokratins funktionssätt.
8 februari 2012.
Underlag till sid 57 i
SOU 2012:30, Vital kommunal demokrati.
pdf
[V4] Another note on the Droop quota and rounding. Voting matters 29 (2011), 32-34. pdf ps
[V3] Normalapproximation för sannolikheten för att felaktigt hanterade röster påverkar mandatfördelningen. (Med Svante Linusson.) Rapport till Valprövningsnämnden. 22 Februari 2011, 9 s. pdf ps
[V2] Exempel på sannolikhetsberäkningar för att felaktigt hanterade röster påverkar valutgången. (Med Svante Linusson.) Rapport till Valprövningsnämnden. 9 December 2010, 10 s. pdf ps
[V1.5b] SD fick två mandat för mycket i landstingsvalet. (Med Svante Linusson.) Svenska Dagbladet, nätupplagan (www.svd.se), 24 oktober 2010.
[V1.5a] Fler utjämningsmandat behövs. Upsala Nya Tidning, 4 oktober 2010.
[V1]
Avrundningsriksdag? Om sannolikheten att en väljarminoritet blir en
riksdagsmajoritet.
1980, 13 s.
pdf
Kort version (2 sidor):
Statsvetenskaplig Tidskrift 1982, no. 1, 51-52.
[C12] On reliability measures for nominal scales. (With Jan Vegelius, Catharina Lindencrona and Karin Wengelin.) Preprint, 1990?
[C11] Measures of similarity between distributions. (With Jan Vegelius and Folke Johansson.) Quality and Quantity 20 (1986), 437-441.
[C10] Measures of ecological association. (With Jan Vegelius.) Oecologia 49 (1981), 371-376.
[C9] Criteria for symmetric measures of association for nominal data. (With Jan Vegelius.) Quality and Quantity 16 (1982), 243-250.
[C8] The J-index as a measure of nominal scale response agreement. (With Jan Vegelius.) Applied Psychological Measurement 6 (1982), no. 1, 111-121.
[C7] A general discriminant analysis based on E-correlation coefficients. (With Jan Vegelius.) Educational and Psychological Measurement 40 (1980), no. 4, 911-922.
[C6] On constructions of E-correlation coefficients. (With Jan Vegelius.) Research Report 78-11, Department of Statistics, Uppsala University, 1978.
[C5] Correlation coefficients for more than one scale type. (With Jan Vegelius.) Multivariate Behavioral Research 17 (1982), 271-284.
[C4] On WHIDD analysis. (With Jan Vegelius and Henrik Jonsson.) Educational and Psychological Measurement 40 (1980), 113-118.
[C3] On the relationship between the phi coefficient and the G index. (With Jan Vegelius.) Educational and Psychological Measurement 40 (1980), no. 3, 569-574.
[C2] On generalizations of the G index and phi coefficient to nominal scales. (With Jan Vegelius.) Multivariate Behavioral Research 14 (1979), 255-269.
[C1]
On the applicability of truncated component analysis based on correlation
coefficients for nominal scales.
(With Jan Vegelius.)
Applied Psychological Measurement 2 (1978), no. 1, 135-145.
Preprint version:
Correlation coefficients for nominal scales.
Research Report 77-1,
Dept. of Statistics,
Uppsala Univ.
[N24] Fourier and Mellin inversion. December 2023, 14 pp. pdf
[N23] Real trees. June 2020; revised March 2023, 23 pp. arXiv:2303.07920 pdf
[N22] On the Gromov-Prohorov distance. May 2020, 10 pp. arXiv:2005.13505 pdf
[N21] Probability distances. January 2020, 19 pp. pdf
[N20] On moments of the limiting random variable for a supercritical Galton--Watson process. September 2019, 3 pp. pdf
[N19] Semisimple Lie groups and algebras, real and complex. August 2017, 8 pp. pdf
[N18] Quaternions and rotations. January 2017, 8 pp. pdf
[N17] A note on Polya urns: the winner may lead all the time. April 2016, 3 pp. pdf
[N16] Euclidean, spherical and hyperbolic trigonometry. March 2015, 53 pp. pdf
[N15] Riemannian geometry: some examples, including map projections. March 2015, 122 pp. pdf
([N14] = [328].)
[N13] Some Banach space geometry. August 2012, 10 pp. pdf ps
[N12] Stable distributions. December 2011, revised February 2022, 35 pp. arXiv:1112.0220 [math.PR] pdf
[N11] Some integrals related to the Gamma integral. December 2011, extended June 2013, 6 pp. pdf
[N10] Invariants of polynomials and binary forms. February 2011, 56 pp. arXiv:1102.3568 [math.HO] pdf ps
[N9] A proof of a hypergeometric identity. January 2011, 3 pp. pdf ps
[N8] Constructible numbers and Galois theory. December 2009, 4 pp. pdf ps
[N7] Roots of polynomials of degrees 3 and 4. December 2009; revised August 2010, 29 pp. arXiv:1009.2373 [math.HO] pdf ps
[N6] Probability asymptotics: notes on notation. Institut Mittag-Leffler preprint 31, 2009 spring. arXiv:1108.3924 [math.PR] pdf ps
[N5] Resultant and discriminant of polynomials. September 2007, 18 pp. pdf ps
[N4] Inhomogeneous random graphs. July 2007, 29 pp. pdf ps
[N3] The volume of a ball in Rn. February 2006, 2 pp. pdf ps
[N2]
Tensors and differential forms.
April 2000, 26 pp.
pdf
ps
[N1]
Wright's constants in graph enumeration and Brownian excursion area.
October 2005.
pdf
ps
Obsolete and replaced by
[201].
[N00] On observational effects of a varying evolution parameter in standard cosmology and the Hoyle-Narlikar cosmology. 1981(?), 7 pp. pdf
[N0] Vectorized algorithms for the eigenvalue problem designed for vector processors. (With Ragnar Ahlberg.) 1980(?), 15 pp.
[E1] Arne Beurling 100 år. U.U.D.M. Report 2007:34. pdf
