Path Cohomology of Locally Finite Digraphs,Hodge's Theorem and the $p$-Lazy Random Walk
Andr\'e Gomes, Daniel Miranda, Renata Possobon

TL;DR
This paper extends the theory of Markov chains on digraphs by introducing a cohomology framework, defining new Laplace operators, proving a Hodge Decomposition, and linking the $p$-Lazy Random Walk's behavior to these spectral properties.
Contribution
It develops a cohomology theory for infinite, locally finite digraphs, introduces new Laplace operators, and connects these to the asymptotic behavior of a novel $p$-Lazy Random Walk.
Findings
Defined cohomology for infinite digraphs in arbitrary dimensions
Proved Hodge Decomposition Theorem for the new Laplacians
Linked the spectrum of Laplacians to the mixing time of the $p$-Lazy Random Walk
Abstract
The study of Markov chains on discrete spaces, such as digraphs, has captivated mathematicians in recent decades due to its interconnectedness with topology, geometry, dynamics, spectral theory, and differential equations. Furthermore, extensive exploration of these multifaceted relationships has been pursued for their practical utility in diverse fields, including machine learning and image segmentation. In recent times, these interrelations have been generalized to higher dimensions within the framework of finite-dimensional simplicial complexes. In this paper, we embark on a further extension of these concepts. Initially, we introduce a cohomology of infinite (though locally finite) digraphs in arbitrary dimensions. Subsequently, in the latter portion of this manuscript, we define a fresh family of Laplace operators and conduct an examination of their spectrum, culminating in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Combinatorial Mathematics · Homotopy and Cohomology in Algebraic Topology
Path Cohomology of Locally Finite Digraphs,Hodge’s Theorem and the -Lazy Random Walk
André Gomes and Daniel Miranda
Abstract
In this paper we generalize the path cohomology of digraphs to a locally finite digraph . We prove a Hodge Decomposition Theorem and show some relations with the -lazy Random Walk.
Contents
- 1 Path Cohomology of Digraphs
- 2 The Discrete Laplacian and Harmonic Forms
- 3 The Hodge Theorem
- 4 The Heat Equation
- 5 Elementary Paths Orientation
- 6 The -lazy Random Walk and Expectation Process
1 Path Cohomology of Digraphs
In this section we present the definition of path cohomology for a locally finite digraph with coefficients in field as a generalization of [2]; in which the theory was developed to finite digraphs. We point out that the name cohomology is due to the fact that it is dual to the homology path theory, also presented in [2] as well as in [3]. We also emphasize that it is done in analogy to the de Rham cohomology, for differentiable manifolds.
Definition 1.1**.**
A digraphs is said to be locally finite if, for each vertex , figures in at most a finite number of edges in .
Every digraph here mentioned is assumed to be locally finite.
Definition 1.2**.**
For each non-negative integer , a -form on the set of vertices is any application on the sequences of vertices over the field .
We denote the sequences simply by , without delimiters between the vertices. They are also called elementary -path over .
Definition 1.3**.**
The space of all formal -linear combination of all elementary -path over is denoted by . Its elements are called -paths on .
It is easy to see that the -linear space of all -forms is dual to , and it is denoted by .
We will restrict ourselves to the Hilbert space of the square-integrable forms, i.e.,
[TABLE]
with the canonical inner product
[TABLE]
Definition 1.4**.**
Define the linear operators , exterior differential, and , boundary operator, by
[TABLE]
[TABLE]
in which means the omission of the index .
Lemma 1.5**.**
We have that .
Proof.
We have by that
[TABLE]
[TABLE]
As , we have that the RHS of the equality above is equal to
[TABLE]
By switching and in the last sum we see that the twos sums cancel out, whence . ∎
Definition 1.6**.**
The forms in are said to be closed. And those in are said to be exact.
Proposition 1.7**.**
If then .
Proof.
Observe that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Inverting the indices in the latter sum, the last two sums cancel wach other. This way:
[TABLE]
∎
Proposition 1.8**.**
the operators and are adjoint with respect to the fixed inner product.
Proof.
Given a -form and a -form on , with ,
[TABLE]
∎
Corollary 1.9**.**
.
We say that an elementary -path is allowed on if for . Otherwise it is said to be not allowed.
A -form is said to be allowed if it is null on every -linear combination of not allowed elementary -paths.
Definition 1.10**.**
For any non-negative integer , the space of -allowed forms is the subspace of ,
[TABLE]
It is clear that f being allowed does not mean that or is also allowed.
We will then restrict ourselves to the following space
[TABLE]
This way we have the chain complexes
[TABLE]
and
[TABLE]
Definition 1.11**.**
We define over the complex 5 the path cohomologies by
[TABLE]
It is well defined by Lemma 1.5.
2 The Discrete Laplacian and Harmonic Forms
In the de Rham Theory one can define, over the spaces of forms, the Hodge Laplacian by
[TABLE]
in which is the exterior differential and is the codifferential. This Laplacian is globally defined and it is strongly related to the manifold topology. Our goal in this section is to define a Laplacian over digraphs, which is a generalization of the classic discrete Laplacian and present some basic results.
Definition 2.1**.**
The Laplacian (or Laplace operator) is the linear operator over given by
[TABLE]
Proposition 2.2**.**
The Laplacian is self-adjoint.
Proof.
It follows directly from the fact that and are adjoint. ∎
Example 2.3**.**
Let be a locally finite digraph and , that is, its domain is a subset of the vertices set . Then,
[TABLE]
Therefore,
[TABLE]
This way, the Laplacian here defined is a multiple of the classical discrete Laplacian (see [7]).
Proposition 1**.**
Let be a -form. Then, iff and .
Proof 2.4**.**
Clearly and imply . Now,
[TABLE]
This way means that and .
Definition 2.5**.**
A -form is said to harmonic if
[TABLE]
And we set the space of harmonic -forms as
[TABLE]
Lemma 2.6**.**
* iff *
Proof 2.7**.**
Suppose That . Then and
[TABLE]
because . Then, by Proposition 1, .
Now suppose that . Then, again, by Proposition 1, . This way
[TABLE]
So
3 The Hodge Theorem
Our goal is to prove the following theorem to locally finite digraphs, under certain hypotheses; which will be dealt later.
Theorem 3.1** (Hodge Theorem).**
Let be a locally finite and connected digraph such that there are and with . Then every path cohomology class has a unique representative that minimizes the norm. This is called the harmonic representative.
We will deal with this theorem in analogy to what is done in [1] (chapter 8) to the Hodge Theorem on manifolds. It follows – as will be shown – from the following theorem; which will be proved in the next section.
Theorem 3.2**.**
There are linear operators (harmonic projection) and (Green’s operator) on , for all , that are characterized by the following properties:
* is harmonic;* 2. 2.
* is orthogonal to the space of harmonic forms;* 3. 3.
.
Corollary 3.3**.**
There is an orthogonal direct sum
[TABLE]
We now show prove the Theorem 3.1 as a consequence of Theorem 3.2.
Proof 3.4**.**
Let be an exact form. By Theorem 3.2 it can be written
[TABLE]
Since is harmonic,
[TABLE]
Furthermore,
[TABLE]
Then
[TABLE]
Thus is cohomologous to the harmonic form .
For uniqueness, let and be two harmonic forms in the same cohomology class that differ by the exact form , i.e., . Then
[TABLE]
given the fact that harmonic forms are in . Therefore and .
4 The Heat Equation
In this section we will prove the Theorem 3.2. The pictorial idea behind this proof is that a given initial temperature, given by a form , should spread through the digraph “uniformly”; i.e., to should converge to a harmonic form. To do so we shall solve the Cauchy Problem (CP):
[TABLE]
on with initial condition .
A map is said to be fundamental solution to the heat equation,
[TABLE]
if for any bounded initial condition , the function
[TABLE]
is differentiable in , satisfies the heat equation, and if for any allowed path ,
[TABLE]
We shall, for now on, consider the usual metric on connected digraphs. That is, and, if , there is a finite number of vertices which connect and . Then, is the smallest number of such vertices.
Finally, the following theorem takes place. It is stated on [7] to [math]-forms, only. But, with minor modifications, it its proof holds to -forms for any non-negative integer .
Theorem 4.1**.**
Let be a locally finite and connected digraph such that there are and with . Then the following holds true:
- •
There is a unique fundamental solution of the heat equation.
- •
* is stochastically complete, i.e.*
[TABLE]
for any and any allowed path .
- •
For every and the corresponding bounded solution of (CP) we have
[TABLE]
for any .
We will then divide the proof of 3.2 in the following propositions.
Proposition 2**.**
If is a general solution of the heat equation, then is (nonstrictly) decreasing.
Proof 4.2**.**
[TABLE]
Let
[TABLE]
with as in Theorem 4.1. This is, as we have seen, the only solution to (CP).
Proposition 3**.**
The semigroup property holds.
Proof 4.3**.**
It holds because can be obtained by solving the heating equation with intial condition and then evaluating it at .
Proposition 4**.**
* is formally self-adjoint.*
Proof 4.4**.**
As
[TABLE]
[TABLE]
we can write . Thus,
[TABLE]
Proposition 5**.**
* converges to a harmonic form .*
Proof 4.5**.**
We have
[TABLE]
[TABLE]
Applying 3 and then 4, we have
[TABLE]
Therefore,
[TABLE]
By (2), converges. Thus, can be taken arbitrarily small. As is complete, converges, in , to a form .
To prove that is indeed harmonic, one just need to take and note that the relation implies, taking the limit , that . Then is constant on . Therefore,
[TABLE]
Thus, is indeed harmonic.
Furthermore,
[TABLE]
Then, is self-adjoint.
Proposition 6**.**
* is compact for any .*
Proof 4.6**.**
Let be an enumerable orthonormal basis of . Then is also an enumerable orthonormal basis of . Define then
[TABLE]
so that
[TABLE]
Now, we define
[TABLE]
and
[TABLE]
This way, the image of is a finite dimensional subspace of .
As every operator whose image is finite dimensional is compact, is compact.
Also, we have
[TABLE]
[TABLE]
[TABLE]
As , the sum above tends to zero as . Thus, with respect to operator norm. Therefore we can evoke the theorem below.
Theorem 4.7**.**
Let be a linear map and be a sequence of compact linear maps such that with respect to operator norm. Then is compact.
Its proof can be found in [4], page 408.
Proposition 7**.**
The Green’s operator, given by the integral,
[TABLE]
is well defined. Moreover, the following equality takes place
[TABLE]
Further, is orthogonal to the space of harmonic forms for any .
Proof 4.8**.**
To show that the Green’s operator is well define we must show that decay rapidly enough.
It is a well known fact that if is a compact self adjoint operator on a Hilbert space, , and
[TABLE]
then either or is the greatest eigenvalue of and
[TABLE]
holds true.
This way, the maximum of the variational problem:
[TABLE]
has solution. We call this maximum by and the correspondent maximum value by .
By semigroup property, . On the other hand, . Thus, . Therefore the function is multiplicative and then , with . Moreover, the minus sign is given by the fact that converges to as .
As , we have . Therefore it decays rapidly enough.
Now,
[TABLE]
At last, let be a harmonic form. Then
[TABLE]
5 Elementary Paths Orientation
Definition 5.1**.**
Let be a digraph. The -paths of the form are called oriented elementary -path of whenever is an elementary -path of .
Furthermore we say that and have opposite orientations. And we denote the set of all oriented elementary -paths on by . The set of elementary -paths will be denoted by and the one of those with reverted orientation by .
Definition 5.2**.**
Given a elementary -path on the digraph , we say that an elementary -path is a neighbour of if for some and for some
[TABLE]
Furthermore, we say that a sub-digraph of is a -component of if for any two elementary -paths there exists a chain of -paths .
If is a -component itself we say that is -connected.
Definition 5.3**.**
Given an elementary allowed and oriented elementary -path we define as its valence the -form
[TABLE]
We will, for now on, restrict ourselves to a fixed -connected and -regular digraph of limited valence; i.e., there is a integer such that for any . That implies that for any there is a such that for any .
We will then fix the following inner product over :
[TABLE]
where is the weight function given by
[TABLE]
With respect to this inner product explicit computations show that the adjoint of is the operator given by
[TABLE]
We highlight that the valence is bounded – so it is well defined.
Thus, explicitly,
[TABLE]
and
[TABLE]
We define then the upper and the lower Laplacian respectively by:
[TABLE]
[TABLE]
It is clear that all facts proven to the Laplacian trough this paper holds for the normalized Laplacian
Proposition 8**.**
For any elementary -path in ,
[TABLE]
and
[TABLE]
Proof 5.4**.**
Explicit calculations give:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
[TABLE]
Proposition 9**.**
The spectrum of is contained in .
Proof 5.5**.**
Assume that . As , is limited and, therefore, has a maximum point (say).
By Proposition 8,
[TABLE]
Thus,
[TABLE]
(since ).
6 The -lazy Random Walk and Expectation Process
Definition 6.1**.**
The -lazy random walk on starting on the -elementary path is the Markov chain on with transition probabilities
[TABLE]
We denote the probability that the random walk which starts at reaches at time by .
Definition 6.2**.**
For , the expectation process on starting at is the sequence of -forms defined by
[TABLE]
The name “expectation” is due to the fact that for any -form ,
[TABLE]
Moreover, we have
[TABLE]
Then we have the following definition.
Definition 6.3**.**
We define the transition operator by
[TABLE]
Proposition 10**.**
The transition operator is given by
[TABLE]
Where denotes the identity.
So that
[TABLE]
Proof 6.4**.**
It follows trivially from Proposition 8,
Proposition 11**.**
The spectrum of is contained in .
Proof 6.5**.**
By Proposition 10 we have that
[TABLE]
But the last equality is equivalent to
[TABLE]
By Proposition 9 we have that
[TABLE]
Thus .
Proposition 12**.**
There is a positive integer s.t. the expectation process satisfies
[TABLE]
Proof 6.6**.**
We have that
[TABLE]
And ; where
[TABLE]
Then, by Proposition 11,
[TABLE]
For the lower bound, let , fix and define
[TABLE]
So , since , and . Note that, as has bounded valence, there is a positive integer s.t. . Since decomposes w.r.t the orthogonal sum so does . Thus,
[TABLE]
Proposition 13**.**
The expectation process converges to . So if the homology of is trivial, is exact.
Proof 6.7**.**
Since decomposes w.r.t. the orthogonal sum and , this means that converges to the orthogonal projection . Thus
[TABLE]
So is closed. Therefore, if the homology of is trivial then it is exact.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Donu Arapura. Algebraic geometry over the complex numbers . Springer Science & Business Media, 2012.
- 2[2] Alexander Grigor’yan, Yong Lin, Yuri Muranov, and Shing-Tung Yau. Homologies of path complexes and digraphs. ar Xiv preprint ar Xiv:1207.2834 , 2012.
- 3[3] Alexander Grigor’yan, Rolando Jimenez, Yuri Muranov, and Shing-Tung Yau. On the path homology theory of digraphs and eilenberg-steenrod axioms. 2016.
- 4[4] Erwin Kreyszig. Introductory functional analysis with applications , volume 1. wiley New York, 1989.
- 5[5] Ori Parzanchevski. High Dimensional Expanders . Ph D thesis, Hebrew University of Jerusalem, 2014.
- 6[6] Ori Parzanchevski and Ron Rosenthal. Simplicial complexes: spectrum, homology and random walks. Random Structures & Algorithms , 50(2):225–261, 2017.
- 7[7] Andreas Weber. Analysis of the physical laplacian and the heat flow on a locally finite graph. Journal of Mathematical Analysis and Applications , 370(1):146–158, 2010.
