Papers › Spinfoam on Lefschetz Thimble: Markov Chain Monte-Carlo Computation of Lorentzian...

Spinfoam on Lefschetz Thimble: Markov Chain Monte-Carlo Computation of Lorentzian Spinfoam Propagator

21 Dec 2020arXiv:2012.11515links table onlyarchive 2025-07-28

Muxin Han, Zichang Huang, Hongguang Liu, Dongxue Qu, Yidun Wan

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We compute numerically the Lorentzian Engle-Pereira-Rovelli-Livine (EPRL) spinfoam propagator on a 4-simplex, by adapting the methods of Lefschetz thimble and Markov Chain Monte-Carlo to oscillatory spinfoam integrals. Our method can compute any spinfoam observables at relatively large spins. We obtain the numerical results of the propagators at different spins and demonstrate their consistency with the expected spinfoam semi-classical behavior in the large spin limit. Our results exhibit significant quantum corrections at smaller spins. Our method is reliable and thus can be employed to discover the semi-classical and quantum behaviors of the spinfoam model.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections