Skip to main content

Random graphs and the physical world

  • Conference paper
  • First Online:
Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1018))

Abstract

Evolving random graph R as introduced and studied by Erdös and Rényi, represent the limit of random f-graphs R f when f→∞. The latter have been studied mainly by chemists. Such systems show an abrupt transition with the appearance of a giant component (1-connected subgraph) which models transitions in physical systems. It is known that further abrupt transitions in R f (and R ) occur with the appearance of giant k-connected subgraphs and these transitions also appear to have their counterparts in physical systems. Cycle length distributions in R f and R (following the k=1 transition) appear to be inconsistent with the use of these random graphs as physical models and have led to the use of random lattice-graphs R L(f). Results from percolation theory in physics relate to an abrupt transition for 1-connected subgraphs and lead to some interesting conclusions about the use of random lattice-graphs when these systems are compared to the transition in R f. Further progress in applying random graph theory to model physical systems requires that similar results on abrupt transitions for k-connected subgraphs and on cycle distributions in R L(f) be obtained. We report here on progress and problems of this type in the setting of the applicability of random graphs to model highly interesting physical, chemical and biological systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.S. Bloom, J.W. Kennedy and L.V. Quintas, Distance degree regular graphs, in: Theory and Applications of Graphs, Proceedings, Michigan (1980) John Wiley and Sons, New York, (1981), 95–108.

    Google Scholar 

  2. G.S. Bloom, J.W. Kennedy and L.V. Quintas, Some problems concerning distance and path degree sequences, These Proceedings.

    Google Scholar 

  3. G.S. Bloom, J.W. Kennedy, M.T. Manziuk and L.V. Quintas, Cycle distributions in random graphs, SIAM Conf. on Applications of Discrete Mathematics, Troy, New York, June (1981), in preparation.

    Google Scholar 

  4. B. Bollobas, Graph Theory, Springer-Verlag (1979), Chapter 7.

    Google Scholar 

  5. W. Burchard, K. Kajiwara, M. Gordon, J. Kalál and J.W. Kennedy, Rayleigh scattering from solutions of critically branched polycondensates, Macromelecules, 6 (1973), 642–649.

    Article  Google Scholar 

  6. C. Cohen, J.H. Gibbs and P.D. Flemming, Condensation and gelation: clarification of Stockmayer's analogy, J. Chem. Phys. 59 (1973), 5511–5516.

    Article  Google Scholar 

  7. J.E. Cohen, Threshold phenomena in random structures, 7th Int. Conf. From Theoretical Physics to Biology, Vienna (1979).

    Google Scholar 

  8. C. Domb, T. Schneider and E. Stoll, Cluster shapes in lattice gases and percolation, J. Phys. A: Math. Gen. 8 (1975), L90–94.

    Article  Google Scholar 

  9. P. Erdös and A. Rényi, On random graphs I, Publ. Math. Debrecen, 6 (1959). 290–297.

    MathSciNet  MATH  Google Scholar 

  10. P. Erdös and A. Rényi, On the evolution of random graphs, Magya.Tud. Akad. Mat. Kut. Int. Kozl., 5 (1960), 17–61.

    MathSciNet  MATH  Google Scholar 

  11. P. Erdös and A. Rényi, On the evolution of random graphs, Bull. Inst. Intermat. Statist. (Tokyo), 38 (1961), 343–347.

    MathSciNet  MATH  Google Scholar 

  12. P. Erdös and J. Kennedy, k-connectivity in random graphs, (1981).

    Google Scholar 

  13. J.W. Essam and M.E. Fisher, Some basic definitions in graph theory, Reviews and Modern Physics, 42 (1970), 272–288.

    Article  MathSciNet  MATH  Google Scholar 

  14. J.W. Essam, Percolation and cluster size, Ch. 6, pp. 197–269 in: Phase Transitions and Critical Phenomena, Vol. 2, C. Domb and M.S. Green (eds.), Academic Press (1972).

    Google Scholar 

  15. S.W. Golomb, Polynominoes, Charles Scribner's Sons, New York (1965)

    Google Scholar 

  16. I.J. Good, Cascade theory and the molecular weight averages of the sol fraction, Proc. Roy, Soc. A272 (1963), 54–59.

    Article  Google Scholar 

  17. M. Gordon, Good's theory of cascade processes applied to the statistics of polymner distributions, Proc. Roy. Soc., A268 (1962), 240–269.

    Article  Google Scholar 

  18. M. Gordon and S.B. Ross-Murphy, The structure and properties of molecular trees and networks, Pure and Applied Chem. 43 (1975), 1–26.

    Article  Google Scholar 

  19. M. Gordon and W.B. Temple, The graph-like state of matter and polymer science, Ch. 10 (pp.299–332) in: Chemical Applications of Graph Theory, A.T. Balaban (ed.), Academic Press (1976).

    Google Scholar 

  20. R.A. Horne (ed.), Water and Aqueous Solutions: Structure, Thermodynamics and Transport Processes, Wiley-Interscience (1972).

    Google Scholar 

  21. M.L. Huggins and J.W. Kennedy, Thermodynamic properties of liquids including solutions: XV. — Intermolecular contacts and their effects on the excess enthalpies of solutions of chain molecules, especially benzene solutions of normal alkanes and polymethylenes, Polymer J. (Japan), 11 (1979), 315–322.

    Article  Google Scholar 

  22. M. Karoński, A review of random graphs, Komunikaty i Rozprawy, Institute of Mathematics, Poznań Univ. (1978), (revised version J. Graph Theory, 6 (1982) 349–389).

    Google Scholar 

  23. J.W. Kennedy, Random Clumps, graphs and polymer solutions, in: Theory and Applications of Graphs, Y. Alavi and D. Lick (eds.), Proceedings, Michigan (1976). Lecture Notes in Mathematics #642, Springer-Verlag, Berlin (1978).

    Google Scholar 

  24. J.W. Kennedy, Minimal cycle basis distributions (An open problem: Why do icebergs float?) Graph Theory Newsletter, 9 (1979), 5–6.

    Google Scholar 

  25. J.W. Kennedy, k-connectivity and cycles in random graphs with applications, NOTES from New York Graph Theory Day 1, GTD 1:2, May (1980), J.W. Kennedy and L.V. Quintas (eds.), New York Academy of Sciences (1981).

    Google Scholar 

  26. J.W. Kennedy, ICYCLES-I. (Random graphs, physical transitions, polymer gels, and the liquid state), in: Theory and Applications of Graphs, Proceedings, Michigan (1980). John Wiley and Sons, New York (1981), 409–429.

    Google Scholar 

  27. J.W. Kennedy, Statistical mechanics and large random graphs, in: Data Processing in Chemistry, Proceedings, Rzeszów, Poland (1980). Elsevier, (1981) 96–114.

    Google Scholar 

  28. J.W. Kennedy and L.V. Quintas, Extremal f-frees and embedding spaces for molecular graphs, submitted (1980). Discrete Applied Math., 5 (1983), in press.

    Google Scholar 

  29. J.L. Martin, The exact enumeration of self-avoiding walks on a lattice, Proc. Camb. Phil. Soc., 58 (1962), 92–101.

    Article  MathSciNet  MATH  Google Scholar 

  30. M.T. Mandziuk and J.W. Kennedy, ICYCLES-III. (A model for liquids like water), in preparation.

    Google Scholar 

  31. J.A. Pryde, The Liquid State, Hutchinson University Publications, London (1966).

    Google Scholar 

  32. L.V. Quintas, G.S. Bloom and J.W. Kennedy, ICYCLES-II. (Random lattice-graphs: a model for liquid water), in preparation.

    Google Scholar 

  33. L.E. Reichl, A Modern Course in Statistical Physics, University of Texas Press, Austin (1980), pp. 135 and 205.

    Google Scholar 

  34. G.S. Rushbrook and J. Eve, On noncrossing lattice polygons, J. Chem. Phys. 31 (1959), 1333–1334.

    Article  Google Scholar 

  35. K. Schürger, On the evolution of random graphs over expanding square lattices, Acta Mathematica Scientiarium Hungaricae, 27 (1976), 281–292.

    Article  MathSciNet  Google Scholar 

  36. N.J. Sloane, Handbook of Integer Sequences, sequence #703, p. 78, Academic Press, New York (1973).

    MATH  Google Scholar 

  37. References [14,16,17] are reproduced in J. Spencer (ed.), Paul Erdös, The Art of Counting, MIT Press, Ch. 14 (1973), 559–611.

    Google Scholar 

  38. W.H. Stockmayer, Theory of molecular size distribution and gel formation in branched-chain polymers, J. Chem. Phys., 11 (1943), 45–55.

    Article  Google Scholar 

  39. D.J.A. Welsh, Percolation theory and related topics, Science Progress, Oxford, 64 (1977), 65–83.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. Borowiecki John W. Kennedy Maciej M. Sysło

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Bloom, G.S., Mandziuk, M.T., Kennedy, J.W., Quintas, L.V. (1983). Random graphs and the physical world. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071618

Download citation

  • DOI: https://doi.org/10.1007/BFb0071618

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12687-4

  • Online ISBN: 978-3-540-38679-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics