Description
TL;DR: A mathematical corrigendum repairing a technical error in a Markov-chain proof used for regular-graph sampling and a peer-to-peer application.
About This Document
Colin Cooper, Martin Dyer, and Catherine Greenhill revisit a theorem from their 2007 work on the switch chain for sampling d-regular graphs. The correction explains the proof defect and adjusts the polynomial mixing-time bound while retaining the broader sampling result and its network motivation.
Why Bitcoin People May Care
This is not Bitcoin and does not analyze blockchain consensus. Its value is methodological and network-adjacent: peer-to-peer systems often rely on graph structure, while corrigenda show how technical conclusions are repaired when proofs fail at a specific step. The document should be read with the original article rather than as a standalone network design.
What You Receive
Purchase reveals the verified preserved PDF location for this document.
Document Details
- Title: Corrigendum: Sampling Regular Graphs and a Peer-to-Peer Network
- Author / organization: Colin Cooper, Martin Dyer, and Catherine Greenhill
- Year: 2012
- Language: English
- Document type: Mathematical corrigendum
- Pages: 8
CacheRat provides researched source-location and document-identification information. CacheRat does not claim ownership of the underlying third-party documentation.
