What does Dream Motifs, Hashed Decks and Coincidence Rates conclude, in numbers, about “Dream Motifs as a Bipartite Graph, and Spreading Activation in REM Sleep”?
Answer: Chapter 1 writes dream dictionaries and Hall-Van de Castle dream coding as a weighted bipartite graph of motifs and life domains: with loose readings allowed, 0.942 of motif pairs are neighbours, and a spreading-activation toy in the spirit of the REM findings ends far from its start in 0.570 of chains.
Scope of the numbers: It does not claim that dreams or cards foretell anything; the motif graph, event rates, memory rates and behavioural parameters are illustrative or synthetic; all data are generated by its programs; the book is not medical or psychological advice. In Chapter 6 an illustrative model shows that a card helps with action paralysis (the chance of starting work rises from 0.584 to 0.740) exactly as much as a coin, and less than an if-then plan.
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: 0.942
| motifs 24, domains 8, strong links 41, weak links 56 | |
| density: strong 0.214, all 0.505 | |
| strong only (276 pairs): d | 1 0.308, d=2 0.431, d=3 0.221, d=4 0.040 |
| all links (276 pairs): d | 1 0.942, d=2 0.058 |
| motif-domain pairs reachable in one step | 97 of 192 (0.505) |
Show the full program
# Chapter 1. p01: A weighted bipartite graph of dream motifs and life domains.
# 24 motifs drawn from dream dictionaries and Hall-Van de Castle style
# codes; 8 life domains. Each motif has one or two STRONG readings
# (weight 1.0, then 0.7) as a dictionary would list them; other pairs get
# a WEAK link (0.05 to 0.30) with probability 0.35 (seed 89), standing
# for the looser readings an interpreter can reach for. The motif graph
# links two motifs that share a domain; distances are counted in it.
import random
DOMAINS = ("wealth", "health", "kin", "love", "work", "travel",
"conflict", "fear")
STRONG = {
"water": "wealth fear", "fire": "wealth conflict",
"snake": "wealth love", "teeth": "kin health", "flying": "work",
"falling": "fear work", "chased": "fear conflict",
"death": "health kin", "wedding": "love kin", "money": "wealth",
"house": "kin", "road": "travel work", "exam": "work fear",
"child": "kin love", "fish": "wealth", "dog": "conflict kin",
"mountain": "work travel", "rain": "wealth health",
"blood": "health wealth", "boat": "travel", "teacher": "work",
"stranger": "love fear", "food": "health", "phone": "love travel",
}
MOTIFS = sorted(STRONG)
def build(seed=89, p_weak=0.35):
rng = random.Random(seed)
w = {}
for m in MOTIFS:
doms = STRONG[m].split()
for d in DOMAINS:
if d in doms:
w[m, d] = 1.0 if doms.index(d) == 0 else 0.7
elif rng.random() < p_weak:
w[m, d] = round(rng.uniform(0.05, 0.30), 3)
return w
def motif_distances(w, min_w):
nb = {m: set() for m in MOTIFS}
for (m, d), x in w.items():
if x < min_w:
continue
for (m2, d2), y in w.items():
if d2 == d and m2 != m and y >= min_w:
nb[m].add(m2)
dist = {}
for s in MOTIFS:
seen, front, k = {s: 0}, [s], 0
while front:
k += 1
nxt = []
for u in front:
for v in sorted(nb[u]):
if v not in seen:
seen[v] = k
nxt.append(v)
front = nxt
for t in MOTIFS:
if t > s:
dist[s, t] = seen.get(t, None)
return dist
if __name__ == "__main__":
w = build()
strong = sum(1 for x in w.values() if x >= 0.7)
weak = len(w) - strong
print(" motifs {}, domains {}, strong links {}, weak links {}".format(
len(MOTIFS), len(DOMAINS), strong, weak))
print(" density: strong {:.3f}, all {:.3f}".format(
strong / 192, len(w) / 192))
for label, mw in (("strong only", 0.7), ("all links", 0.0)):
dist = motif_distances(w, mw)
n = len(dist)
cnt = {}
for v in dist.values():
cnt[v] = cnt.get(v, 0) + 1
parts = ", ".join("d={} {:.3f}".format(k, cnt[k] / n)
for k in sorted(cnt, key=lambda x: (x is None, x)))
print(" {:11s} ({} pairs): {}".format(label, n, parts))
reach = sum(1 for m in MOTIFS for d in DOMAINS if (m, d) in w)
print(" motif-domain pairs reachable in one step: {} of 192 ({:.3f})"
.format(reach, reach / 192))Single source and citation
Fan, Y. (2026). Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation (Version 1.0.0), Chapter 1: Dream Motifs as a Bipartite Graph, and Spreading Activation in REM Sleep. 5D Library. https://doi.org/10.5281/zenodo.24090233
DOI: 10.5281/zenodo.24090233 · Read the monograph · 5DL-B-089 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026089,
author = {Fan, Yafu},
title = {Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090233},
url = {https://doi.org/10.5281/zenodo.24090233}
}Other chapter answers in this book
- Chapter 2 · Reverse Dreams, Direct Dreams and Day Residue
- Chapter 3 · A Deterministic 54-Card Deck: SHA-256 and the Fisher-Yates Shuffle
- Chapter 4 · Avalanche, Collisions and How Unique a Reading Is
- Chapter 5 · Littlewood's Law and Selective Memory
- Chapter 6 · The Card as an Action Anchor
- Chapter 7 · The Six Dreams of the Rites of Zhou, Wang Fu's Ten Kinds of Dream, the Dunhuang Dream Book and Jung's Synchronicity
- Chapter 8 · Auditing a Card App and a Pre-Registered Trial