Navigability, Walkability, and Perspicacity Associated with Canonical Ensembles of Walks in Finite Connected Undirected Graphs—Toward Information Graph Theory

Abstract

Canonical ensembles of walks in a finite connected graph assign the properly normalized probability distributions to all nodes, subgraphs, and nodal subsets of the graph at all time and connectivity scales of the diffusion process. The probabilistic description of graphs allows for introducing the quantitative measures of navigability through the graph, walkability of individual paths, and mutual perspicacity of the different modes of the (diffusion) processes. The application of information theory methods to problems about graphs, in contrast to geometric, combinatoric, algorithmic, and algebraic approaches, can be called information graph theory. As it involves evaluating communication efficiency between individual systems’ units at different time and connectivity scales, information graph theory is in demand for a wide range of applications, such as designing network-on-chip architecture and engineering urban morphology within the concept of the smart city.

1. Introduction to Information Graph Theory

Real-world networking systems comprising functional units that interact with each other at different and disparate temporal and spatial scales are often metaphorically represented by finite connected undirected graphs [1]. In graph models, the vertices embody the system functional units, and the edges sketch the various interactions between these units. Graph models are useful for computer networking, sociology, urban morphology, smart city networks, chemistry, engineering, communication, logistics and management, security applications, etc., as they help us to answer the fundamental question about relations between the local and global properties of a networking system.

In our work, we assess the quality of these relations by using some information quantities at different graph connectivity scales, ranging from the connectivity between the nearest neighbors to the connectivity with respect to infinitely long paths available in the graph. The proposed information approach to the description of graph structures (which can be called information graph theory) may be especially useful for the assessment of communication efficiency between individual systems’ units at different time and connectivity scales.

One possible application of graph information theory is the design of network-on-chip (NoC), or network-based communications subsystems on an integrated circuit, most typically between semiconductor intellectual property cores schematizing various functions of the computer system in a system on a single chip [2]. (We profoundly thank our reviewer for pointing us at the possible NoC-related application of graph information theory.) NoCs provide the advantage of customized architecture, increased scalability, and bandwidth and come in many network topologies, many of which are still experimental [3].

The interconnections between multiple cores on a chip present a considerable influence on the performance and communication of the chip design regarding the throughput, end-to-end delay, and packet loss ratio. Based on the huge amount of supported heterogeneous cores, efficient communication between the associated processors has to be considered at all levels of system design to ensure global interconnection [4]. Although hierarchical architectures have addressed the majority of the associated challenges of the traditional interconnection techniques, the main limiting factor is scalability, and NoC has proven to be a promising solution. As communicating nodes require a routing algorithm for successful transmission of packets, it is important to design an NoC routing algorithm capable of providing less congested paths, better energy efficiency, and high scalability [5]. It is important to mention that the same choices of routing algorithms, when considered for more than one performance parameter of the network, do not yield expected results, since different applications exhibit different network performances for the same routing technique [6]. Fault-tolerant mapping and routing techniques at different levels of an NoC were surveyed in [7]. In [8], a method for choosing hierarchical coordinates and a greedy forwarding algorithm for path-finding were presented. Nevertheless, reliability is becoming a major concern in NoC design [7]. In particular, the accurate predictions of network packet latency, contention delay, and the static and dynamic energy consumption of the network are in demand [9].

Another evident application field of graph information theory is the study of urban morphology, i.e., urban forms and structures affecting sustainability and urban growth. Along with the spreading of new technologies and the availability of big data, cities are increasingly viewed not simply as places in space but as systems of networks and flows [10]. This became particularly evident in the concept of a smart city, as the synergy of architecture, technology, and the Internet of Things which enables the collection and data exchange of objects embedded with electronics, software, sensors, and network connectivity [11].

All above-mentioned research problems involve a variety of information quantities resolving uncertainty about evolution of some diffusion processes at different connectivity scales in a graph, and therefore the entire approach to graphs summarized in the present paper may be called information graph theory.

Thinking about transportation in networks—imagine the weekend pedestrian flow in a city downtown area—we may notice that some streets are more preferred by walkers than others. While some urban quarters are visited quite often, others seem to be excluded from the rest of urban fabric, as though being barricaded by invisible gates, literally turning the deserted city block into a ghetto. A widespread belief in the influence of the spatial organization of the built environment on the way people move through urban spaces and meet others by chance was common in architectural and urban thinking for centuries [12,13,14]. The dynamics of poverty areas in London studied over the past century in [15] has shown that the creation of poverty areas is ultimately a spatial process relating to spatial segregation and poverty. In order to quantify isolation by identifying the most and least probable paths through the areas with respect to a certain exploration strategy, in the present paper we put forward a concept of walkability.

Navigation focuses on locating a walker’s position with respect to known locations, traversed paths, and structural patterns in the environment [16]. In the probabilistic setting, navigability would represent a share of predictable information about the future location of a traveler given their walking history and the present location. The predictable information about the future location of a walker is obtained with the use of two major navigation strategies, known as path integration (which allows for keeping track of the position and heading while exploring a new space) and landmark-based piloting (re-calculating position of a traveler while in a familiar environment), working in concert during navigation in humans and animals [16].

Finally, as such a circumstance appears quite often in the context of science and technology, we may pose the following question: How long should one observe a networking system for the information collected to be enough to draw a reliable conclusion about its evolution in the long run? Of course, an answer to the above-posed question ultimately depends on the structural complexity of a system (that can often be represented by a graph), the dynamics of the processes in question, as well as on the chosen graph exploration strategy—all are difficult to quantify, in general. In the present paper, we call such a deep, penetrating discernment of the system’s nature and evolution perspicacity and discuss and quantify it in the framework of a proposed model.

