Johan Wästlund
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Statistics and Probability top 5%
- Markov Chains and Monte Carlo Methods
Papers in
-
- Limits and Structures in Graph Theory 8
-
- Markov Chains and Monte Carlo Methods 11
- Co-authors
- Svante Linusson (4 shared papers)Ragnar Freij-Hollanti (3 shared papers)Kimmo Eriksson (2 shared papers)Henrik Eriksson (2 shared papers)Lars E.O. Svensson (1 shared paper)Svante Janson (2 shared papers)Alexander E. Holroyd (3 shared papers)Johan Håstad (1 shared paper)
- Journals
- The Electronic Journal of Combinatorics (3 papers)Electronic Communications in Probability (3 papers)Discrete Mathematics & Theoretical Computer Science (2 papers)Random Structures and Algorithms (2 papers)Probability Theory and Related Fields (2 papers)
- Partner nations
- SwedenCanadaUnited States
In The Last Decade
Johan Wästlund
27 papers receiving 247 citations
Peers
Comparison fields: 5 of 45
- Discrete Mathematics and Combinatorics 61
- Statistics and Probability 60
- Mathematical Physics 57
- Algebra and Number Theory 26
- Computational Theory and Mathematics 74
Countries citing papers authored by Johan Wästlund
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
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-authors
The 14 scholars most cited alongside Johan Wästlund, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 31 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 58 | |
| 2 | 2001 | 38 | |
| 3 | 2010 | 20 | |
| 4 | 2010 | 17 | |
| 5 | 2009 | 15 | |
| 6 | 2007 | 15 | |
| 7 | 2007 | 12 | |
| 8 | The variance and higher moments in the random assignment problem | 2005 | 11 |
| 9 | 2009 | 10 | |
| 10 | 2009 | 10 | |
| 11 | 2005 | 9 | |
| 12 | 2006 | 8 | |
| 13 | 2012 | 8 | |
| 14 | 2005 | 5 | |
| 15 | Evaluation of Janson’s constant for the variance in the random minimum spanning tree problem | 2005 | 5 |
| 16 | A simple proof of the Parisi and Coppersmith-Sorkin formulas for the random assignment problem | 2005 | 5 |
| 17 | 2008 | 5 | |
| 18 | 2006 | 4 | |
| 19 | 2022 | 3 | |
| 20 | 2005 | 3 |
About Johan Wästlund
Johan Wästlund is a scholar working on Discrete Mathematics and Combinatorics, Statistics and Probability, Computational Theory and Mathematics, Mathematical Physics and Artificial Intelligence, having authored 31 papers that have together received 279 indexed citations. Recurring topics across this work include Markov Chains and Monte Carlo Methods (11 papers), Stochastic processes and statistical mechanics (8 papers), Limits and Structures in Graph Theory (8 papers), Advanced Graph Theory Research (7 papers), Graph theory and applications (4 papers), Complexity and Algorithms in Graphs (4 papers), Artificial Intelligence in Games (3 papers) and Point processes and geometric inequalities (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (61 citations), Statistics and Probability (60 citations), Mathematical Physics (57 citations), Algebra and Number Theory (26 citations) and Computational Theory and Mathematics (74 citations). Johan Wästlund has collaborated with scholars based in Sweden, Canada and United States. Frequent co-authors include Svante Linusson, Ragnar Freij-Hollanti, Kimmo Eriksson, Henrik Eriksson, Lars E.O. Svensson, Svante Janson, Alexander E. Holroyd, Johan Håstad, Riddhipratim Basu and Jean Martin. Their work appears in journals such as The Electronic Journal of Combinatorics, Electronic Communications in Probability, Discrete Mathematics & Theoretical Computer Science, Random Structures and Algorithms and Probability Theory and Related Fields.
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.