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 ...

We consider a random walker on a d-regular graph. Starting from a fixed vertex, the first step is a unit step in any one of the d directions, with common probability 1/d for each one. At any later ...

verybody has a favorite color and season—preferences that seem innate, always defying reason. Auditors are no different when it comes to haphazard sampling, a process in which—ideally—they choose ...