Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5420762> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Q5420762 subject Q7690716.
- Q5420762 abstract "In the mathematical discipline of graph theory, the expander walk sampling theorem states that sampling vertices in an expander graph by doing a random walk is almost as good as sampling the vertices independently from a uniform distribution.The earliest version of this theorem is due to Ajtai, Komlós & Szemerédi (1987), and the more general version is typically attributed to Gillman (1998).".
- Q5420762 wikiPageExternalLink gillman98chernoff.html.
- Q5420762 wikiPageExternalLink 1028903453.
- Q5420762 wikiPageWikiLink Q1304193.
- Q5420762 wikiPageWikiLink Q131476.
- Q5420762 wikiPageWikiLink Q132095.
- Q5420762 wikiPageWikiLink Q3115527.
- Q5420762 wikiPageWikiLink Q3574718.
- Q5420762 wikiPageWikiLink Q395.
- Q5420762 wikiPageWikiLink Q49906.
- Q5420762 wikiPageWikiLink Q49908.
- Q5420762 wikiPageWikiLink Q583461.
- Q5420762 wikiPageWikiLink Q625303.
- Q5420762 wikiPageWikiLink Q7690716.
- Q5420762 wikiPageWikiLink Q776602.
- Q5420762 wikiPageWikiLink Q856741.
- Q5420762 wikiPageWikiLink Q8805.
- Q5420762 comment "In the mathematical discipline of graph theory, the expander walk sampling theorem states that sampling vertices in an expander graph by doing a random walk is almost as good as sampling the vertices independently from a uniform distribution.The earliest version of this theorem is due to Ajtai, Komlós & Szemerédi (1987), and the more general version is typically attributed to Gillman (1998).".
- Q5420762 label "Expander walk sampling".