Date: 2021 / Journal: Random structures & algorithms - British Library Electronic Legal Deposit Catalogue-Journal Issues and Articles Search Results

Date 2021 Journal Random structures & algorithms

1. A branching process approach to level‐k phylogenetic networks. Issue 2 (26th November 2021)

Authors:: Stufler, Benedikt
Journal:: Random structures & algorithms
Issue:: Volume 61:Issue 2(2022)
Page Start:: 397
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

2. A generalization of Faudree–Lehel conjecture holds almost surely for random graphs. Issue 2 (7th November 2021)

Authors:: Przybyło, Jakub
Journal:: Random structures & algorithms
Issue:: Volume 61:Issue 2(2022)
Page Start:: 383
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

3. A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph. Issue 4 (5th April 2021)

Authors:: Andreis, Luisa; König, Wolfgang; Patterson, Robert I. A.
Journal:: Random structures & algorithms
Issue:: Volume 59:Issue 4(2021)
Page Start:: 522
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

4. A scaling limit for the length of the longest cycle in a sparse random digraph. Issue 1 (14th June 2021)

Authors:: Anastos, Michael; Frieze, Alan
Journal:: Random structures & algorithms
Issue:: Volume 60:Issue 1(2022)
Page Start:: 3
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

5. A unified view of graph regularity via matrix decompositions. Issue 1 (11th October 2021)

Authors:: Bodwin, Greg; Vempala, Santosh
Journal:: Random structures & algorithms
Issue:: Volume 61:Issue 1(2022)
Page Start:: 62
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

6. Algebraic and combinatorial expansion in random simplicial complexes. Issue 3 (16th July 2021)

Authors:: Fountoulakis, Nikolaos; Przykucki, Michał
Journal:: Random structures & algorithms
Issue:: Volume 60:Issue 3(2022)
Page Start:: 339
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

7. An asymmetric random Rado theorem for single equations: The 0‐statement. Issue 4 (21st August 2021)

Authors:: Hancock, Robert; Treglown, Andrew
Journal:: Random structures & algorithms
Issue:: Volume 60:Issue 4(2022)
Page Start:: 529
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

8. Approximating the distance to monotonicity of Boolean functions. Issue 2 (24th June 2021)

Authors:: Pallavoor, Ramesh Krishnan S.; Raskhodnikova, Sofya; Waingarten, Erik
Journal:: Random structures & algorithms
Issue:: Volume 60:Issue 2(2022)
Page Start:: 233
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

9. Asymptotic behavior of some factorizations of random words. Issue 3 (20th December 2021)

Authors:: Zohoorian Azad, Elahe; Chassaing, Philippe
Journal:: Random structures & algorithms
Issue:: Volume 61:Issue 3(2022)
Page Start:: 543
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

10. Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels. Issue 3 (20th March 2021)

Authors:: Borga, Jacopo
Journal:: Random structures & algorithms
Issue:: Volume 59:Issue 3(2021)
Page Start:: 339
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