In our work, we put forward a toy model, in which the questions of interest may receive quantitative answers. The role of a complex system will be played by a finite connected undirected graph providing a scene for isotropic and a variety of anisotropic diffusions, i.e., different types of random walks, forming the canonical statistical ensembles of walks defined in graphs (see Section 3). Uncertainty about the current state in Markov chains contains predictable (apparent uncertainty) and unpredictable (true uncertainty) information components: the conditional mutual information quantities among the past, present, and future states of the chain (see Section 2). The amount of predictable information can be viewed as a divergence between the ensemble average (defined with respect to the stationary distribution of random walks) and the time-average of walks describing the probability of observing a walker in a unit time of random walks. Consequently, the amount of uncertainty about the future location of random walkers in the graph that can be resolved by using the standard navigation strategies, such as path integration (based on the entire history of travels) and landmark-based piloting (based on the present location of the walker), can be viewed as a navigability potential of a node in the given graph structure with respect to the chosen exploration strategy (the type of diffusion process) (see Section 4). We call the opposite potential characterizing the amount of true uncertainty about the walker’s location in the graph strive, which is quantified as the expected exploration time of a node’s neighborhood by the given type of random walk (Section 4). Information flows associated with the diffusion processes in graphs (see Section 3 and Section 5) can be viewed as the stochastic point processes, called determinantal process or fermionic processes [17], because the corresponding densities are the squared wedge-products (determinants) of eigenvectors of the symmetrized transition matrices. We use the properties of the determinantal processes to assess perspicacity and walkability in graphs (see Section 3 and Section 5). The perfect perspicacity is possible only for the processes that enjoy the same type of symmetry. In Section 6, we discuss an example of the walkability analysis in urban neighborhoods and, eventually, conclude on a discussion of graph information theory and its applications in the last section.

2. Predictable and Unpredictable Information in Markov Chains

The resolution of uncertainty about future events is known as information [18]. For example, each coin flip reveals a single bit of information. The side repeating probability $0\le p\le 1$ in the coin tossing sequence does not affect the amount of information released at every flip, but rather determines a share of predictable and unpredictable information components in every released bit of information [19,20,21,22]. Indeed, the forthcoming state of the Markov chain describing tossing of a biased coin is completely predictable for $p=1$ when coin tossing generates the stationary sequences heads, heads, heads,… or tails, tails, tails, …, as well as for $p=0$ when an alternating sequence of states arises. However, the side of the coin that will come up on the next toss is utterly unpredictable if $p=1/2$.

For a Markov chain $\left\{X_t\right\}$, $t\ge 0,$ defined over a finite set of N states by a (stationary) irreducible, row-stochastic transition probability matrix $Pr\left(\left.X_{t+1}=j\right|X_t=i\right)=T_{ij}\ge 0$, the expected amount of uncertainty about a state over infinitely long sequences is given by the Boltzmann–Gibbs–Shannon entropy [20,22,23,24],

$$H\left(X_t\right)=-\sum _{k=1}^N{\pi }_k{log}_N{\pi }_k,$$

(1)

where ${\pi }_k=Pr(X_t=k)$ is a stationary distribution of states over the chain, i.e., the left eigenvector of the Markov chain transition matrix, $\pi T=\pi ,$ belonging to the major eigenvalue 1. In all information-related calculations, we shall assume that $0·log0=log{0}^0=log1=0.$ As the information shared between the past and future in Markov chains is transmitted only through the present, the time average of the conditional entropy of the present state conditioned on all past states simplifies to the entropy rate [19,22,25,26], viz.,

$$\underset{\tau \to \infty }{lim}\frac{1}{\tau }\sum _{t=1}^{\tau }H\left(X_t|X_{t-1},\dots X_1\right)=H\left(X_{t+1}|X_t\right)=-\sum _{k=1}^N{\pi }_k\sum _{s=1}^N{T}_{ks}{log}_N{T}_{ks}.$$

(2)

Then, the following formal decomposition involving one-step conditional entropies [19,20,21,22],

$$\begin{array}{cc}H\left(X_t\right)\hfill & =\underset{\mathrm{Predictable}\mathrm{component}}{\underbrace{\stackrel{I\left(X_{t+1}|X_t\right)}{\overbrace{\left(H\left(X_t\right)-H\left(X_{t+1}|X_t\right)\right)}}+\stackrel{I\left(X_{t+1},X_t|X_{t-1}\right)}{\overbrace{\left(H\left(\left.X_{t+1}\right|X_{t-1}\right)-H\left(\left.X_t\right|X_{t-1}\right)\right)}}}}\hfill \\ \hfill & +{\displaystyle \underset{\mathrm{Unpredictable}\mathrm{component}}{{\displaystyle \underbrace{\stackrel{H\left(X_t|X_{t+1},X_{t-1}\right)}{\overbrace{\left(H\left(\left.X_{t+1}\right|X_t\right)+H\left(\left.X_t\right|X_{t-1}\right)-H\left(\left.X_{t+1}\right|X_{t-1}\right)\right)}}}}}},\hfill \end{array}$$

(3)

represents the state’s uncertainty as a sum of the following three information components: (i) $I\left(X_{t+1}|X_t\right)$, expressing the amount of information about the future state that can be inferred from the entire past history of the chain, excepting for its present state; (ii) $I\left(X_{t+1},X_t|X_{t-1}\right)$, the mutual information between the future and present states of the chain, expressing the amount of information about the future state that can be inferred from the present state, independently of the past; and (iii) $H\left(X_t|X_{t+1},X_{t-1}\right)$, expressing the true uncertainty about the present state of the chain that cannot be resolved by observing the past history and that does not have repercussions for the future evolution of the chain. Assuming that all past states and the present state of the chain are known, we conclude that the first two quantities contribute to the predictable information component of the chain, viz.,

$$\mathcal{P}\left(X_t\right)\equiv I\left(X_{t+1}|X_t\right)+I\left(X_{t+1},X_t|X_{t-1}\right),$$

(4)

while the last term quantifies the ephemeral, unpredictable information component, viz.,

$$\mathcal{U}\left(X_t\right)\equiv H\left(X_t|X_{t+1},X_{t-1}\right)=H\left(X_t\right)-\mathcal{P}\left(X_t\right),$$

(5)

which exists at the present moment only and then disappears without consequences [19,20].

The information diagram for a Markov chain is shown in Figure 1. In the context of Markov chains, we may interpret or explain a future event either as a consequence of history, or as an immediate outcome of the present event. However, for $0<p<1$, some amount of uncertainty remains unresolved before the event occurs, and such a surprise cannot be avoided, eliminated, or controlled. Given the Markov chain transition matrix T, the entropy excess $I\left(X_{t+1}|X_t\right)$ [19,20,21,22,27,28,29] reads as follows:

$$I\left(X_{t+1}|X_t\right)=-\sum _{k=1}^N{\pi }_k\left({log}_N{\pi }_k-\sum _{s=1}^N{T}_{ks}{log}_N{T}_{ks}\right).$$

(6)

The conditional mutual information $I\left(X_{t+1},X_t|X_{t-1}\right)$ between the present and the future states of the chain conditioned on the past state takes the following form [19,20,21,22]:

$$I\left(X_{t+1},X_t|X_{t-1}\right)=\sum _{k=1}^N{\pi }_k\sum _{r=1}^N\left(T_{kr}{log}_N{T}_{kr}-T_{kr}^2{log}_N{T}_{kr}^2\right).$$

