DocuGuru
Wiley

Random Structures and Algorithms Template

Write in a clean editor, then format for Random Structures and Algorithms in one click — DocuGuru applies the official Wiley template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.

Use this template

About the Random Structures and Algorithms format

Random Structures and Algorithms is a peer-reviewed journal published by Wiley, covering Limits and Structures in Graph Theory, Stochastic processes and statistical mechanics, Advanced Graph Theory Research.

PublisherWiley
Reference styleAuthor–year (Chicago)
Author–year — (Smith, 2023) in the text
Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." Random Structures and Algorithms 12 (3): 45–58.

Formats any DOI in Random Structures and Algorithms style. No sign-up.

Publishes research inLimits and Structures in Graph Theory Stochastic processes and statistical mechanics Advanced Graph Theory Research Markov Chains and Monte Carlo Methods Graph theory and applications
ISSN1042-9832
Citation impact (2-yr)0.71
h-index100
i10-index939
Total citations52,897
Article processing charge$4,330
Top institutions publishing hereTel Aviv University
Journal websiteonlinelibrary.wiley.com
You getA submission-ready PDF and the editable LaTeX source — ready to submit.

Papers published in Random Structures and Algorithms per year

64
2014
44
2015
90
2016
55
2017
90
2018
76
2019
95
2020
89
2021
68
2022
81
2023
67
2024
69
2025

Citation impact of Random Structures and Algorithms by publication year

987
2014
452
2015
792
2016
275
2017
460
2018
331
2019
423
2020
235
2021
171
2022
189
2023
76
2024
41
2025

Citations each year’s papers have accumulated so far — the most recent years are still building up.

Most-cited papers in Random Structures and Algorithms

A critical point for random graphs with a given degree sequence

Michael Molloy, Bruce Reed · 1 Mar 1995

Abstract Given a sequence of nonnegative real numbers λ 0 , λ 1 … which sum to 1, we consider random graphs having approximately λ i n vertices of degree i. Essentially, we show that if Σ i(i ‐ 2)λ i > 0, then such graphs almost surely have a giant component, while if Σ…

2,406 citations Cite SaveGo to paper →
Exact sampling with coupled Markov chains and applications to statistical mechanics

James Propp, David Bruce Wilson · 1 Aug 1996

For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has run for M steps, with M sufficiently large,…

1,146 citations Cite SaveGo to paper →
An elementary proof of a theorem of Johnson and Lindenstrauss

Sanjoy Dasgupta, Anupam Gupta · 19 Nov 2002

Abstract A result of Johnson and Lindenstrauss [13] shows that a set of n points in high dimensional Euclidean space can be mapped into an O( log n/ϵ 2 )‐dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 ± ϵ). In this note, we prove this…

965 citations Cite SaveGo to paper →
The degree sequence of a scale‐free random graph process

Béla Bollobás, Oliver Riordan, Joel Spencer et al. · 18 Apr 2001

Abstract Recently, Barabási and Albert [2] suggested modeling complex real‐world networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number of earlier vertices, selected with probabilities proportional to their degrees. In [2] and, with…

839 citations Cite SaveGo to paper →

Random Structures and Algorithms template — frequently asked questions

How do I write a paper in the Random Structures and Algorithms format?
In DocuGuru you write your manuscript in a normal editor — no LaTeX setup required — and select the Random Structures and Algorithms template. When you export, DocuGuru compiles the paper into the official Wiley format and hands you a submission-ready PDF along with the editable LaTeX source.
What reference style does Random Structures and Algorithms use?
Random Structures and Algorithms uses Author–year (Chicago) references, shown as author–year markers such as (Smith, 2023) in the text. DocuGuru formats every in-text citation and the reference list in this exact style automatically. A reference appears like this: Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." Random Structures and Algorithms 12 (3): 45–58.
Do I need to know LaTeX to submit to Random Structures and Algorithms?
No. DocuGuru generates the USG LaTeX class and compiles the PDF for you in the background, so you get a Wiley-ready Random Structures and Algorithms document without writing any LaTeX. If you do want it, the LaTeX source is included in the export.
Can I import an existing draft into the Random Structures and Algorithms template?
Yes. Paste or upload your current manuscript — Word, LaTeX, Markdown, or plain text — and DocuGuru reflows it into the Random Structures and Algorithms format with correct headings, figures, tables, and author–year citations.
Who publishes Random Structures and Algorithms?
Random Structures and Algorithms is a multidisciplinary journal published by Wiley. DocuGuru's Random Structures and Algorithms template matches Wiley's official submission format.
Can I export a submission-ready Random Structures and Algorithms PDF?
Yes — DocuGuru produces a PDF built with the official Random Structures and Algorithms template (the USG class) that is ready to submit to Wiley, together with the matching LaTeX source files.
How much does the Random Structures and Algorithms template cost?
You can start writing in the Random Structures and Algorithms template for free. Exporting the final submission-ready Random Structures and Algorithms PDF and LaTeX source is part of DocuGuru's paid plans — see the app for current pricing.
Use the Random Structures and Algorithms template