ARP	Average Return Probability.
CTQW	Continuous-Time Quantum Walks.
DOS	Density of States.
GDM	Gaussian Disorder Model.
MA	Miller–Abrahams.
NS	Network Science.
ODS	Organic Disordered Semiconductor
OFET	Organic Field-Effect Transistors.
OLED	Organic Light-Emitting Diodes.
OS	Organic Semiconductors.
OTFT	Organic Thin-Film Transistors.
QT	Quantum Transport.
RGG	Random Geometric Graph.
RN	Random Network.
RW	Random Walk.
SW	Small-World.
SWP	Small-World Propensity.
SN	Spatial Networks.
TE	Transport Energy.
VRH	Variable-Range Hopping.
Symbol	Definition or Meaning
$\mathbf{A}$	Adjacency matrix of a graph $\mathcal{G}$.
$a_{ij}$	Element of the adjacency matrix $\mathbf{A}$
$\mathbf{D}$	Node degree matrix: $\mathrm{diag}(k_1,\cdots ,k_N)$. It is the diagonal matrix formed from the nodes degrees.
$d_E(i,j)$	Euclidean distance between any pair of nodes i and j in a network.
$d_{ij}$	Distance between two nodes i and j. It is the length of the shortest path (geodesic path) between them, that is, the minimum number of links when going from one node to the other.
$E_F$	Fermi level.
${\epsilon }_i$	Energy of state i.
${\epsilon }_T$	Transport energy.
${\eta }_{HT}$	Hopping transport efficiency.
$\mathcal{G}$	Graph $\mathcal{G}\equiv \mathcal{G}(\mathcal{N},\mathcal{L},\mathbf{W})$, where $\mathcal{N}$ is the set of nodes ($\mathrm{card}\left(\mathcal{N}\right)=N$), $\mathcal{L}$ is the set of links, and $\mathbf{W}$ is weighted adjacency matrix that emerges from our method to link formation.
${\gamma }_0$	Attempt-to-escape frequency.
${\mathsf{\Gamma }}_{ij}$	Miller–Abrahams hopping rate between states i and j.
$|i\rangle$	Ket vector in the Hilbert space $\mathcal{H}$. It corresponds to the electron wave function in nanostructure (≡ site ≡ node ≡ ket) i.
$\langle i|$	Bra vector in the dual space corresponding to the ket $|i\rangle$ $\in \mathcal{H}$
$\langle k\rangle$	Average node degree.
$k_{B}T$	Thermal energy.
$k_i$	Degree of a node i. It is the number of links connecting i to any other node.
ℓ	Average path length of a network. It is the mean value of distances between any pair of nodes in the network.
$\mathcal{L}$	Set of links (edges) of a network (graph).
$\mathbf{L}$	Laplacian matrix of a graph $\mathcal{G}$.
M	Size of a graph $\mathcal{G}$. It is the number of links in the set $\mathcal{L}$.
$\mu$	Carrier hopping mobility.
${\mu }_{0,LCC}^{*}$	Carrier hopping mobility at low temperature and low carrier concentration.
n	Carrier concentration.
N	Order of a graph $\mathcal{G}=(\mathcal{N},\mathcal{L})$. It is the number of nodes in set $\mathcal{N}$, that is the cardinality of set $\mathcal{N}$: $N=\left|\mathcal{N}\right|\equiv \mathrm{card}\left(\mathcal{N}\right)$.
$\mathcal{N}$	Set of nodes (or vertices) of a graph.
$N_S$	Site concentration.
$p_{j\leftrightsquigarrow k}$	Probability for an electron to evolve between kets $|j\rangle$ and $|k\rangle$ in the time interval t.
$\overline{p}\left(t\right)$	Average return probability
$P\left(k\right)$	Probability density function giving the probability that a randomly selected node has k links.
$\sigma$	The energy scale of the Gaussian DOS.
$\mathbf{W}$	Weighted adjacency matrix.
${\xi }_{\mathrm{loc}}$	Carrier localization length.