(7)

The conditional mutual information (7) quantifies a consequence of the present state for the future evolution of the Markov chain. Finally, the amount of true uncertainty existing only at the present moment of time is the entropy residue [19,20,21,22], viz.,

$$\begin{array}{ccc}H\left(X_t|X_{t+1},X_{t-1}\right)\hfill & =& H\left(X_t\right)-I\left(X_{t+1}|X_t\right)-I\left(X_{t+1},X_t|X_{t-1}\right)\hfill \\ \hfill & =& -\sum _{k=1}^N{\pi }_k·{log}_2\left[\prod _{s=1}^N{\left(T_{ks}^2\right)}^{-T_{ks}^2}\right].\hfill \end{array}$$

(8)

For example, let us consider three games of chance shown in Figure 2a–c having $N=2,3,$ and 4 states, respectively. The probability of repeating a state in each game is taken as $0\le p\le 1$. Other transitions are chosen to be equiprobable. For entropy calculations in this section, we use the N-based logarithm ${log}_N$, so that the information and entropy quantities for these games of chance are measured in bits, trits, and quadrits, respectively. Namely, a single bit of information is released at every coin flip (see Figure 2a); one trit of information is produced at every round of the rock–paper–scissors game (see Figure 2b); and one quadrit of information is brought about at every round of the card suit game of four states (see Figure 2c). The use of different information units allows for comparing the structure of information components for all three games in a single frame (as shown in Figure 3). Otherwise, the graphs would scale up by ${log}_{2}3\approx 1.585$ and ${log}_{2}4=2$ if we used bits as a major information unit. The detailed information analysis of a two-state Markov chain shown in Figure 2a has been developed by us in [20], and in [30] we discussed information components in a three-state chain (Figure 2b). The four-state chain shown in Figure 2c has never before been discussed.

The information components (6–8) for all three games shown in Figure 2 are presented in Figure 3 as functions of the state repetition probability p. In Figure 3a, the predictable information components in a coin tossing game (see Figure 2a) are indicated by the solid line, and the graph regions representing the predictable information components $I\left(X_{t+1}|X_t\right)$ and $I\left(X_{t+1},X_t|X_{t-1}\right)$ are highlighted in blue and yellow, respectively.

The future outcome of coin tossing is reliably predictable for $p=0$ or $p=1$ when the game generates the stationary alternating or constant sequences of states, respectively. In this case, the entire uncertainty of a state equals the entropy excess (blue in Figure 3a), viz., 1 bit $\equiv H\left(X_t\right)=I\left(X_{t+1}|X_t\right).$ As $p>0$ or $p<1$, the reliability of predictions based on the past history of the chain decays; however, the future outcome may then be guessed from the present state of the coin alone, either by alternating the present side of the coin at the next tossing (for $p>0$), or by repeating it (for $p<1$). The corresponding amount of information, $I\left(X_{t+1},X_t|X_{t-1}\right),$ quantifying the degree of reliability of such a guess, is highlighted by yellow in Figure 3a. When $p\approx 1/2$, there is a destructive interference between two incompatible hypotheses about the future outcome of coin tossing that causes the gradual attenuation and cancellation of mutual information, $I\left(X_{t+1},X_t|X_{t-1}\right)$, and the coin becomes fair at $p=1/2$. At this moment, the entire uncertainty of a state equals the amount of true uncertainty quantified by $H\left(X_t|X_{t+1},X_{t-1}\right)$ [20]. Summing the predictable information components together, we obtain the amount of predictable information about the future outcome of coin tossing as a function of p, shown in Figure 3b as a solid line. The coin tossing game (see Figure 2a) is predictable at $p=0$ and $p=1$, but unpredictable at $p=1/2$ when the coin is fair.

The information components for other games of chance (Figure 2b,c) are presented in Figure 3a,b by the dotted and dashed lines. The rock–paper–scissors game (Figure 2b) becomes fair at $p=1/3$, and the relevant information components are shown as dotted lines. The model of a three-sided coin (susceptible–infected–immune) was recently used for assessing pandemic uncertainty on conditions of vaccination and self-isolation [30]. The card suit game (Figure 2c) is fair when $p=1/4$, as shown by the dashed lines in Figure 3a,b. In contrast to the simple coin flipping game, other games of chance, having more possible states, are not completely predictable for $p=0$, as they retain a certain degree of uncertainty of symbols in the alternating sequences of chain states.

3. Symmetries and Statistical Ensembles of Walks in Finite Connected Undirected Graphs

A finite connected undirected graph $G(V,E)$, in which V, $\left|V\right|=N$, is a set of vertices and $E\subseteq V\times V$ is a set of edges, is defined by a symmetric adjacency matrix, $A=A^{†}$, such that $A_{ij}=1$, iff $\left(i,j\right)\in E$, but $A_{ij}=0$ otherwise. The adjacency matrix allows for the following spectral decomposition: $A_{ij}={\sum }_{s=1}^N{\alpha }_s{u}_{is}{u}_{sj},$ in which ${\left\{{\mathbf{u}}_i\right\}}_{i=1}^N$ is an orthogonal system of eigenvectors belonging to the ordered real eigenvalues ${\alpha }_{max}\equiv {\alpha }_1>{\alpha }_2\ge \cdots \ge {\alpha }_N$, where ${\alpha }_{max}$ is simple according to the Perron–-Frobenius theorem [31].

Graph symmetries: Multiple eigenvalues of the adjacency matrix indicate the presence of non-identity automorphisms in the graph G [19,32,33,34,35,36]. A group of a graph’s automorphisms $\mathrm{Aut}\left(G\right)$ preserving the graph structure is formed by all permutations $\Pi \in \mathcal{P}\left(V\right)$ defined on the set of graph vertices V that commute with the graph adjacency matrix, $[A,\Pi ]\equiv A\Pi -\Pi A=0$ [19,32,34]. If a non-identical $\Pi \in \mathrm{Aut}\left(G\right)$ exists, and $\mathbf{u}$ is an eigenvector of the adjacency matrix, such that $A\mathbf{u}={\alpha }_u\mathbf{u},$ then the vector $\mathbf{v}=\Pi \mathbf{u}$ is another eigenvector of A belonging to the same eigenvalue ${\alpha }_u$, as ${\alpha }_u\mathbf{v}=\Pi {\alpha }_u\mathbf{u}=\Pi A\mathbf{u}=A\Pi \mathbf{u}=A\mathbf{v}$. An automorphism associated with some eigenvalue $\alpha$ of multiplicity $m_{\alpha }\le (N-1)$ is represented by a low-dimensional $m_{\alpha }\times m_{\alpha }$ real orthogonal submatrix corresponding to the related block of a permutation matrix. As the eigenvectors of a symmetric adjacency matrix are real and mutually orthogonal, $(\mathbf{u},\mathbf{v})=(\mathbf{u},\Pi \mathbf{u})=0$, it also follows that elements of these eigenvectors are $\{0,\pm 1\}$ mapped to each other under the action of $\Pi \in \mathrm{Aut}\left(G\right)$. For example, the major (Perron) eigenvector $\langle 1,1,1\rangle$ of the adjacency matrix of a triangle graph belongs to the maximum eigenvalue ${\alpha }_{max}=2$, while another, double eigenvalue ${\alpha }_{2,3}=-1$ corresponds to the eigenvectors $\langle -1,1,0\rangle$ and $\langle -1,0,1\rangle$ mapped to each other by a simple 2-permutation.

