John Larkin

collaborators

2 papers

math.CO2025

Subgraphs in random graphs with specified degrees and forbidden edges

John Larkin, Brendan D. McKay, Fang Tian

Let $G$ be a uniformly chosen simple (labelled) random graph with given degree sequence $d$ and let $X, Y, L$ be edge-disjoint graphs on the same vertex set as $G$ . We i…

cs.DS2024

Convergence Properties of the Asynchronous Maximum Model

John Larkin

Let $G = (V, E)$ be a connected directed graph on $n$ vertices. Assign values from the set ${1, 2, \dots, n}$ to the vertices of $G$ and update the values according to the following…