Scaling laws for properties of random graphs that grow via successive combination

We consider undirected graphs that grow through the successive combination of component sub-graphs. For any well-behaved functions defined for such graphs, taking values in a Banach space, we show that there must exist a scaling law applicable when successive copies of the same component graph are c...

Full description

Bibliographic Details
Main Author: Grindrod, P. (Author)
Format: Article
Language:English
Published: Oxford University Press 2022
Subjects:
Online Access:View Fulltext in Publisher