Microcanonical ensemble of walks: The microcanonical ensemble of walks (MCE) is a collection of n-walks in G taken with the same probability $P_n\equiv exp\left(F_n/kT\right)$ for all walks of the same length n, in which the (Boltzmann constant and) temperature $kT\equiv 1/ln2$, and the free energy of n–walks is defined by the logarithm of the number of n-walks available in the graph $G,$ $F_n\equiv {log}_2{\sum }_{ij}{A}_{ij}^n$. For very long walks, $n\gg 1$, $A_{ij}^n\approx {\gamma }_1^2{\alpha }_{max}^n$, where ${\gamma }_1\equiv {\sum }_{i=1}^N{u}_{i1}$, and therefore the intensive free energy (per edge absorbed by a very long MCE walk) equals the graph topological entropy [21,22,37], viz.,

$$\mu \equiv \underset{n\to \infty }{lim}\frac{F_n}{n}={log}_2{\alpha }_{max}.$$

(9)

Canonical ensemble of walks: In the canonical ensembles of walks (CNE) defined on G, each of ${\kappa }_i^{\left(n\right)}\equiv {\sum }_{j=1}^N{\left(A^n\right)}_{ij}$ walks of length n available from every node $i\in V$ are taken with equal probability. As ${\kappa }_i^{\left(n+1\right)}={\sum }_{j=1}^N{A}_{ij}{\kappa }_j^{\left(n\right)}$, the CNE walks are defined by the following irreducible row-stochastic transition matrices [19,21,22]:

$$W_{ij}^{\left(n\right)}=\frac{A_{ij}{\kappa }_j^{\left(n\right)}}{{\kappa }_i^{\left(n+1\right)}},{\kappa }_i^{\left(0\right)}=1,\sum _{j=1}^N{W}_{ij}^{\left(n\right)}=1,n\in \mathbb{N}.$$

(10)

The CNE walks $W_{ij}^{\left(n\right)}$ are the random walks defining the following stationary distributions (centrality measures [21,22]) of nodes:

$${\pi }_i^{\left(n\right)}=\frac{{\kappa }_i^{\left(n\right)}{\kappa }_i^{\left(n-1\right)}}{{\sum }_{s=1}^N{\kappa }_s^{\left(n\right)}{\kappa }_s^{\left(n-1\right)}},\sum _{s=1}^N{\pi }_r^{\left(n\right)}{W}_{rs}^{\left(n\right)}={\pi }_s^{\left(n\right)}.$$

(11)

In particular, the locally isotropic first order random walks, in which a random walker chooses a node to visit with equal probability among all available nearest neighbors, $W_{ij}^{\left(1\right)}=A_{ij}/{\kappa }_i^{\left(1\right)},$ defines the well-known stationary distribution of nodes (degree centrality), viz., ${\pi }_i^{\left(1\right)}={\kappa }_i^{\left(1\right)}/2\left|E\right|$ [19,21,22]. For $n\to \infty$, ${\kappa }_i^{\left(n\right)}\approx {\alpha }_{max}^n{\gamma }_1{u}_{i1}$, so that the series of transition matrices converges to the Ruelle–Bowen random walk [38], viz.,

$$W_{ij}^{\left(\infty \right)}=\underset{n\to \infty }{lim}\frac{A_{ij}{\kappa }_j^{\left(n\right)}}{{\kappa }_i^{\left(n+1\right)}}=\frac{A_{ij}{u}_{j1}}{{\alpha }_{max}{u}_{i1}},$$

(12)

with a stationary distribution ${\pi }_i^{\left(\infty \right)}=u_{i1}^2$ [39] that is related to the eigenvector centrality of nodes [40].

Grand canonical ensemble of walks: Finally, the grand canonical ensemble of walks (GCE) describes the statistics of “fluctuations” of the local growth rate of the number of walks available at the node ${log}_2{\kappa }_i^{\left(n\right)}$ over a “chemical potential” $n\mu$ of the equiprobable n-walks in the graph G, viz.,

$${\mathcal{P}}_i^{\left(n\right)}\propto exp\left(\frac{n\mu -{log}_2{\kappa }_i^{\left(n\right)}}{kT}\right).$$

(13)

In the thermodynamic limit of infinite walks $n\to \infty$, the exponential factor representing a node’s “fugacity” takes the following form [22]:

$$\underset{n\to \infty }{lim}exp\left(\frac{n\mu -{log}_2{\kappa }_i^{\left(n\right)}}{kT}\right)=\frac{1}{u_{i1}{\gamma }_1},{\gamma }_1\equiv \sum _{j=1}^N{u}_{j1}.$$

(14)

The limiting distribution of relative fugacity, describing the change of the system of infinitely long walks (free energy of walks) due to adding/removing a node, takes the form of a Fermi—Dirac distribution, viz.,

$${\mathcal{P}}_i=\underset{n\to \infty }{lim}{\mathcal{P}}_i^{\left(n\right)}=\frac{1}{1+u_{i1}{\sum }_{j\ne i}^N{u}_{j1}^{-1}},$$

(15)

typical for the distribution of fermions in a single-particle state i of the energy ${\epsilon }_i\equiv {log}_2\left(u_{i1}{\sum }_{j\ne i}^N{u}_{j1}^{-1}\right).$ The Fermi—Dirac distribution, previously observed only in a quantum system of non-interacting fermions, appears in the model due to the non-interacting quality of walks in the graph, similar to the Pauli exclusion principle allowing for only two possible microstates for each single-particle level [22].

