About: Expander walk sampling

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In the mathematical discipline of graph theory, the expander walk sampling theorem intuitively states that sampling vertices in an expander graph by doing relatively short random walk can simulate sampling the vertices independently from a uniform distribution.The earliest version of this theorem is due to , and the more general version is typically attributed to .

Property Value
dbo:abstract
  • In the mathematical discipline of graph theory, the expander walk sampling theorem intuitively states that sampling vertices in an expander graph by doing relatively short random walk can simulate sampling the vertices independently from a uniform distribution.The earliest version of this theorem is due to , and the more general version is typically attributed to . (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 6245532 (xsd:integer)
dbo:wikiPageLength
  • 8850 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1093377015 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In the mathematical discipline of graph theory, the expander walk sampling theorem intuitively states that sampling vertices in an expander graph by doing relatively short random walk can simulate sampling the vertices independently from a uniform distribution.The earliest version of this theorem is due to , and the more general version is typically attributed to . (en)
rdfs:label
  • Expander walk sampling (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License