The structure of random graph orders

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 2, 1997, Pages 318-335

  Bollobás, Béla ^a,c   Brightwell, Graham ^b  

^a University of Memphis   (United States)

^b LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Partial order; Random graph; Random partial order

Indexed keywords

EID: 0004448643     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194281215     Document Type: Article

References (23)

1. M. ALBERT AND A. FRIEZE, Random graph orders, Order, 6 (1989), pp. 19-30.
2. N. ALON, B. BOLLOBÁS, G. BRIGHTWELL, AND S. JANSON, Linear extensions of a random partial order, Ann. Appl. Probab., 4 (1994), pp. 108-123.
3. R. ARRATIA, L. GOLDSTEIN, AND L. GORDON, Two moments suffice for Poisson approximation: The Stein-Chen method, Ann. Probab., 17 (1989), pp. 9-25.
4. K. AZUMA, Weighted sums of certain dependent random variables, Tôhoku Math. J., 19 (1967), pp. 357-367.
5. A. BARAK AND P. ERDOS, On the maximal number of strongly independent vertices in a random acyclic directed graph, SIAM J. Algebraic Discrete Meth., 5 (1984), pp. 508-514.
6. A. D. BARBOUR AND G. K. EAGLESON, Poisson approximation for some statistics based on exchangeable trials, Adv. Appl. Probab., 15 (1982), pp. 585-600.
7. A. C. BERRY, The accuracy of Gaussian approximation to the sum of independent variables, Trans. Amer. Math. Soc., 49 (1941), pp. 122-136.
8. B. BOLLOBÁS, Martingales, isoperimetric inequalities and random graphs, in Combinatorics, A. Hajnal, L. Lovász, and V. T. Sós, eds., Colloq. Math. Sci. Janos Bolyai 52, North-Holland, 1988, pp. 113-139.
9. B. BOLLOBÁS, Sharp concentration of measure phenomena in random graphs, in Random Graphs '87, M. Karonski, J. Jaworski, and A. Rucinski, eds., John Wiley, New York, 1990, pp. 1-15.
10. B. BOLLOBÁS, Combinatorics, Cambridge University Press, London, 1986.
11. B. BOLLOBáS AND G. BRIGHTWELL, The width of random graph orders, The Mathematical Scientist, 20 (1995), pp. 69-90.
12. B. BOLLOBáS AND G. BRIGHTWELL, The dimension of random graph orders, in The Mathematics of Paul Erdos II, R. L. Graham and J. Nesetril, eds., Springer-Verlag, 1996, pp. 51-69.
13. G. BRIGHTWELL, Linear extensions of random orders, Discrete Math., 125 (1994), pp. 87-96.
14. G. BRIGHTWELL, Models of random partial orders, in Surveys in Combinatorics 1993, Invited papers at the 14th British Combinatorial Conference, K. Walker, ed., Cambridge University Press, London, 1993, pp. 53-83.
15. L. H. Y. CHEN, Poisson approximation for dependent trials, Ann. Probab., 3 (1975) pp 534-535.
16. G. R. GRIMMETT AND D. R. STIRZAKER, Probability and Random Processes, Oxford University Press, London, 1982.
17. M. HALL, Combinatorial Theory, 2nd ed., Wiley-Interscience Series in Discrete Mathematics 1986.
18. G. H. HARDY AND S. RAMANUJAN, Asymptotic formulae in combinatorial analysis, Proc. London Math. Soc. (2), 17 (1918), pp. 75-115.
19. D. J. KLEITMAN, Families of non-disjoint subsets, J. Combinatorial Theory 1 (1966), pp. 153-155.
20. C. J. H. MCDIARMID, On the method of bounded differences, in Surveys in Combinatorics 1989, Invited papers at the 12th British Combinatorial Conference, J. Siemons, ed., Cambridge University Press, London, 1989, pp. 148-188.
21. C. M. NEWMAN, Chain lengths in certain random directed graphs, Random Structures Algorithms, 3 (1992), pp. 243-253.
22. V. V. PETROV, Sums of Independent Random Variables, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 82, Springer, 1975.
23. K. SIMON, D. CRIPPA, AND F. COLLENBERG, On the distribution of the transitive closure in a random acyclic digraph, Lecture Notes in Comput. Sci., 726 (1993), pp. 345-356.