Tree and forest weights and their application to nonuniform random graphs

Annals of Applied Probability

Volumn 9, Issue 1, 1999, Pages 197-215

  Jones, Brian D ^a   Pittel, Boris G ^b   Verducci, Joseph S ^b  

^a KENYON COLLEGE   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Kirchhoff matrix; Matrix tree theorem; Maxwell's rule; Spanning tree; Spectral graph theory; Tree polynomial

Indexed keywords

EID: 0033423952     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1029962602     Document Type: Article

References (41)

1. BARBOUR, A. (1982). Poisson convergence and random graphs. Math. Proc. Cambridge Philos. Soc. 92 349-359.
2. BERAN, R. (1979). Exponential models for directional data. Ann. Statist. 7 1162-1178.
3. BIGGS, N. (1974). Algebraic Graph Theory. Cambridge Univ. Press.
4. BOLLOBÁS, B. (1985). Random Graphs. Academic Press, New York.
5. BOLLOBÁS, B. and ERDOS, P. (1976). Cliques in random graphs. Math Proc. Cambridge Philos. Soc. 80 419-427.
6. CHUNG, F. (1997). Spectral Graph Theory. Amer. Math. Soc., Providence, RI.
7. CHUNG, F. R. K. and LANGLANDS, R. P. (1996). A combinatorial Laplacian with vertex weights. J. Combin. Theory Ser. A 75 316-327.
8. DURRETT, R. (1991). Probability: Theory and Examples. Wadsworth & Brooks/Cole, Belmont, CA.
9. ERDOS, P. and RÉNYI, A. (1959). On random graphs I. Publ. Math. Debrecen 6 290-297.
10. ERDOS, P. and RÉNYI, A. (1960). On the evolution of random graphs. Publ. Math. Inst. Hungarian Acad. Sci. 5 17-61.
11. FARRELL, E. J. (1981). Tree polynomials of complete graphs and complete bipartite graphs. Pure Appl. Math. Sci. 13 7-13.
12. GILBERT, E. N. (1959). Random graphs. Ann. Math. Statist. 30 1141-1144.
13. GODSIL, C. D. (1981). Matching behaviour is asymptotically normal. Combinatorica 1 369-376.
14. GODSIL, C. D. (1984). Real graph polynomials. In Progress in Graph Theory 281-293. Academic Press, Toronto.
15. GODSIL, C. D. (1993). Algebraic Combinatorics. Chapman & Hall, New York.
16. GRIMMETT, G. R. (1976). An upper bound for the number of spanning trees of a graph. Discrete Math. 16 323-324.
17. GRIMMETT, G. R. and MCDIARMID, C. J. H. (1975). On colouring random graphs. Math Proc. Cambridge Philos. Soc. 77 313-324.
18. GRONE, R. and MERRIS, R. (1988). A bound for the complexity of a simple graph. Discrete Math. 69 97-99.
19. HARPER, L. H. (1967). Sterling behavior is asymptotically normal. Ann. Math. Statist. 38 410-414.
20. HEILMANN, O. J. and LIEB, E. H. (1972). Theory of monomer-dimer systems. Comm. Math. Phys. 25 190-232.
21. JANSON, S., KNUTH, D. E., LUCZAK, T. and PITTEL, B. (1993). The birth of a giant component. Random Structures Algorithms 4 233-358.
22. JONES, B. D. (1995). Tree components in random graph processes with nonuniform edge probabilities. Ph.D. dissertation, Dept. Statistics, Ohio State Univ.
23. KAHN, J. (1996). A normal law for matchings. Dept. Mathematics, Rutgers Univ. Preprint.
24. KAHN, J. (1997). Personal communication.
25. KAROŃSKI, M. (1995). Random graphs. In Handbook of Combinatorics I 351-380. MIT Press.
26. KELMANS, A. K. (1972). Asymptotic formulas for the probability of k-connectedness of random graphs. Theory Probab. Appl. 17 243-254.
27. LUCZAK, T., PITTEL, B. and WIERMAN, J. C. (1994). The structure of a random graph at the point of phase transition. Trans. Amer. Math. Soc. 341 721-748.
28. MARSHALL, A. W. and OLKIN, I. (1979). Inequalities: Theory of Majorization and Its Applications. Academic Press, New York.
29. MAXWELL, J. C. (1892). A Treatise on Electricity and Magnetism I, 3rd ed. Clarendon Press, Oxford.
30. MINC, H. (1978). Permanents. Encyclopedia of Mathematics and Its Applications 6. Addison-Wesley, Reading, MA.
31. MOON, J. W. (1970). Counting Labelled Trees. Clowes, London.
32. PALMER, E. M. (1985). Graphical Evolution. Wiley, New York.
33. PERCIVAL, W. S. (1953). The solution of passive electrical networks by means of mathematical trees. Proceedings of the Institute of Electrical Engineers 100 143-150.
34. PITMAN, J. (1997). Probabilistic bounds on the coefficients of polynomials with only real zeros. J. Combin. Theory Ser. A 77 279-303.
35. PITTEL, B. (1990). On tree census and the giant component in sparse random graphs. In Random Structures and Algorithms 1 311-342. Wiley, New York.
36. STEELE J. M. (1987). Gibbs measures on combinatorial objects and the central limit theorem for an exponential family of random trees. Probab. Engrg. Inform. Sci. 1 47-59.
37. STEPANOV, V. E. (1969). Combinatorial algebra and random graphs. Theory Probab Appl. 14 373-399.
38. m(t). Theory Probab. Appl. 15 55-56.
39. STEPANOV, V. E. (1970b). Phase transitions in random graphs. Theory Probab. Appl. 15 187-203.
40. VAN LINT, J. H. and WILSON, R. M. (1992). A Course in Combinatorics. Cambridge Univ. Press.
41. VERDUCCI, J. S. (1989). Minimum majorization decomposition. In Contributions to Probability and Statistics (L. J. Gleser, M. D. Perlman, S. J. Press and A. R. Sampson, eds.) 160-173. Springer, New York.