Random walk on a graphSource:
random_walk() performs a random walk on the graph and returns the
vertices that the random walk passed through.
is the same but returns the edges that that random walk passed through.
The input graph, might be undirected or directed.
The start vertex.
The number of steps to make.
How to follow directed edges.
"out"steps along the edge direction,
"in"is opposite to that.
"all"ignores edge directions. This argument is ignored for undirected graphs.
What to do if the random walk gets stuck.
"return"returns the partial walk,
"error"raises an error.
The edge weights. Larger edge weights increase the probability that an edge is selected by the random walker. In other words, larger edge weights correspond to stronger connections. The ‘weight’ edge attribute is used if present. Supply ‘
NA’ here if you want to ignore the ‘weight’ edge attribute.
random_walk(), a vertex sequence of length
steps + 1
containing the vertices along the walk, starting with
random_edge_walk(), an edge sequence of length
the edges along the walk.
Do a random walk. From the given start vertex, take the given number of
steps, choosing an edge from the actual vertex uniformly randomly. Edge
directions are observed in directed graphs (see the
as well). Multiple and loop edges are also observed.
For igraph < 1.6.0,
random_walk() counted steps differently,
and returned a sequence of length
steps instead of
steps + 1.
This has changed to improve consistency with the underlying C library.
## Stationary distribution of a Markov chain g <- make_ring(10, directed = TRUE) %u% make_star(11, center = 11) + edge(11, 1) ec <- eigen_centrality(g, directed = TRUE)$vector pg <- page_rank(g, damping = 0.999)$vector w <- random_walk(g, start = 1, steps = 10000) ## These are similar, but not exactly the same cor(table(w), ec) #>  0.9623802 ## But these are (almost) the same cor(table(w), pg) #>  0.9999919