Skip to main content

Table 4 An analysis of costs \(C_v\) and \(C_n\) in a star graph of n vertices for two-phase methods

From: Cost-based analyses of random neighbor and derived sampling methods

Method

Selecting center

Selecting all leaves

\({{\mathbb {E}}}\left[ C_v \right]\)

\({{\mathbb {E}}}\left[ C_n \right]\)

\({{\mathbb {E}}}\left[ C_v \right]\)

\({{\mathbb {E}}}\left[ C_n \right]\)

RN-RV

\(n/(n-1)\)

\(n/(n-1)\)

\(n \log n\)

0

\(RV\!N\)-RV

1

1

\(n \log n\)

0