What does Tarot, Lenormand and Tree Graphs conclude, in numbers, about “The Tree of Life as a Graph: Spectrum, Centrality and Paths”?

Answer: Chapter 4 writes the Tree as a graph of 10 vertices and 22 edges: algebraic connectivity 1.2805, 54349 spanning trees and an automorphism group containing only the left-right reflection; Tiphereth leads in degree, eigenvector, betweenness and closeness centrality and holds 0.5321 of all betweenness; 533 of the 573 simple paths from Malkuth to Kether pass through it, and a random walk needs 21.0358 steps on average to first reach Kether.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 1.2805, 10, 22, 54349

edges 22, degree sum 44
Laplacian spectrum: 0.000 1.281 2.891 3.753 4.329
4.684 5.445 5.738 6.802 9.077
algebraic connectivity 1.2805; largest 9.0771
spanning trees (matrix-tree theorem): 54349
nodedegreeeigenvector centrality (max = 1)
1 Kether30.4420
2 Chokmah40.5469
3 Binah40.5469
4 Chesed40.6015
5 Geburah40.6015
6 Tiphereth81.0000
7 Netzach50.7010
8 Hod50.7010
9 Yesod40.5961
10 Malkuth30.4218
largest adjacency eigenvalue 4.7369
Show the full program
# Chapter 4. p08: The Tree of Life as a graph - Laplacian and centrality.
# Ten sephiroth: 1 Kether, 2 Chokmah, 3 Binah, 4 Chesed, 5 Geburah,
# 6 Tiphereth, 7 Netzach, 8 Hod, 9 Yesod, 10 Malkuth. The 22 paths of the
# Kircher / Golden Dawn tree, numbered 11-32 in Kircher's order.
# L = D - A. Eigenvalues by the cyclic Jacobi method (pure Python);
# spanning trees by the matrix-tree theorem (exact determinant).
from fractions import Fraction

PATHS = [(1, 2), (1, 3), (1, 6), (2, 3), (2, 6), (2, 4), (3, 6), (3, 5),
         (4, 5), (4, 6), (4, 7), (5, 6), (5, 8), (6, 7), (6, 9), (6, 8),
         (7, 8), (7, 9), (7, 10), (8, 9), (8, 10), (9, 10)]
NAMES = ["Kether", "Chokmah", "Binah", "Chesed", "Geburah", "Tiphereth",
         "Netzach", "Hod", "Yesod", "Malkuth"]
n = 10

def adjacency():
    A = [[0] * n for _ in range(n)]
    for a, b in PATHS:
        A[a - 1][b - 1] = A[b - 1][a - 1] = 1
    return A

def jacobi(M, sweeps=60):
    M = [row[:] for row in M]
    for _ in range(sweeps):
        for p in range(n):
            for q in range(p + 1, n):
                if abs(M[p][q]) < 1e-15:
                    continue
                th = (M[q][q] - M[p][p]) / (2 * M[p][q])
                t = (1 if th >= 0 else -1) / (abs(th) + (th * th + 1) ** .5)
                c = 1 / (t * t + 1) ** .5
                s = t * c
                for k in range(n):
                    mkp, mkq = M[k][p], M[k][q]
                    M[k][p], M[k][q] = c * mkp - s * mkq, s * mkp + c * mkq
                for k in range(n):
                    mpk, mqk = M[p][k], M[q][k]
                    M[p][k], M[q][k] = c * mpk - s * mqk, s * mpk + c * mqk
    return sorted(M[i][i] for i in range(n))

def det(M):
    M = [[Fraction(x) for x in row] for row in M]
    d, m = Fraction(1), len(M)
    for i in range(m):
        piv = next(r for r in range(i, m) if M[r][i] != 0)
        if piv != i:
            M[i], M[piv] = M[piv], M[i]
            d = -d
        d *= M[i][i]
        for r in range(i + 1, m):
            f = M[r][i] / M[i][i]
            M[r] = [x - f * y for x, y in zip(M[r], M[i])]
    return d

if __name__ == "__main__":
    A = adjacency()
    deg = [sum(r) for r in A]
    L = [[(deg[i] if i == j else 0) - A[i][j] for j in range(n)]
         for i in range(n)]
    print("   edges {}, degree sum {}".format(len(PATHS), sum(deg)))
    lam = jacobi(L)
    lam[0] = abs(lam[0])            # the zero eigenvalue, sign of rounding
    print("   Laplacian spectrum: " + " ".join("{:.3f}".format(x)
                                             for x in lam[:5]))
    print("                       " + " ".join("{:.3f}".format(x)
                                             for x in lam[5:]))
    print("   algebraic connectivity {:.4f}; largest {:.4f}".format(
        lam[1], lam[-1]))
    trees = det([row[1:] for row in L[1:]])
    print("   spanning trees (matrix-tree theorem): {}".format(trees))
    x = [1.0] * n
    for _ in range(500):
        y = [sum(A[i][j] * x[j] for j in range(n)) for i in range(n)]
        s = max(y)
        x = [v / s for v in y]
    print("   node        degree  eigenvector centrality (max = 1)")
    for i in range(n):
        print("   {:2d} {:9s}  {:5d}   {:.4f}".format(
            i + 1, NAMES[i], deg[i], x[i]))
    print("   largest adjacency eigenvalue {:.4f}".format(s))

Single source and citation

Fan, Y. (2026). Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs (Version 1.0.0), Chapter 4: The Tree of Life as a Graph: Spectrum, Centrality and Paths. 5D Library. https://doi.org/10.5281/zenodo.24090191

DOI: 10.5281/zenodo.24090191 · Read the monograph · 5DL-B-071 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026071,
  author    = {Fan, Yafu},
  title     = {Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090191},
  url       = {https://doi.org/10.5281/zenodo.24090191}
}

Other chapter answers in this book