𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Alternative Markov Properties for Chain Graphs

✍ Scribed by Steen A. Andersson; David Madigan; Michael D. Perlman

Book ID
108536128
Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
955 KB
Volume
28
Category
Article
ISSN
0303-6898

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A more rapidly mixing Markov chain for g
A more rapidly mixing Markov chain for graph colorings
✍ Martin Dyer; Catherine Greenhill πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 351 KB πŸ‘ 2 views

We define a new Markov chain on proper k-colorings of graphs, and relate its convergence properties to the maximum degree ⌬ of the graph. The chain is shown to have bounds on convergence time appreciably better than those for the well-known JerrumrSalas᎐Sokal chain in most circumstances. For the cas

On Markov Chains for Randomly H-Coloring
On Markov Chains for Randomly H-Coloring a Graph
✍ Colin Cooper; Martin Dyer; Alan Frieze πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 144 KB

Let H = W F be a graph without multiple edges, but with the possibility of having loops. Let G = V E be a simple graph. A homomorphism c is a map c V β†’ W with the property that v w ∈ E implies that c v c w ∈ F. We will often refer to c v as the color of v and c as an H-coloring of G. We consider the