Difference between revisions of "Random walk"

From Cohen Courses
Jump to navigationJump to search
(Created page with 'In the context of a graph, this is a [[category::method]] or a model that simulates a surfer's walking on the graph. The surfer will choose the next vertex of the graph based on …')
 
 
Line 5: Line 5:
 
== Relevant Papers ==
 
== Relevant Papers ==
  
{{#ask: [[UsesMethod::Pointwise mutual information]]
+
{{#ask: [[UsesMethod::Random walk]]
 
| ?AddressesProblem
 
| ?AddressesProblem
 
| ?UsesDataset
 
| ?UsesDataset
 
}}
 
}}

Latest revision as of 22:34, 1 October 2012

In the context of a graph, this is a method or a model that simulates a surfer's walking on the graph. The surfer will choose the next vertex of the graph based on the weight of the edge between the current vertex and the vertices linked to the current vertex.

More formal definition can be found here.

Relevant Papers