Skip to main content

Table 3 An experimental analysis of \(C_v\), \(C_n\), and \(C_s\) costs in BA Graphs

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

Method

Selecting hubs (top \(5\%\))

Selecting full graph

\({C_v}\)

\({C_n}\)

\({C_s}\)

\({C_v}\)

\({C_n}\)

\({C_s}\)

RV

23,061

3979

35,251

4000

RN

6351

6351

2464

300,857

300,857

4000

\(RV\!N\)

4837

4837

3404

24,531

24,530

4000

RkN\(k=1\) (RN)

6351

6351

2464

300,857

300,857

4000

RkN\(k=2\)

3166

6331

2463

139,021

278,040

4000

RkN\(k=3\)

2191

6571

2493

94,175

282,519

4000

RkN\(k=6\)

1497

6421

2590

48,621

208,456

4000

RkN\(k=7\)

1481

6663

2653

40,491

182,306

4000

RkN\(k=8\)

1420

6637

2661

34,483

161,077

4000

RkN\(k=\infty\)

1204

7205

2867

10,559

63,310

4000

\(RV\!kN\)\(k=1\) \((RV\!N)\)

4837

4837

3404

24,531

24,530

4000

\(RV\!kN\)\(k=2\)

2807

5613

3138

20,994

41,987

4000

\(RV\!kN\)\(k=3\)

1880

5638

2931

18,700

56,096

4000

\(RV\!kN\)\(k=6\)

1450

6212

2965

14,268

61,185

4000

\(RV\!kN\)\(k=7\)

1379

6203

2969

13,419

60,434

4000

\(RV\!kN\)\(k=8\)

1365

6376

2995

12,844

60,006

4000

\(RV\!kN\)\(k=\infty\)

1118

6694

3054

7951

47,650

4000