PERFECT STOCHASTIC SUMMATION IN HIGH ORDER FEYNMAN GRAPH EXPANSIONS

DOI10.1142/S0129183106009989zbMath1121.82327MaRDI QIDQ3427086

No author found.

Publication date: 14 March 2007

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

zbMATH Keywords

Feynman diagramsperfect simulationself energymetropolis-hastings algorithmMonte Carlo summation

Mathematics Subject Classification ID

Quantum equilibrium statistical mechanics (general) (82B10)

Related Items (5)

ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS ⋮ A simple certifying algorithm for 3-edge-connectivity ⋮ Certifying 3-edge-connectivity ⋮ Unnamed Item ⋮ A simple 3-edge connected component algorithm revisited

Uses Software

• pvegas.c

Cites Work

• A new algorithm for adaptive multidimensional integration
• Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes
• Perfect sampling from independent Metropolis-Hastings chains
• Parallelization of adaptive MC integrators
• Perfect Simulation of Conditionally Specified Models
• Exact Sampling from a Continuous State Space
• Perfect simulation and backward coupling^∗
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Simulating the Invariant Measures of Markov Chains Using Backward Coupling at Regeneration Times

This page was built for publication: PERFECT STOCHASTIC SUMMATION IN HIGH ORDER FEYNMAN GRAPH EXPANSIONS