The Structure of Random Graph Orders

The random graph order $P_{n,p}$ is defined by taking a random graph $G_{n,p}$ on vertex set $[n]$, treating an edge $ij$ with $i\prec j$ in $[n]$ as a relation $i

[1]  Noga Alon,et al.  LINEAR EXTENSIONS OF A RANDOM PARTIAL ORDER , 1994 .

[2]  G. Hardy,et al.  Asymptotic formulae in combinatory analysis , 1918 .

[3]  Charles M. Newman,et al.  Chain Lengths in Certain Random Directed Graphs , 1992, Random Struct. Algorithms.

[4]  L. Gordon,et al.  Two moments su ce for Poisson approx-imations: the Chen-Stein method , 1989 .

[5]  D. Kleitman.  Families of Non-disjoint subsets* , 1966 .

[6]  Louis H. Y. Chen.  Poisson Approximation for Dependent Trials , 1975 .

[7]  G. Grimmett,et al.  Probability and random processes , 2002 .

[8]  G. Brightwell.  Models of random partial orders , 1993 .

[9]  V. V. Petrov.  Sums of Independent Random Variables , 1975 .

[10]  Paul Erdös,et al.  On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph , 1984 .

[11]  Michael H. Albert,et al.  Random graph orders , 1989 .

[12]  Graham R. Brightwell,et al.  Linear extensions of random orders , 1994, Discret. Math..

[13]  A. C. Berry.  The accuracy of the Gaussian approximation to the sum of independent variates , 1941 .

[14]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[15]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[16]  G. K. Eagleson,et al.  Poisson approximation for some statistics based on exchangeable trials , 1983, Advances in Applied Probability.

[17]  Klaus Simon,et al.  On the Distribution of the Transitive Closure in a Random Acyclic Digraph , 1993, ESA.