Pajek networks

Dataset: bonheure

The network bonheure was published in the paper François Bonhoure, Yves Dallery, William J. Stewart: Algorithms for Periodic Markov Chains in Figure 2. It is an example of strongly connected graph with periodic decomposition into 4 periodic components.

The Pajek project file bonheure.paj contains the following data:

• The network Bonheure.net describes the network. It is a simple directed network with 20 nodes and 40 arcs.
• The partition Bonhoure-Cyclic.clu describes the partition into periodic components.
• The double vector Bonhoure-XY.vec provides the (x,y) coordinates for the picture with components.

This is a drawing of Bonheure.net

bonheure1.svg

in this is a drawing considering the partition Bonhoure-Cyclic.clu and the vector Bonhoure-XY.vec

bonheure2.svg

The file bonheure.zip contains besides bonheure.paj also bonheure.ini (settings for drawing) and pictures bonheure1.svg and bonheure.svg.

• bonheure.paj
• bonheure.zip: bonheure.paj, bonheure.ini, bonheure1.svg, bonheure2.svg

In the theory of finite Markov chains …

• 1993: published paper [1]
• 6. December 2003: Vladimir Batagelj - Pajek input file
• 5. August 2014: Vladimir Batagelj - documentation, included in Pajek networks

1. François Bonhoure, Yves Dallery, William J. Stewart: Algorithms for Periodic Markov Chains. Linear Algebra, Markov Chains, and Queueing Models. The IMA Volumes in Mathematics and its Applications Volume 48, 1993, pp 71-88. Springer, Postscript

Unknown.