Hostname: page-component-6b989bf9dc-llglr Total loading time: 0 Render date: 2024-04-14T20:20:21.376Z Has data issue: false hasContentIssue false

Random Star Processes

Published online by Cambridge University Press:  01 January 2000

H. D. ROBALEWSKA
Affiliation:
Department of Mathematics and Statistics, University of Melbourne, Parkville, VIC 3052, Australia (e-mail: hanna@ms.unimelb.edu.au, nick@ms.unimelb.edu.au)
N. C. WORMALD
Affiliation:
Department of Mathematics and Statistics, University of Melbourne, Parkville, VIC 3052, Australia (e-mail: hanna@ms.unimelb.edu.au, nick@ms.unimelb.edu.au)

Abstract

A type of evolution of graphs with maximum vertex degree at most d is introduced. This evolution can start from any initial graph whose set of vertices of degree less than d is independent. The main concern is the regularity of graphs generated by this graph process when the initial graph has no edges. By analysis of the solutions of systems of differential equations it is shown that the final graph of this evolution is asymptotically almost surely a d-regular graph (subject to the usual parity condition).

Type
Research Article
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)