A Cost-Effective Smoothed Multigrid with Modified Neighborhood-Based Aggregation for Markov Chains

Figure 6

Graphs for small versions of random planar graph (a) and random planar graph, nonsymmetric (b). Black dots represent nodes, and light gray arrows represent bidirectional links. For (b), black arrows represent unidirectional links and triangles with “+” inside have a single link that was made unidirectional. For easier visualization, the graphs shown here have a more regular distribution of points than the actual points used to build the Markov chains.

(a)

(b)