About: Biased random walk on a graph

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

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.

Property	Value
dbo: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. (en)
dbo:wikiPageExternalLink	http://homepages.laas.fr/gtredan/pdf/baDiscEvaluatingQuality.pdf http://www.renyi.hu/~simonyi/grams.pdf http://www.math.uah.edu/stat/markov/WalkGraph.html https://www.springer.com/birkhauser/mathematics/book/978-0-8176-4788-9
dbo:wikiPageID	44466971 (xsd:integer)
dbo:wikiPageLength	7529 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1091891621 (xsd:integer)
dbo:wikiPageWikiLink	dbc:Social_systems dbr:Betweenness_centrality dbc:Social_information_processing dbr:Social_network dbr:Social_network_analysis dbr:Graph_(discrete_mathematics) dbr:Statistics dbr:Community_structure dbr:Maximal_entropy_random_walk dbr:Travelling_salesman_problem dbc:Social_networks dbc:Network_theory dbr:Kullback–Leibler_divergence dbr:Network_science dbr:Random_walk dbr:Markov_chain dbr:Random_walk_closeness_centrality
dbp:wikiPageUsesTemplate	dbt:Primary_sources dbt:Reflist dbt:Short_description dbt:Network_Science
dct:subject	dbc:Social_systems dbc:Social_information_processing dbc:Social_networks dbc:Network_theory
gold:hypernym	dbr:Process
rdf:type	dbo:Election
rdfs: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. (en)
rdfs:label	Biased random walk on a graph (en)
owl:sameAs	freebase:Biased random walk on a graph yago-res:Biased random walk on a graph wikidata:Biased random walk on a graph https://global.dbpedia.org/id/ucEX
prov:wasDerivedFrom	wikipedia-en:Biased_random_walk_on_a_graph?oldid=1091891621&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Biased_random_walk_on_a_graph
is dbo:wikiPageRedirects of	dbr:Biased_Random_Walks_on_graph dbr:Biased_random_walk_on_graph
is dbo:wikiPageWikiLink of	dbr:Timeline_of_Polish_science_and_technology dbr:Biased_Random_Walks_on_graph dbr:Biased_random_walk_on_graph dbr:Maximal_entropy_random_walk dbr:Social_influence_bias
is foaf:primaryTopic of	wikipedia-en:Biased_random_walk_on_a_graph

This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License