A triangle process on regular graphs

DOI10.1007/978-3-030-79987-8_22OpenAlexW3186682637MaRDI QIDQ2115867FDOQ2115867

Colin Cooper, Martin Dyer, Catherine Greenhill

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2012.12972

zbMATH Keywords

Markov chainsirreducibilitytrianglesregular graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random graphs.
• Transformations of cubic graphs
• Sampling Regular Graphs and a Peer-to-Peer Network
• A sequential algorithm for generating random graphs
• A simple criterion on degree sequences of graphs
• Introduction to reconfiguration
• Uniform Generation of Random Regular Graphs
• The switch Markov chain for sampling irregular graphs and digraphs
• Towards random uniform sampling of bipartite graphs with given degree sequence
• The flip Markov chain for connected regular graphs
• Expanders via Local Edge Flips
• Rapid mixing of the switch Markov chain for strongly stable degree sequences

Cited In (3)

• A triangle process on regular graphs
• Title not available (Why is that?)
• Random processes with convex coordinates on triangular graphs

   Recommendations

• Random processes with convex coordinates on triangular graphs 👍 👎
• Triangles in random graphs 👍 👎
• Random triangles in random graphs 👍 👎
• On the triangle space of a random graph 👍 👎
• On triangle-free random graphs 👍 👎
• Triangles in randomly perturbed graphs 👍 👎
• On the distribution in a graph process 👍 👎
• Title not available (Why is that?) 👍 👎
• Triangle‐free subgraphs in the triangle‐free process 👍 👎

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 Q2115867)