An example of graph limits of growing sequences of random graphs (Q2443436)

This paper studies graph limits of growing sequences of random graphs. The graphs grow as follows. At each step we add one node, and the neighbors of the new node are chosen uniformly, and the number is a random variable with a fixed but arbitrary distribution depending on the number of nodes already present. Some examples of such random graphs are examined within the framework of graph limits. A kernel is defined in order to discover the limit of the growing random graph. It is shown that the growing graph on \(n\) nodes can have the same distribution as the random graph with \(n\) nodes that the kernel defines. Some open problems are also discussed.