Determinantal point processes associated with canonical ensembles of walks—Perspicacity: The CNE walks in a connected undirected graph define the determinantal point processes characterized by the probabilities of random currents calculated as the squared determinants of submatrices made up from the elements of eigenvectors of the symmetrized random walk transition matrices. These determinantal point processes provide the properly normalized probability distributions for all nodes, subgraphs, and nodal subsets at all time scales of the corresponding diffusion process [22]. Slater determinants in quantum mechanics [41] were historically the first examples of determinantal point processes that later acquired multiple applications in physics, applied mathematics, and statistics [42,43,44,45]. The symmetrization similarity transformation [19,22] makes the Markov matrix $W_{ij}^{\left(n\right)}$ into a symmetric form, ${\widehat{W}}_{ij}^{\left(n\right)}$, viz.,

$${\widehat{W}}_{ij}^{\left(n\right)}=\sqrt{\frac{{\kappa }_i^{\left(n\right)}}{{\kappa }_i^{(n+1)}}}{A}_{ij}\sqrt{\frac{{\kappa }_j^{\left(n\right)}}{{\kappa }_j^{(n+1)}}},{\kappa }_i^{\left(n\right)}\equiv \sum _{j=1}^N{\left(A^n\right)}_{ij}.$$

(16)

In the rest of this section, we omit the index $\left(n\right)$ in the symmetrized transition matrix (16) to simplify the notations. The determinantal point processes may be defined for any type of random walk, and the resulting probability distributions indeed vary for different n. The symmetrized transition matrix (16) can be written in a spectral form as follows: $\widehat{W}=\Phi \Lambda {\Phi }^{\top }$, in which $\Phi \in O\left(N\right)$ is an orthogonal matrix, $det\Phi \equiv \mathrm{Sgn}(\Phi )=\pm 1$, with columns being the orthonormal eigenvectors ${\varphi }_k:V\to S_1^{N-1}$ of the symmetrized transition matrix (16), and $\Lambda$ is a diagonal matrix of real valued, ordered eigenvalues of the transition matrix, $1={\lambda }_1>{\lambda }_2\ge \dots \ge {\lambda }_N\ge -1$. The repeating eigenvalues indicate the presence of symmetries in the diffusion process, and if ${\varphi }_k$ is an eigenvector of the symmetrized transition matrix (16) belonging to the multiple eigenvalue ${\lambda }_k$, then there exists a permutation matrix $\Pi$, such that $[\widehat{W},\Pi ]=0,$ and $\Pi {\varphi }_k$ is another eigenvector of $\widehat{W}$ belonging to the same eigenvalue ${\lambda }_k$. In the latter case, the symmetry may be represented by a low-dimensional real orthogonal submatrix in $\Phi$ corresponding to the related blocks of a permutation matrix.

As the dynamics of discrete time random walks evolves with powers of the corresponding transition matrix, the eigenvalues $0<\left|{\lambda }_k\right|<1,$ for $k>1,$ describe the rates of relaxation processes toward a stationary distribution over graph nodes belonging to the maximal eigenvalue ${\lambda }_1=1$. Herewith, the positive eigenvalues ${\lambda }_k>0$, $k>1$, describe the exponential decay of the relaxation processes (as $|{\lambda }_k|<1$), while the negative eigenvalues correspond to damped oscillations, and both fade away within the finite characteristic relaxation times ${\mathfrak{t}}_k=-1/ln\left|{\lambda }_k\right|$. The characteristic relaxation time of the stationary distribution is taken to be ${\mathfrak{t}}_1=\infty .$

The k-th order wedge products, ${\varphi }_{i_1}\wedge \dots \wedge {\varphi }_{i_k}$, are the determinants of the corresponding k-th order minors of the matrix $\Phi$. The properties of determinants of submatrices composed of orthonormal vectors were discussed in [19,46] in more detail. In particular, the squared determinants of the k-th order minors of the orthogonal matrix $\Phi$ define the properly normalized probability distributions over the index set $\{i_1,\dots ,i_k\}$, viz., ${\left|{\varphi }_{i_1}\wedge \dots \wedge {\varphi }_{i_k}\right|}^2=1.$ For example, the squared elements of the major eigenvector of the symmetrized transition matrix, ${\varphi }_1^2,$ can be considered the squared determinants of the primitive submatrices of size 1, determining the stationary distribution of random walks, viz., ${\varphi }_{1,i}^2\equiv {Pr}_{\infty }\left(i\right)={\pi }_i,$${\sum }_{i\in V}{\pi }_i=1.$ The corresponding probability ${Pr}_{\infty }\left(i\right)>0$ is interpreted as a measure of likeliness to observe a random walker at $i\in V$ in infinite observation time ${\mathfrak{t}}_1=\infty$. Other eigenvectors, ${\varphi }_k$, $k>1$, also enjoy the proper normalization, ${\varphi }_{k,i}^2\equiv {Pr}_{{\mathfrak{t}}_k}\left(i\right),$${\sum }_{i\in V}{Pr}_{{\mathfrak{t}}_k}\left(i\right)=1$, and therefore can be interpreted as the ephemeral probability distributions decaying in the finite characteristic time, ${\mathfrak{t}}_k<\infty$.

The squared wedge products, ${\left|{\varphi }_k\wedge {\varphi }_l\right|}^2=1,$ define the ephemeral probability distributions over pairs of nodes (not necessarily corresponding to graph’s edges) fostered by the modes ${\varphi }_k$ and ${\varphi }_l$ of the diffusion process, viz.,

$$\underset{{\mathfrak{t}}_k,{\mathfrak{t}}_l}{Pr}\left(i,j\right)\equiv {\left|\begin{array}{cc}{\varphi }_{k,i}& {\varphi }_{k,j}\\ {\varphi }_{l,i}& {\varphi }_{l,j}\end{array}\right|}^2,\sum _{i,j\in V}\underset{{\mathfrak{t}}_k,{\mathfrak{t}}_l}{Pr}\left(i,j\right)=1.$$

(17)

${Pr}_{{\mathfrak{t}}_k,{\mathfrak{t}}_l}\left(i,j\right)$, $i\ne j,$ may be interpreted as the joint probability mass functions (correlation functions) describing the probability amplitudes for a random walker to sojourn at the nodes i and j during the characteristic times ${\mathfrak{t}}_l$ and ${\mathfrak{t}}_k$. Using the properties of determinants, we may expand the probability mass function ${Pr}_{{\mathfrak{t}}_k,{\mathfrak{t}}_l}\left(i,j\right)$ into the joint probability of independent observations of the walker at i and j during the characteristic times ${\mathfrak{t}}_l$ and ${\mathfrak{t}}_k$, conditional on obviously incompatible events, such as the simultaneous presence of the random walker at two different nodes, viz.,

