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
    • Complete directed 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
    • Fully-mixed temporal network
    • Link activation temporal network
  • Randomising networks
    • Event shuffling
    • Link Shuffling
    • Timeline Shuffling
  • Network 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

Link Shuffling#

Link shuffling#

microcanonical_reference_models.link_shuffling(temporal_network, random_state)#
template<temporal_network_edge EdgeT, std::uniform_random_bit_generator Gen>
requires is_dyadic_v<EdgeT>
network<EdgeT> microcanonical_reference_models::link_shuffling(const network<EdgeT> &temp, Gen &generator)#

Produces a random shuffling of the temporal network where all events between two vertices are attributed to two randomly selected vertices from the original network. Equivalent to micocanonical reference model with the canonical name \(P[p_{\mathcal{L}}(\Theta)]\).

The set of vertices, timestamps, the number of events and the multiset of timelines are conserved.

Connected link shuffling#

microcanonical_reference_models.connected_link_shuffling(temporal_network, random_state)#
template<temporal_network_edge EdgeT, std::uniform_random_bit_generator Gen>
requires is_dyadic_v<EdgeT>
network<EdgeT> microcanonical_reference_models::connected_link_shuffling(const network<EdgeT> &temp, Gen &generator)#

Produces a random shuffling of the temporal network where all events between two vertices are attributed to two randomly selected vertices from the original network. As opposed to Link shuffling, this model preserves the pattern of (weak) connectivity in the static projection of the original graph, i.e., the static projection of the output would have the same set of (weakly) connected components as the input. Generalisation of the micocanonical reference model with the canonical name \(P[I_\lambda, p_{\mathcal{L}}(\Theta)]\) to temporal networks with directed and/or multi-component static projections.

In addition to the set of components of the static projection, the set of vertices, timestamps, the number of events and the multiset of timelines of the temporal network are conserved.

Topology-constrained link shuffling#

microcanonical_reference_models.topology_constrained_link_shuffling(temporal_network, random_state)#
template<temporal_network_edge EdgeT, std::uniform_random_bit_generator Gen>
requires is_dyadic_v<EdgeT>
network<EdgeT> microcanonical_reference_models::topology_constrained_link_shuffling(const network<EdgeT> &temp, Gen &generator)#

Produces a random shuffling of the temporal network where the events are shuffled by assigning new, uniformly random timetamps and moving it to a randomly selected link with a non-empty timeline. Equivalent to micocanonical reference model with the canonical name \(P[\mathcal{L}, E]\).

The set of vertices, total number of events and the static projection of the temporal network are conserved.

Next
Timeline Shuffling
Previous
Event shuffling
Copyright © 2023
Made with Sphinx and @pradyunsg's Furo
On this page
  • Link Shuffling
    • Link shuffling
      • microcanonical_reference_models.link_shuffling()
    • Connected link shuffling
      • microcanonical_reference_models.connected_link_shuffling()
    • Topology-constrained link shuffling
      • microcanonical_reference_models.topology_constrained_link_shuffling()