Contents Menu Expand Light mode Dark mode Auto light/dark, in light mode Auto light/dark, in dark mode Skip to content
Reticula
Reticula
  • Home
  • 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
    • Node activation temporal network
  • Randomising networks
    • Static Network Link Shuffling
    • Temporal Network Link Shuffling
    • Event shuffling
    • Timeline Shuffling
  • Network operations
    • Subgraph operations
    • Add/Remove operations
    • Occupation operations
    • Cartesian product
    • Graph union
  • Algorithms
    • Vertex degrees
    • Edge degrees (orders)
    • Graphicallity
    • Graph properties
    • Assortativity
    • Static network reachability
    • Temporal network reachability
    • Event graphs
  • Examples
    • Isotropic bond percolation in G(n, p) networks
    • Basic static network exploration
    • Getting started with hypergraphs
    • Modifying networks the immutable way
    • Exploring temporal (hyper)networks
    • Spreading and reachability in temporal networks
  • Citing Reticula
  • Bibliography
Back to top
View this page
Edit this page

Examples¶

  • Isotropic bond percolation in G(n, p) networks
  • Basic static network exploration
  • Getting started with hypergraphs
  • Modifying networks the immutable way
  • Exploring temporal (hyper)networks
  • Spreading and reachability in temporal networks
Next
Isotropic bond percolation in G(n, p) networks
Previous
Event graphs
Made with Sphinx and @pradyunsg's Furo