Random Structures & Algorithms

Early View Articles

Research Articles

And/or trees: A local limit point of view

  • Author: Nicolas Broutin, Cécile Mailler
  • Pub Online: Jan 11, 2018
  • DOI: 10.1002/rsa.20758 (p )

Cover time and mixing time of random walks on dynamic graphs

  • Author: Chen Avin, Michal Koucký, Zvi Lotker
  • Pub Online: Dec 26, 2017
  • DOI: 10.1002/rsa.20752 (p )

Random graphs with given vertex degrees and switchings

  • Author: Svante Janson
  • Pub Online: Feb 13, 2020
  • DOI: 10.1002/rsa.20911 (p )

Sharp thresholds for nonlinear Hamiltonian cycles in hyerpgraphs

  • Author: Bhargav Narayanan, Mathias Schacht
  • Pub Online: Feb 27, 2020
  • DOI: 10.1002/rsa.20919 (p )

New bounds for the Moser‐Tardos distribution

  • Author: David G. Harris
  • Pub Online: Mar 03, 2020
  • DOI: 10.1002/rsa.20914 (p )

Tree decompositions of graphs without large bipartite holes

  • Author: Jaehoon Kim, Younjin Kim, Hong Liu
  • Pub Online: Mar 10, 2020
  • DOI: 10.1002/rsa.20913 (p )

Minimalist designs

  • Author: Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus
  • Pub Online: Mar 11, 2020
  • DOI: 10.1002/rsa.20915 (p )

Eigenvector delocalization for non‐Hermitian random matrices and applications

  • Author: Kyle Luh, Sean O'Rourke
  • Pub Online: Mar 12, 2020
  • DOI: 10.1002/rsa.20917 (p )

Finding a Hamilton cycle fast on average using rotations and extensions

  • Author: Yahav Alon, Michael Krivelevich
  • Pub Online: Mar 16, 2020
  • DOI: 10.1002/rsa.20918 (p )

Modularity of Erdős‐Rényi random graphs

  • Author: Fiona Skerman, Colin McDiarmid
  • Pub Online: Mar 20, 2020
  • DOI: 10.1002/rsa.20910 (p )

On the discrepancy of random matrices with many columns

  • Author: Cole Franks, Michael Saks
  • Pub Online: Mar 27, 2020
  • DOI: 10.1002/rsa.20909 (p )

Recursive functions on conditional Galton‐Watson trees

  • Author: Nicolas Broutin, Luc Devroye, Nicolas Fraiman
  • Pub Online: Apr 11, 2020
  • DOI: 10.1002/rsa.20921 (p )

Size of nodal domains of the eigenvectors of a graph

  • Author: Mark Rudelson, Han Huang
  • Pub Online: Apr 16, 2020
  • DOI: 10.1002/rsa.20925 (p )

Learning random points from geometric graphs or orderings

  • Author: Josep Díaz, Colin McDiarmid, Dieter Mitsche
  • Pub Online: Apr 22, 2020
  • DOI: 10.1002/rsa.20922 (p )

Hyperuniform and rigid stable matchings

  • Author: Michael Andreas Klatt, Günter Last, D. Yogeshwaran
  • Pub Online: Apr 28, 2020
  • DOI: 10.1002/rsa.20923 (p )
Page:   Prev 1 2 3 Next

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.