Table 2 An analysis of costs \(C_v\) and \(C_n\) in a star graph of n vertices
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]\) | |
RV | n | 0 | \(n \log n\) | 0 |
RN | \(n/(n-1)\) | \(n/(n-1)\) | \(n^2 \log n\) | \(n^2 \log n\) |
\(RV\!N\) | 1 | 1 | \(n \log n\) | \(n \log n\) |