Applied Network Science

Table 1 Frequency of the max-degree vertex being among the selected neighbors. n is the size of the graph, \(\mu\) is the average degree

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

	ER graphs				BA graphs
	\(\mu =4\)	\(\mu =10\)	\(\mu =16\)	\(\mu =30\)	\(\mu =4\)	\(\mu =10\)	\(\mu =16\)	\(\mu =30\)
Sampling 0.025n
\(n=500\)	.77	.72	.66	.65	.92	.87	.84	.82
\(n=1000\)	.8	.72	.68	.65	.95	.94	.91	.85
\(n=2500\)	.81	.74	.7	.64	.99	.98	.96	.92
\(n=5000\)	.84	.72	.72	.65	.99	.98	.96	.94
Sampling 0.05n
\(n=500\)	.78	.72	.70	.67	.96	.92	.86	.85
\(n=1000\)	.82	.74	.72	.68	.97	.95	.91	.88
\(n=2500\)	.84	.8	.72	.71	.98	.98	.96	.93
\(n=5000\)	.83	.75	.72	.68	.99	.98	.97	.95
Sampling 0.075n
\(n=500\)	.83	.73	.72	.66	.98	.93	.88	.88
\(n=1000\)	.83	.74	.73	.67	.98	.96	.95	.9
\(n=2500\)	.86	.76	.75	.69	.99	.98	.96	.94
\(n=5000\)	.87	.78	.72	.7	.99	.99	.98	.96
Sampling 0.1n
\(n=500\)	.82	.77	.72	.68	.98	.95	.9	.87
\(n=1000\)	.85	.75	.73	.71	.99	.96	.96	.93
\(n=2500\)	.85	.8	.73	.71	.99	.99	.98	.95
\(n=5000\)	.87	.81	.76	.67	1	.99	.99	.97

Back to article page