Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q19892070> ?p ?o }
Showing triples 1 to 27 of
27
with 100 triples per page.
- Q19892070 subject Q5835305.
- Q19892070 subject Q6642900.
- Q19892070 subject Q7036092.
- Q19892070 subject Q7176701.
- Q19892070 abstract "In network science, a biased random walk on a graph is a time path process in which an evolving variable jumps from its current state to one of various potential new states; unlike in a pure random walk, the probabilities of the potential new states are unequal.Biased random walks on a graph provide an approach for the structural analysis of undirected graphs in order to extract their symmetries when the network is too complex or when it is not large enough to be analyzed by statistical methods. The concept of biased random walks on a graph has attracted the attention of many researchers and data companies over the past decade especially in the transportation and social networks.".
- Q19892070 wikiPageExternalLink baDiscEvaluatingQuality.pdf.
- Q19892070 wikiPageExternalLink WalkGraph.html.
- Q19892070 wikiPageExternalLink grams.pdf.
- Q19892070 wikiPageExternalLink 978-0-8176-4788-9.
- Q19892070 wikiPageWikiLink Q1140126.
- Q19892070 wikiPageWikiLink Q12483.
- Q19892070 wikiPageWikiLink Q141488.
- Q19892070 wikiPageWikiLink Q176645.
- Q19892070 wikiPageWikiLink Q2434424.
- Q19892070 wikiPageWikiLink Q255166.
- Q19892070 wikiPageWikiLink Q2715623.
- Q19892070 wikiPageWikiLink Q322212.
- Q19892070 wikiPageWikiLink Q4899215.
- Q19892070 wikiPageWikiLink Q5155065.
- Q19892070 wikiPageWikiLink Q5835305.
- Q19892070 wikiPageWikiLink Q6642900.
- Q19892070 wikiPageWikiLink Q7036092.
- Q19892070 wikiPageWikiLink Q7176701.
- Q19892070 wikiPageWikiLink Q7291998.
- Q19892070 wikiPageWikiLink Q856741.
- Q19892070 comment "In network science, a biased random walk on a graph is a time path process in which an evolving variable jumps from its current state to one of various potential new states; unlike in a pure random walk, the probabilities of the potential new states are unequal.Biased random walks on a graph provide an approach for the structural analysis of undirected graphs in order to extract their symmetries when the network is too complex or when it is not large enough to be analyzed by statistical methods. ".
- Q19892070 label "Biased random walk on a graph".