A triangle process on regular graphs

DOI10.1007/978-3-030-79987-8_22MaRDI QIDQ6356844arXivFDO

Authors Colin Cooper, Martin Dyer, Catherine Greenhill

Publication date 23 December 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-79987-8_22

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

arXiv classification

cs.DMmath.CO

Abstract: Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at least one triangle. Triangle switches can be used to define Markov chains which generate graphs with a given degree sequence and with many more triangles (3-cycles) than is typical in a uniformly random graph with the same degrees. We show that the set of triangle switches connects the set of all $d$-regular graphs on $n$ vertices, for all $dgeq3$. Hence, any Markov chain which assigns positive probability to all triangle switches is irreducible on these graphs. We also investigate this question for 2-regular graphs.

This page was built for publication: A triangle process on regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356844)