Enumerating graphs and Brownian motion

Communications on Pure and Applied Mathematics

Volumn 50, Issue 3, 1997, Pages 291-294

  Spencer, Joel ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007508170     PISSN: 00103640     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0312(199703)50:3<291::AID-CPA4>3.0.CO;2-6     Document Type: Article

References (3)

1. Aldous, D., Brownian excursions, Critical Random Graphs and the 1-Coalescent, preprint.
2. Louchard, G., The Brownian excursion: a numerical analysis, Comput. Math. Appl. 10, 1984, pp. 413-417.
3. Wright, E. M., The number of connected sparsely edged graphs, J. Graph Theory 1, 1977, pp. 317-330.