Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

A uniformly random graph on n vertices with a fixed degree sequence, obeying a γ subpower law, is studied. It is shown that, for γ > 3, in a subcritical phase with ...

This is a preview. Log in through your library . Abstract In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a ...

Imagine placing oranges or tennis balls into a rigid container. How can the balls be arranged such that they occupy the largest volume fraction of the container, otherwise known as the largest packing ...