scientific article; zbMATH DE number 3928066

MaRDI QIDQ3702260zbMATH OpenFDO

Authors Peter Donnelly, D. J. A. Welsh

Publication date 1984

zbMATH Keywords

annihilating random walksantivoter modelgraph colouringparticle systemrandom colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Social choice (91B14)

Recommendations

• scientific article; zbMATH DE number 4210190
• Ergodic behaviour of ``signed voter models
• Random coloring evolution on graphs
• Edge flipping in graphs
• A parallel variant of a heuristical algorithm for graph colouring

Cited in

(8)

• A randomised 3-colouring algorithm
• On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted U-statistics
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
• Fundamentals of Stein's method
• Voting 'Against' in regular and nearly regular graphs
• Edge flipping in graphs
• A fresh look at a randomized massively parallel graph coloring algorithm
• Dominic Welsh: his work and influence

This page was built for publication:

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