Skip to main content

Table 2 Table of discrepancies M ⊺ U ( i , j , k ) = M ⊺ ( X ( i , j , k ) −X) for the 3-state Markov process. The discrepancy M ⊺ U ( 1 , 2 ) (marked by ∗) corresponds to reduced process X ( 1 , 2 ) projected onto the third component, which is the optimal two-edge-neglecting approximation of X for this example, in agreement with Schmandt and Galán [14]

From: Measuring Edge Importance: A Quantitative Analysis of the Stochastic Shielding Approximation for Random Processes on Graphs

M ⊺ U ( i , j , k )

∑ R k ′

Value

M ⊺ U ( 1 )

R 1

0.0417

M ⊺ U ( 2 )

R 2

0.0417

M ⊺ U ( 3 )

R 3

0.2917

M ⊺ U ( 4 )

R 4

0.2917

M ⊺ U ( 1 , 2 )

R 1 + R 2

0.0833*

M ⊺ U ( 3 , 4 )

R 3 + R 4

0.583

M ⊺ U ( 1 , 3 )

R 1 + R 3

0.3333

M ⊺ U ( 1 , 4 )

R 1 + R 4

0.3333

M ⊺ U ( 2 , 3 )

R 3 + R 3

0.3333

M ⊺ U ( 2 , 4 )

R 2 + R 4

0.3333

M ⊺ U ( 1 , 2 , 3 )

R 1 + R 2 + R 3

0.375

M ⊺ U ( 1 , 2 , 4 )

R 1 + R 2 + R 4

0.375

M ⊺ U ( 1 , 3 , 4 )

R 1 + R 3 + R 4

0.625

M ⊺ U ( 2 , 3 , 4 )

R 2 + R 3 + R 4

0.625