$$\begin{array}{ccc}{Pr}_{{\mathfrak{t}}_k,{\mathfrak{t}}_l}\left(i,j\right)\hfill & =\hfill & {\varphi }_{k,i}^2{\varphi }_{l,j}^2+{\varphi }_{k,j}^2{\varphi }_{l,i}^2-2{\varphi }_{k,i}{\varphi }_{k,j}{\varphi }_{l,j}{\varphi }_{l,i}\hfill \\ \hfill & =\hfill & {Pr}_{{\mathfrak{t}}_k}\left(i\right){Pr}_{{\mathfrak{t}}_l}\left(j\right)+{Pr}_{{\mathfrak{t}}_k}\left(j\right){Pr}_{{\mathfrak{t}}_l}\left(i\right)\hfill \\ \hfill & \hfill & -2\sqrt{{Pr}_{{\mathfrak{t}}_k}\left(i\right){Pr}_{{\mathfrak{t}}_l}\left(j\right){Pr}_{{\mathfrak{t}}_k}\left(j\right){Pr}_{{\mathfrak{t}}_l}\left(i\right)}.\hfill \end{array}$$

(18)

If $k=l$ and ${\lambda }_k$ and ${\lambda }_l$ are the simple eigenvalues, then the determinants in (17) equal zero for any i and j. Otherwise, if ${\varphi }_k$ and ${\varphi }_l$ belong to the same multiple eigenvalue, then ${Pr}_{{\mathfrak{t}}_k,{\mathfrak{t}}_l}\left(i,j\right)>0$ for i and j involved in permutations expressing the symmetry of the diffusion process. In the latter case, the vectors ${\varphi }_k$ and ${\varphi }_l$ are localized at the graph nodes that enjoy the symmetry, while other vector elements equal zero. As the absolute value of a determinant is nothing but the volume of the parallelogram spanned by two vectors, $\langle {\varphi }_{k,i},{\varphi }_{k,j}\rangle$ and $\langle {\varphi }_{l,i},{\varphi }_{l,j}\rangle$, for the determinant to be maximal, these vectors should be orthogonal to each other. The vectors ${\varphi }_k$ and ${\varphi }_l$ are mutually orthogonal in ${\mathbb{R}}^N$; however, many of their elements are zero (as corresponding to the block structure of the symmetry-related permutation matrix), and others are related to each other by permutation, so there may be $2\times 2$ orthogonal submatrices, for which the determinant (17) is maximal.

To evaluate the amount of mutual information that knowing either of the diffusion process mode described by the eigenvector ${\varphi }_l$ provides about the other one described by the eigenvector ${\varphi }_k$, we introduce the perspicacity matrix as the mutual information between the diffusion modes as follows:

$$I\left({\varphi }_k,{\varphi }_l\right)=\sum _{i,j\in V}{Pr}_{{\mathfrak{t}}_k,{\mathfrak{t}}_l}\left(i,j\right){log}_2\left(\frac{{Pr}_{{\mathfrak{t}}_k,{\mathfrak{t}}_l}\left(i,j\right)}{{Pr}_{\infty }\left(i\right){Pr}_{\infty }\left(j\right)}\right).$$

(19)

As all nodes’ densities are ${Pr}_{\infty }\left(i\right)>0$ in a connected graph, the mutual information (19) is a non-negative symmetric matrix having positive elements for every pair of different eigenmodes $k\ne l$, with the zero elements on the major diagonal, $k=l,$ due to the properties of the determinants. Herewith, the maximal perspicacity (mutual information) in (19) $I\left({\varphi }_k,{\varphi }_l\right)$ is obtained for the mutually orthogonal eigenvectors ${\varphi }_k$ and ${\varphi }_l$ belonging to the same multiple eigenvalues (if there are any) of Markov transition matrices (10), indicating the presence of symmetries in the diffusion processes. These symmetries depend on the chosen CNE walks (10), grounded in the structural symmetry of the graph (see Section 5 for an example).

Similarly, we may define the third- and higher-order correlation functions using the squared determinants of corresponding submatrices of $\Phi$.

4. Navigability and Strive with Different Exploration Strategies

Random walks of every type ($n\ge 1$) discussed in Section 3 introduce densities (11) over graph nodes playing the role of centrality measures [20] and defining quantitative measures of navigability for graph nodes. Frequently visited sites are predicted more efficiently than those that are little frequented, especially in the long run: the more frequent a node, the more predictable the navigator’s position visiting it [21]. The two major navigation strategies working in concert during wayfinding in humans [16,47] and animals [48,49]—landmark-based piloting and walk (path) integration—might be associated with the predictable information components (7) and (6) of the Markov chains, defined by the irreducible row-stochastic transition matrices $W^{\left(n\right)}$, $n\ge 1$, and by Equations (10) and (12), defining the CNE random walks on the graph G [21]. Namely, the (information) efficacy of the path integration strategy taking the entire walk history into account to infer the forthcoming navigator’s position cannot exceed the entropy excess $I\left(X_{t+1}|X_t\right)$ (6), and the efficacy of landmark-based piloting that uses the present location of the navigator to predict her forthcoming position can be assessed through the conditional mutual information between the present and future positions of the navigator, $I\left(X_{t+1},X_t|X_{t-1}\right)$ (7).

As discussed in [21], the predictable (4) and unpredictable information components of Equations (5) and (8), $\mathcal{P}\left(X_t\right)\equiv -{\sum }_{k=1}^N{\pi }_k{log}_2{\phi }_k$ and $\mathcal{U}\left(X_t\right)\equiv -{\sum }_{k=1}^N{\pi }_k{log}_2{\psi }_k$, have the same form as the entropy function, $-{\sum }_{k=1}^N{\pi }_k{log}_2{\pi }_k=H\left(X_t\right)=\mathcal{P}\left(X_t\right)+\mathcal{U}\left(X_t\right),$ where we have introduced

$${\phi }_k\equiv {\pi }_k·\prod _{s=1}^N{\left(W_{ks}^2\right)}^{W_{ks}^2},\mathrm{and}{\psi }_k\equiv \prod _{s=1}^N{\left(W_{ks}^2\right)}^{-W_{ks}^2},$$

(20)

the navigability and strive potentials of a node, such that ${\pi }_k={\phi }_k{\psi }_k$. The product factor in (20) has a form of time-average (the geometric mean) probability of the 2-step transition from k to s calculated over an infinitely long time of observation, viz.,

