World's Best Scientists 2026 revealed!
Random Structures & Algorithms
H-index 15

Random Structures & Algorithms

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 153 60 102 14
Computer Science 493 34 62 12
Engineering and Technology 978 12 25 8

Additional Metrics

Number of Best Scientists*: 75
Documents by Best Scientists*: 116
Top 100 Ranked Scientists*: 4
SCIMAGO H-index: 73
SCIMAGO SJR: 1.055
Impact Factor: N/A

Overview

Top Research Topics at Random Structures and Algorithms?

Combinatorics, Discrete mathematics, Random graph, Horticulture and Random regular graph are among the topics commonly tackled in Random Structures and Algorithms. It aims to form a more comprehensive understanding of the field by integrating disciplines like Combinatorics and struct. The study on Discrete mathematics presented is investigated in conjunction with research in Bounded function.

More specifically, the research on Random graph in it is related to Giant component. It facilitated presentations on Horticulture research, particularly Cultivar, Cutting and Germination.

  • Combinatorics (49.68%)
  • Discrete mathematics (33.87%)
  • Random graph (17.42%)

What are the most cited papers published in the journal?

  • A critical point for random graphs with a given degree sequence (2014 citations)
  • Exact sampling with coupled Markov chains and applications to statistical mechanics (1061 citations)
  • An elementary proof of a theorem of Johnson and Lindenstrauss (744 citations)

Research areas of the most cited articles at Random Structures and Algorithms:

The journal papers generally zeroe in on subjects such as Combinatorics, Discrete mathematics, Random graph, Random regular graph and struct. While the journal papers focused on Combinatorics, they were also able to explore topics like Upper and lower bounds and Bounded function. In addition to Random graph research, the journal publications aim to explore topics under Pathwidth, Dense graph and Spanning tree.

What topics the last edition of the journal is best known for?

  • Botany
  • World War II
  • Combinatorics

The previous edition focused in particular on these issues:

The objective of Random Structures and Algorithms is to combine knowledge in the areas of Combinatorics, Random graph, Limit (mathematics), Degree (graph theory) and Conjecture. Graph, Vertex (graph theory), Vertex (geometry), Graph (abstract data type) and Hypergraph are all subfields of Combinatorics research that were featured in the journal. Almost surely, Stochastic block model, Minimum spanning tree and Homomorphism are some topics wherein Random graph research discussed in it have an impact.

The concepts on Limit (mathematics) presented in the journal can also apply to other research fields, including Convergence (routing), Logarithm, Central limit theorem, Statistical physics and Scaling limit. Topics in Degree (graph theory) were tackled in line with various other fields like Bounded function, Distribution (number theory) and Girth (graph theory). Issues in Conjecture were discussed, taking into consideration concepts from other disciplines like Order (ring theory), Type (model theory), Generalization, Partition (number theory) and Clique (graph theory).

The most cited articles from the last journal are:

  • Dynamic concentration of the triangle-free process (22 citations)
  • Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu (14 citations)
  • Fast algorithms at low temperatures via Markov chains (6 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Random Structures and Algorithms (based on the number of publications) are:

  • Alan Frieze (73 papers) published 2 papers at the last edition the same number as at the previous edition,
  • Svante Janson (55 papers) published 1 paper at the last edition, 1 less than at the previous edition,
  • Michael Krivelevich (49 papers) published 2 papers at the last edition, 3 less than at the previous edition,
  • Benny Sudakov (41 papers) published 2 papers at the last edition, 1 less than at the previous edition,
  • Béla Bollobás (37 papers) absent at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Random Structures and Algorithms (based on the number of publications) are:

  • Federal University of Paraná (170 papers) absent at the last edition,
  • Carnegie Mellon University (87 papers) published 3 papers at the last edition, 1 more than at the previous edition,
  • Tel Aviv University (85 papers) published 5 papers at the last edition, 3 less than at the previous edition,
  • Sao Paulo State University (67 papers) absent at the last edition,
  • University of Cambridge (56 papers) absent at the last edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 15.56% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 21.05% were posted by at least one author from the top 10 institutions publishing in the journal. Another 9.21% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 28.95% of all publications and 40.79% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • Powers of Hamiltonian cycles in randomly augmented graphs

    Andrzej Dudek;Christian Reiher;Andrzej Ruciński;Mathias Schacht

    (2020)
    37 Citations
  • Fast uniform generation of random graphs with given degree sequences

    Andrii Arman;Pu Gao;Nicholas C. Wormald

    (2021)
    33 Citations
  • Seeded graph matching via large neighborhood statistics

    Elchanan Mossel;Jiaming Xu

    (2020)
    30 Citations
  • On-Line Balancing of Random Inputs

    Nikhil Bansal;Joel H. Spencer

    (2020)
    29 Citations
  • Combinatorial and stochastic properties of ranked tree-child networks

    François Bienvenu;François Bienvenu;Amaury Lambert;Amaury Lambert;Mike Steel

    (2021)
    26 Citations

Related Online Degrees & Career Pathways

For students considering a degree in Computer Science, understanding the variety of online education options is crucial. Many adults choose online classes for adults to balance their studies with work and personal commitments. These programs offer flexibility without sacrificing quality.

Starting with an associates degree online can be a strategic step. It provides foundational skills and can often be completed in a shorter timeframe, making it ideal for those seeking quick entry into the tech field or a pathway towards a bachelor’s degree.

For those aiming to expedite their educational journey, accelerated bachelor degree programs offer the chance to earn a degree faster than traditional timelines. This is particularly beneficial for career changers and ambitious learners eager to join the workforce quickly.

Choosing the right degree is also about future potential. Many students ask, "what bachelors degree should I get?" A Computer Science degree is among the highest-paying options, opening doors to numerous lucrative career pathways in technology, software development, and cybersecurity.

Best Scientists Contributing to This Journal

Recently Published Articles