### Navigation

- index
- modules |
- modules |
- next |
- previous |
- FNSS 0.6.1 documentation »
- API Reference »
- Functions »

# fnss.topologies.randmodels.erdos_renyi_topology

`erdos_renyi_topology`(n, p, seed=None, fast=False)

  Return a random graph (Erdos-Renyi graph, binomial graph).

  Chooses each of the possible edges with probability p.

  Parameters: | n : int The number of nodes. p : float Probability for edge creation. seed : int, optional Seed for random number generator (default=None). fast : boolean, optional Uses the algorithm proposed by [R20], which is faster for small p

  References

  [R18] | Erdos and A. Renyi, On Random Graphs, Publ. Math. 6, 290 (1959).

  [R19] | Gilbert, Random Graphs, Ann. Math. Stat., 30, 1141 (1959).

  [R20] | (1, 2) Vladimir Batagelj and Ulrik Brandes, “Efficient generation of large random networks”, Phys. Rev. E, 71, 036113, 2005.

### Navigation

- index
- modules |
- modules |
- next |
- previous |
- FNSS 0.6.1 documentation »
- API Reference »
- Functions »