This set of graph games creates graphs directly through sampling of different attributes, topologies, etc. The nature of their algorithm is described in detail at the linked igraph documentation.
play_degree(out_degree, in_degree = NULL, method = "simple") play_dotprod(position, directed = TRUE) play_fitness(m, out_fit, in_fit = NULL, loops = FALSE, multiple = FALSE) play_fitness_power( n, m, out_exp, in_exp = -1, loops = FALSE, multiple = FALSE, correct = TRUE ) play_gnm(n, m, directed = TRUE, loops = FALSE) play_gnp(n, p, directed = TRUE, loops = FALSE) play_geometry(n, radius, torus = FALSE) play_erdos_renyi(n, p, m, directed = TRUE, loops = FALSE)
The degrees of each node in the graph
The algorithm to use for the generation. Either
The latent position of each node by column.
Should the resulting graph be directed
The number of edges in the graph
The fitness of each node
Are loop edges allowed
Are multiple edges allowed
The number of nodes in the graph.
Power law exponent of degree distribution
Use finite size correction
The probabilty of an edge occuring
The radius within which vertices are connected
Should the vertices be distributed on a torus instead of a plane
A tbl_graph object
play_degree(): Create graphs based on the given node degrees. See
play_dotprod(): Create graphs with link probability given by the
dot product of the latent position of termintating nodes. See
play_fitness(): Create graphs where edge probabilities are
proportional to terminal node fitness scores. See
play_fitness_power(): Create graphs with an expected power-law degree
play_gnm(): Create graphs with a fixed edge count. See
play_gnp(): Create graphs with a fixed edge probability. See
play_geometry(): Create graphs by positioning nodes on a plane or
torus and connecting nearby ones. See
plot(play_erdos_renyi(20, 0.3)) #> Warning: `play_erdos_renyi()` was deprecated in tidygraph 1.3.0. #> ℹ Please use `play_gnp()` instead.