Countries where authors publish in Random Structures and Algorithms
Since Specialization
Citations
This map shows the geographic impact of research published in Random Structures and Algorithms. 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 papers published in Random Structures and Algorithms with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Random Structures and Algorithms more than expected).
Fields of papers published in Random Structures and Algorithms
This network shows the impact of papers published in Random Structures and Algorithms. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers published in Random Structures and Algorithms.
About Random Structures and Algorithms
The 1.5k papers published in Random Structures and Algorithms in the last decades have received a total of 26.0k indexed citations . Papers published in Random Structures and Algorithms usually cover Discrete Mathematics and Combinatorics (639 papers), Mathematical Physics (583 papers), Statistics and Probability (403 papers), Computational Theory and Mathematics (694 papers) and Geometry and Topology (325 papers) specifically the topics of Limits and Structures in Graph Theory (578 papers), Stochastic processes and statistical mechanics (551 papers), Advanced Graph Theory Research (450 papers), Markov Chains and Monte Carlo Methods (306 papers), Graph theory and applications (243 papers), Complexity and Algorithms in Graphs (211 papers), Algorithms and Data Compression (117 papers) and Bayesian Methods and Mixture Models (116 papers). The most active scholars publishing in Random Structures and Algorithms are Svante Janson, Michael Molloy, Bruce Reed, Noga Alon, Alan Frieze, Boris Pittel, James Propp, Colin Cooper, Mathew D. Penrose and Oliver Riordan.
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.