2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC) 2013
DOI: 10.1109/pccc.2013.6742788
|View full text |Cite
|
Sign up to set email alerts
|

Impact of sampling design in estimation of graph characteristics

Abstract: Abstract-Studying structural and functional characteristics of large scale graphs (or networks) has been a challenging task due to the related computational overhead. Hence, most studies consult to sampling to gather necessary information to estimate various features of these big networks. On the other hand, using a best effort approach to graph sampling within the constraints of an application domain may not always produce accurate estimates. In fact, the mismatch between the characteristics of interest and t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 30 publications
0
7
0
Order By: Relevance
“…In order to assess how representative the subset RepDKG is, we evaluated whether the sampled graph is able to preserve the distributions of several characteristic topological graph properties such as degree, path length and clustering coefficients (Ahmed, Neville & Kompella, 2011), (Cem, Tozal & Sarac, 2013). We have compared the statistics of our subgraph with the statistics of the subgraphs that are gained using a variety of sampling techniques such as Fire Forest Sampling (FFS) (Leskovec & Faloutsos, 2006), Snowball Sampling (SS) (Lee, Kim & Jeong, 2006) and Metropolis-Hastings Sampling (MHS) (Lu & Bressan, 2012).…”
Section: Experimental Evaluation Of the Proposed Modelmentioning
confidence: 99%
“…In order to assess how representative the subset RepDKG is, we evaluated whether the sampled graph is able to preserve the distributions of several characteristic topological graph properties such as degree, path length and clustering coefficients (Ahmed, Neville & Kompella, 2011), (Cem, Tozal & Sarac, 2013). We have compared the statistics of our subgraph with the statistics of the subgraphs that are gained using a variety of sampling techniques such as Fire Forest Sampling (FFS) (Leskovec & Faloutsos, 2006), Snowball Sampling (SS) (Lee, Kim & Jeong, 2006) and Metropolis-Hastings Sampling (MHS) (Lu & Bressan, 2012).…”
Section: Experimental Evaluation Of the Proposed Modelmentioning
confidence: 99%
“…Researchers have also studied the task of how to choose an effective sampling scheme, how to evaluate different sampling schemes for studying a particular estimation problem [33,70], and the impact of underlying graph structure and the studied graph property on the effectiveness of the sampling algorithms [73].…”
Section: Other Related Workmentioning
confidence: 99%
“…Moreover, designing more efficient algorithms and/or leveraging computing power are not always easily available [2,5,19] . Secondly, due to the limitations in data collection mechanism, contemporary graphs that are considered as complete graphs are not completely accessible and partially visible to the users [7,11] . One approach to overcome these features of contemporary graph-structured data collections is sampling , i.e., to sample a representative subgraph and exploit its characteristics.…”
Section: Introductionmentioning
confidence: 99%