Discrepancy properties for random regular digraphs
- 1 March 2016
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 50 (1) , 23-58
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Sparse regular random graphs: Spectral density and eigenvectorsThe Annals of Probability, 2012
- Stein’s method for concentration inequalitiesProbability Theory and Related Fields, 2006
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Random regular graphs of high degreeRandom Structures & Algorithms, 2001
- List Coloring of Random and Pseudo-Random GraphsCombinatorica, 1999
- Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)Combinatorica, 1991
- Asymptotic Enumeration by Degree Sequence of Graphs of High DegreeEuropean Journal of Combinatorics, 1990
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980
- Some problems in the enumeration of labelled graphsBulletin of the Australian Mathematical Society, 1980
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978