Contents Menu Expand Light mode Dark mode Auto light/dark mode
Reticula
Reticula
  • Installation
  • Quick Start
  • Networks and network types
  • Input/Output and interoperation
  • Randomness
  • Generating networks
    • Path graphs
    • Cycle graphs
    • Regular ring lattice
    • Square grid graphs
    • Complete graphs
    • Random Erdős–Rényi network
    • Random Barabási–Albert network
    • Random k-regular network
    • Random degree-sequence network
    • Random expected degree-sequence network
    • Random uniform hypergraphs
    • Fully-mixed temporal network
    • Link activation temporal network
  • Randomising networks
    • Event shuffling
    • Link Shuffling
    • Timeline Shuffling
  • Network operations
    • Subgraph operations
    • Add/Remove operations
    • Occupation operations
    • Cartesian product
    • Graph union
  • Algorithms
    • Vertex degrees
    • Graphicallity
    • Graph properties
    • Assortativity
    • Static network reachability
    • Temporal network reachability
    • Event graphs
  • Examples
    • Isotropic bond-percolation in G(n, p) networks
  • Citing Reticula
  • Bibliography
Back to top
Edit this page

Algorithms#

  • Vertex degrees
  • Graphicallity
  • Graph properties
  • Assortativity
  • Static network reachability
  • Temporal network reachability
  • Event graphs
Next
Vertex degrees
Previous
Graph union
Copyright © 2023
Made with Sphinx and @pradyunsg's Furo