count_transitions

static ThomasFermi.count_transitions(numerics, G, stable_node)

Calculates the number of nearby transitions.

This is defined as the number of graph nodes adjacent to stable_node such that the incoming and outgoing weights between the nodes and stable_node are (close to) equal.

Parameters:

  • numerics (NumericsParameters) – Options for numeric calculations.

  • G (networkx.DiGraph) – A graph with tuple[int, …] nodes representing possible charge configurations. This graph is a Markov graph where edges represent the transition rates between possible configurations.

  • stable_node (tuple[int, ...]) – The node of G which has the greatest weight in the steady-state of the Markov graph.

Returns:

The number of transitions nearby in voltage-space.

Return type:

int