framework
active
framework:graph-hamiltoniangraph Hamiltonian
Hamiltonian constructed from adjacency matrix and coupling strengths on a graph
Neighborhood — ranked by edge-count
Concepts (1)
concept
- Local HamiltonianextendsSum of windowed Hamiltonians with same window length; a key construct introduced in the paper to model local interactions on graphs
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- A more complex geometric structure used to characterize in-context learning task representations
- Core technical concept: a Hamiltonian where spin-spin interactions are defined only within finite windows ω, enabling generic analysis across diverse lattices
- Graph structure constraining local interactions and ordering
- Janus proposes transformer computation viewed as causal graph with foliations/time-slices specifying computation order.
- Pre-quantum physics based on point masses and deterministic laws, which cannot explain the stability of chemical bonds necessary for life.
- Technique using principal eigenvectors to identify densest clusters; applied to find principal Markov blanket in simulations.
- Diagrammatic approach to quantum theory using visual process representations.
- Theoretical framework Schrödinger argues is essential for explaining chemical stability of genes and hereditary substance against thermal perturbation.