$$\underset{\tau \to \infty }{lim}\prod _{s=1}^N\sqrt[\tau ]{{\left(W_{ks}^2\right)}^{m_{k,·,s}\left(\tau \right)}}=\underset{\tau \to \infty }{lim}\prod _{s=1}^N{\left(W_{ks}^2\right)}^{\frac{m_{k,·,s}\left(\tau \right)}{\tau }}=\prod _{s=1}^N{\left(W_{ks}^2\right)}^{W_{ks}^2},$$

(21)

in which the number of 2-step transitions observed between the nodes k and s per time interval $\tau$, $m_{k,·,s}\left(\tau \right)/\tau$, tends to the $ks$-element of the squared transition matrix, $W_{ks}^2$, as $\tau \to \infty .$

Given that the probability of finding a random walker at k equals ${\pi }_k$, the navigability potential ${\phi }_k$ defined accordingly (20,21) can be interpreted as the probability that the node k is a 2-step precursor for other nodes in the graph (including k itself) at any moment of time. Consequently, the strive potential ${\psi }_k$ of the node k (as the inverse probability) may be interpreted as the expected time for the walker located at k to explore the entire 2-step neighborhood of the k-neighborhood’s exploration time: the more sizable the neighborhood, the longer its exploration time and the stronger the strive potential, reducing the amount of predictable information about the location of the random walker.

The navigability and strive potentials of a node depend on the node’s function in the graph structure, as well as on the chosen graph exploration strategy described by the random walks transition matrices $W_{ij}^{\left(n\right)}$ (10) for some $n\ge 1$. In Figure 4, we presented a buckle graph with nodes color-coded according to the node’s density, navigability, and strive potentials calculated for the different graph exploration strategies represented by the isotropic ($W_{ij}^{\left(1\right)}$) and maximally anisotropic ($W_{ij}^{(\infty )}$) random walks, respectively. Namely, in Figure 4a–c, the graph nodes are color-coded with respect to the quantities calculated for the isotropic, first-order walks, in which a random walker chooses the next node equiprobably over all nearest neighbors. The corresponding node density defined with respect to $W_{ij}^{\left(1\right)}$ (see Figure 4a) represents the node degree centrality: the better-connected nodes have a higher probability of hosting a random walker.

The navigability potential of nodes for the random walks $W_{ij}^{\left(1\right)}$ is shown in Figure 4b. The nodes that have fewer neighbors, as well as those connected to them (located on graph’s boundary), are easy to navigate by isotropic random walks. On the contrary, the location of a walker over the better-connected nodes located at the graph center is less predictable. Conversely, the strive potential of nodes with respect to the random walks $W_{ij}^{\left(1\right)}$ presented in Figure 4c is maximal for the central nodes of the graph (the longest neighborhood exploration time).

The node density with respect to the Ruelle–Bowen random walks of maximal anisotropy defined by the transition matrix $W_{ij}^{(\infty )}$ (12) corresponds to the square root of the node’s eigenvector centrality (see Figure 4d). The Ruelle–Bowen random walks are statistically confined to the graph center, hosting the lion’s share of available infinite paths but repelling from the graph boundaries. The confinement of anisotropic walks at the best structurally integrated part of the graph reveals itself by the fact that the magnitude of the node’s density at the graph center is as twice as high with respect to $W_{ij}^{(\infty )}$ than with respect to $W_{ij}^{\left(1\right)}$ and, vice versa, the Ruelle–Bowen random walkers are less probably found on the graph’s boundaries than those following isotropic random walks.

The navigability potential of nodes with respect to Ruelle–Bowen random walks $W_{ij}^{(\infty )}$ presented in Figure 4e is dominated by the node’s density for anisotropic walks (the square root of the node’s eigenvector centrality) and enhanced by the effect of their confinement at the graph center. The appearance of anisotropic walks in the central part of the graph is more predictable than that on the graph boundary.

In contrast to isotropic random walks, the strive potential of nodes with respect to the Ruelle–Bowen random walks $W_{ij}^{(\infty )}$ is highest over the ring of five central nodes of the graph (see Figure 4f). The neighborhood exploration time of the center by the Ruelle–Bowen random walks slightly exceeds five (steps), indicating that these walks are indeed statistically confined within the central ring.

In Figure 5a,b, we contrasted the navigability potentials of nodes in a membrane graph explored by isotropic random walks $W_{ij}^{\left(1\right)}$ (a) and by Ruelle–Bowen random walks $W_{ij}^{(\infty )}$ (b), respectively. Again, the isotropic walks are most predictable along the graph’s boundaries and at the membrane’s corners especially, but the location of walkers can hardly be predicted while in the central part of the graph. On the contrary, the navigability of the central nodes is highest if the graph is explored by Ruelle–Bowen random walks $W_{ij}^{(\infty )}$ due to the statistical confinement of anisotropic walks at the best structurally integrated part of the graph. Finally, in Figure 5c, we have presented the strive potential of nodes (neighborhood’s exploration times) in a barbell graph explored by isotropic random walks $W_{ij}^{\left(1\right)}$, and the nodes of the highest degree indeed generate the maximal strive for those walks.

As the expected node’s neighborhood exploration time serves as a statistical estimate of its neighborhood size, ${\psi }_k={\mathcal{N}}_k$, we may conclude that the navigation properties of the graph vertices are determined by the sizes of their neighborhoods with respect to the chosen graph exploration strategy. In particular, the navigability potential of a node as defined in (20) is nothing else but the “specific” density of the vertex over the size of its neighborhood, viz., ${\phi }_k={\pi }_k/{\mathcal{N}}_k$. This observation can be formulated as the following “uncertainty principle” for isotropic random walks in graphs: the larger the neighborhood of a vertex, the less reliable the assumption that a random walker is at it. In Figure 5c, the statistical neighborhoods of the best-connected nodes are highlighted in dark red and red as being characterized by the maximal strive magnitudes with respect to the isotropic random walks in the barbell graph. The anisotropic random walks are statistically confined within the best-integrated nodes of the graph, furthest from the graph’s boundaries and structural irregularities, and therefore these nodes are the most predictable of all.

5. Perspicacity and Walkability of the Determinantal Point Processes Associated with Canonical Ensembles of Walks

Perspicacity, as defined in Section 3 as the mutual information (19) between the different modes of diffusion process (described by the mutually orthogonal eigenvectors of a symmetrized transition matrix of random walks), quantifies the ability to discern and understand either of the diffusion modes by knowing the other. Although perspicacity depends on the type of random walk implemented for the graph exploration, it attains its maximum value over the diffusion modes (eigenvectors) localized at the same symmetric subgraphs in the graph (if any exist) and belonging to the same repeating eigenvalue of the related Markov transition matrix.

