Johan Wästlund

615 total citations
31 papers, 274 citations indexed

About

Johan Wästlund is a scholar working on Discrete Mathematics and Combinatorics, Statistics and Probability and Computational Theory and Mathematics. According to data from OpenAlex, Johan Wästlund has authored 31 papers receiving a total of 274 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Discrete Mathematics and Combinatorics, 11 papers in Statistics and Probability and 10 papers in Computational Theory and Mathematics. Recurrent topics in Johan Wästlund's work include Markov Chains and Monte Carlo Methods (11 papers), Stochastic processes and statistical mechanics (8 papers) and Limits and Structures in Graph Theory (8 papers). Johan Wästlund is often cited by papers focused on Markov Chains and Monte Carlo Methods (11 papers), Stochastic processes and statistical mechanics (8 papers) and Limits and Structures in Graph Theory (8 papers). Johan Wästlund collaborates with scholars based in Sweden, Canada and United Kingdom. Johan Wästlund's co-authors include Svante Linusson, Ragnar Freij-Hollanti, Henrik Eriksson, Kimmo Eriksson, Lars E.O. Svensson, Svante Janson, Alexander E. Holroyd, Jean Martin, Riddhipratim Basu and Johan Håstad and has published in prestigious journals such as Annals of Mathematics, Transactions of the American Mathematical Society and American Mathematical Monthly.

In The Last Decade

Johan Wästlund

27 papers receiving 246 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Johan Wästlund Sweden	10	74	60	59	57	56	31	274
Anant P. Godbole United States	12	117 1.6×	100 1.7×	137 2.3×	155 2.7×	78 1.4×	58	451
Loÿs Thimonier France	2	22 0.3×	19 0.3×	23 0.4×	100 1.8×	28 0.5×	4	277
Tsung‐Hsi Tsai Taiwan	10	54 0.7×	38 0.6×	62 1.1×	128 2.2×	107 1.9×	22	261
William Chen United States	5	39 0.5×	97 1.6×	64 1.1×	64 1.1×	26 0.5×	13	451
Mireille Régnier France	14	163 2.2×	45 0.8×	29 0.5×	361 6.3×	96 1.7×	30	477
David Gillman United States	8	62 0.8×	15 0.3×	33 0.6×	105 1.8×	35 0.6×	12	244
Alfredo Viola Uruguay	8	68 0.9×	53 0.9×	12 0.2×	145 2.5×	56 1.0×	28	265
Robin A. Moser Switzerland	4	191 2.6×	68 1.1×	46 0.8×	78 1.4×	14 0.3×	5	259
G. I. Ivchenko Russia	9	18 0.2×	27 0.5×	75 1.3×	99 1.7×	75 1.3×	63	283
Joseph L. Yucas United States	11	95 1.3×	72 1.2×	7 0.1×	193 3.4×	29 0.5×	33	351

Countries citing papers authored by Johan Wästlund

Since Specialization

Citations

This map shows the geographic impact of Johan Wästlund's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Johan Wästlund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Johan Wästlund more than expected).

Fields of papers citing papers by Johan Wästlund

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Johan Wästlund. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Johan Wästlund. The network helps show where Johan Wästlund may publish in the future.

Co-authorship network of co-authors of Johan Wästlund

This figure shows the co-authorship network connecting the top 25 collaborators of Johan Wästlund. A scholar is included among the top collaborators of Johan Wästlund based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Johan Wästlund. Johan Wästlund is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Basu, Riddhipratim, Alexander E. Holroyd, Jean Martin, & Johan Wästlund. (2016). Trapping games on random boards. The Annals of Applied Probability. 26(6). 2 indexed citations

Angel, Omer, Alexander E. Holroyd, Gady Kozma, Johan Wästlund, & Peter Winkler. (2013). The phase transition for dyadic tilings. Transactions of the American Mathematical Society. 366(2). 1029–1046. 1 indexed citations

Wästlund, Johan. (2012). Replica symmetry of the minimum matching. Annals of Mathematics. 175(3). 1061–1091. 7 indexed citations

Wästlund, Johan. (2010). The mean field traveling salesman and related problems. Acta Mathematica. 204(1). 91–150. 17 indexed citations

Wästlund, Johan, et al.. (2010). Edge cover and polymatroid flow problems. Electronic Journal of Probability. 15(none). 3 indexed citations

Freij-Hollanti, Ragnar, et al.. (2009). Enumeration of Derangements with Descents in Prescribed Positions. The Electronic Journal of Combinatorics. 16(1). 9 indexed citations

Wästlund, Johan, et al.. (2009). Concentration of the cost of a random matching problem. 1 indexed citations

Freij-Hollanti, Ragnar, et al.. (2009). Enumeration of derangements with descents in prescribed positions. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AK,...(Proceedings). 10 indexed citations

Linusson, Svante & Johan Wästlund. (2007). Completing a (k − 1)-Assignment. Combinatorics Probability Computing. 16(4). 621–629.

10.

Wästlund, Johan. (2007). An Elementary Proof of the Wallis Product Formula for pi. American Mathematical Monthly. 114(10). 914–917. 15 indexed citations

11.

Wästlund, Johan. (2006). The Limit in the Mean Field Bipartite Travelling Salesman Problem. 1 indexed citations

12.

Wästlund, Johan. (2006). Random assignment and shortest path problems. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AG,...(Proceedings). 8 indexed citations

13.

Janson, Svante & Johan Wästlund. (2006). Addendum to “The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph”. Random Structures and Algorithms. 28(4). 511–512. 4 indexed citations

14.

Wästlund, Johan. (2005). The variance and higher moments in the random assignment problem. KTH Publication Database DiVA (KTH Royal Institute of Technology). 11 indexed citations

15.

Wästlund, Johan. (2005). A simple proof of the Parisi and Coppersmith-Sorkin formulas for the random assignment problem. KTH Publication Database DiVA (KTH Royal Institute of Technology). 5 indexed citations

16.

Wästlund, Johan. (2005). Two-Person Symmetric Whist. The Electronic Journal of Combinatorics. 12(1). 3 indexed citations

17.

Wästlund, Johan. (2005). Evaluation of Janson’s constant for the variance in the random minimum spanning tree problem. KTH Publication Database DiVA (KTH Royal Institute of Technology). 5 indexed citations

18.

Eriksson, Henrik, et al.. (2001). Sorting a bridge hand. Discrete Mathematics. 241(1-3). 289–300. 38 indexed citations

19.

Håstad, Johan, Svante Linusson, & Johan Wästlund. (2001). A Smaller Sleeping Bag for a Baby Snake. Discrete & Computational Geometry. 26(1). 173–181. 3 indexed citations

20.

Jönsson, Maria & Johan Wästlund. (1998). Partitions of $R^3$ into curves. MATHEMATICA SCANDINAVICA. 83(2). 192–192.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact