RM_erdos: Generate a random stochastic matrix for a walk on an...
In RMAT: Random Matrix Analysis Toolkit

Description Usage Arguments Value Examples

An Erdos-Renyi Graph is a graph whose edges are connected ~ Bern(p). Hence, its transition matrix will have nonzero entries with that probability. So, we can alternatively think of the transition matrix for such walk as a stochastic matrix with parameterized sparsity.

1	RM_erdos(N, p)

`N`	number of dimensions of the square matrix
`p`	the probability two vertices are connected in an Erdos-Renyi graph.

A random stochastic matrix corrosponding to a walk on an Erdos-Renyi graph with probability p.

# Very sparse graph
P <- RM_erdos(N = 3, p = 0.2)

# Slightly sparse graph
P <- RM_erdos(N = 9, p = 0.6)

# Completely connected graph
P <- RM_erdos(N = 5, p = 1)