In Figure 6a, we present the perspicacity matrix (19) calculated for the maximally anisotropic Ruelle–Bowen random walks (12) defined on the Kittel graph shown in Figure 6b,c. The Kittel graph contains a symmetric subgraph (of 9 vertices) affecting the diffusion processes that may be defined on that. For instance, the symmetrized transition matrix of Ruelle–Bowen random walks has two eigenvectors, ${\varphi }_{18}$ and ${\varphi }_{19},$ related to each other by some permutation and belonging to the same double eigenvalue, $\lambda =-0.358225932$.

The squared elements of the eigenvectors ${\varphi }_{18}$ and ${\varphi }_{19}$ are shown in Figure 6b,c. The vertices of the Kittel graph are highlighted by hues of gray (white stands for 0, black stands for 1) according to the squared elements of ${\varphi }_{18}^2$ in Figure 6b and the squared elements of ${\varphi }_{19}^2$ in Figure 6c. The mutual information (19) between the eigenvectors ${\varphi }_{18}$ and ${\varphi }_{19}$ attains its maximum available value (of 9 bits). Thus, perspicacity, a penetrating discernment of either of the diffusion modes when the other mode is known, is fully possible only within the framework of structural symmetry common to both modes.

In urban studies, walkability is an essential concept of sustainable urban design associated with the ideal of a dense, mixed-used, walkable neighborhood fostering higher levels of creativity, reduced crime, improved health, and civic engagement, in contrast to the dull and deadly cul-de-sacs of car-oriented suburbs [50]. Walkability relies on the complex interdependence between built environment density, mix, and pedestrian access in synergy, which is difficult to quantify and measure for urban neighborhoods. In the present section, we propose a mathematically robust approach to the walkability assessment in built environments (naturally represented by connected undirected graphs). Essentially, our approach is based on the following idea: the most walkable path in a graph is that most likely to be walked (over a relatively long period of observations). The determinantal point process associated with CNE walks can be used to estimate the likelihood that either graph edge is traversed by random walkers. Namely, each and every edge of the graph $(i,j)\in E$ is assigned the probability (17) to be chosen for a walk during the longest available characteristic times ${\mathfrak{t}}_1=\infty$ and ${\mathfrak{t}}_2$, viz.,

$$\underset{{\mathfrak{t}}_1,{\mathfrak{t}}_2}{Pr}\left(i,j\right)\equiv {\left|\begin{array}{cc}{\varphi }_{1,i}& {\varphi }_{1,j}\\ {\varphi }_{2,i}& {\varphi }_{2,j}\end{array}\right|}^2.$$

(22)

The standard Dijkstra’s algorithm [51,52] for finding the shortest/longest paths between nodes in a weighted graph can then be used to chart the most/least probable paths between two given nodes. In Figure 7, we have highlighted the most probable (shown by the solid line) and least probable (shown by the dot-dashed line) paths between the given pair of vertices in the Kittel graph.

6. Discussion: On the Walkability Analysis of Urban Neighborhoods

Cities can be considered to be among the largest and most complex artificial networks created by human beings. At the same time, the city is the biggest communication editor that determines the social and economic wellbeing not only of our present generation but also for those generations to come, as it provides an interface for our everyday mutual interactions. Sociologists think that isolation worsens an area’s economic prospects by reducing opportunities for commerce and engenders a sense of isolation in inhabitants, both of which can fuel poverty and crime [19]. The speed and scale of urban growth require urgent global action to help cities prepare for growth and to avoid their being the future epicenters of poverty and human suffering. Physical segregation of minority groups dispersed over the spatially isolated pockets of streets and other inner-city areas being socially barricaded by railways and industries causes their economic marginalization [35].

Together with the “Neurocognition and Action – Biomechanics” research group of the Center for Cognitive Interaction Technology at Bielefeld University (Germany), we worked on a project aimed at improving the urban neighborhood of state-subsidized rental apartments located on Carlmeyerstraße in Bielefeld.

Although it is often impossible to change the structure of built environments in urban neighborhoods, one can try to alter the social function of a place in order to increase its attendance and improve the local social climate in it. The idea was to encourage visiting the least-walkable paths and areas surrounding them by placing sports equipment in them. In order to quantify walkability in the urban neighborhood and identify the least-walkable paths through it, we used the approach discussed in Section 5. The spatial graph of the neighborhood was created by tessellation of the available walkable space, with overlapping rectangles anchored at the built environment (see Figure 8a). Each rectangle shown in Figure 8a represented a vertex of the spatial graph, and each overlap of these rectangles was interpreted as an edge in the graph. These edges were weighted by the probabilities defined in (22), and then the least probable paths connecting the rectangles were identified with the use of Dijkstra’s algorithm.

The university initiative received positive feedback from residents of the neighborhood.

7. Conclusions

In the present paper, we studied three important applications of CNE walks defined in finite connected graphs. The CNE walks define the properly normalized probability distributions for all nodes, subgraphs, and nodal sets of the graph at all time scales of the diffusion process.

The first application is related to the quantitative measures of navigability in graphs with respect to the different graph exploration strategies. In general, frequently visited graph nodes are predicted more efficiently than those that are little frequented. In particular, each node of the graph can be characterized by the navigability and strive potentials that depend on the node’s function in the graph structure and the chosen graph exploration strategy. The navigability potential is defined as the probability that the node serves as a precursor for other nodes, while the strive potential of the node is interpreted as its neighborhood exploration time.

The second application is related to the mutual information quantifying the discernment of either of the diffusion modes by knowing the other, which we call perspicacity. We have shown that perfect perspicacity is possible only when both diffusion modes enjoy the same symmetry (grounded in the structural symmetry of the graph).

Finally, the third application is related to a walkability assessment of the graph, including identification of the most and least probable paths in that. We assume that the most walkable path is a graph is that most likely to be walked over a long enough observation time. The proposed walkability analysis was used for the assessment of walkability in urban neighborhoods and received positive feedback from the neighborhood residents.

The application of information theory methods to problems about graphs, in contrast to geometric, combinatoric, algorithmic, and algebraic approaches, can be called information graph theory. As it involves evaluating communication efficiency between individual systems’ units at different time and connectivity scales, information graph theory is in demand for a wide range of applications, such as designing network-on-chip architecture and engineering urban morphology within the concept of the smart city.