10 search results - page 1 / 2 » Sampling Regular Graphs and a Peer-to-Peer Network |
CPC
2007
13 years 4 months ago
2007
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...