Misplaced Pages

Gelman-Rubin statistic: Difference between revisions

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 06:33, 26 July 2024 editDoctormatt (talk | contribs)Extended confirmed users8,332 edits revert badly formatted commentary; please discuss on talk page; Undid revision 1236720442 by Smith609 (talk)Tag: Undo← Previous edit Revision as of 09:41, 14 August 2024 edit undoSmith609 (talk | contribs)Administrators38,070 edits ReformatNext edit →
Line 14: Line 14:


When L tends to infinity and B tends to zero, R tends to 1. When L tends to infinity and B tends to zero, R tends to 1.

A rather different formula is given elsewhere.<ref>{{cite journal | doi = 10.1214/20-STS812}}</ref>.


== Alternatives == == Alternatives ==

Revision as of 09:41, 14 August 2024

This article needs attention from an expert in Mathematics. Please add a reason or a talk parameter to this template to explain the issue with the article. WikiProject Mathematics may be able to help recruit an expert. (January 2024)

The Gelman-Rubin statistic allows a statement about the convergence of Monte Carlo simulations.

Definition

J {\displaystyle J} Monte Carlo simulations (chains) are started with different initial values. The samples from the respective burn-in phases are discarded. From the samples x 1 ( j ) , , x L ( j ) {\displaystyle x_{1}^{(j)},\dots ,x_{L}^{(j)}} (of the j-th simulation), the variance between the chains and the variance in the chains is estimated:

x ¯ j = 1 L i = 1 L x i ( j ) {\displaystyle {\overline {x}}_{j}={\frac {1}{L}}\sum _{i=1}^{L}x_{i}^{(j)}} Mean value of chain j
x ¯ = 1 J j = 1 J x ¯ j {\displaystyle {\overline {x}}_{*}={\frac {1}{J}}\sum _{j=1}^{J}{\overline {x}}_{j}} Mean of the means of all chains
B = L J 1 j = 1 J ( x ¯ j x ¯ ) 2 {\displaystyle B={\frac {L}{J-1}}\sum _{j=1}^{J}({\overline {x}}_{j}-{\overline {x}}_{*})^{2}} Variance of the means of the chains
W = 1 J j = 1 J ( 1 L 1 i = 1 L ( x i ( j ) x ¯ j ) 2 ) {\displaystyle W={\frac {1}{J}}\sum _{j=1}^{J}\left({\frac {1}{L-1}}\sum _{i=1}^{L}(x_{i}^{(j)}-{\overline {x}}_{j})^{2}\right)} Averaged variances of the individual chains across all chains

An estimate of the Gelman-Rubin statistic R {\displaystyle R} then results as

R = L 1 L W + 1 L B W {\displaystyle R={\frac {{\frac {L-1}{L}}W+{\frac {1}{L}}B}{W}}} .

When L tends to infinity and B tends to zero, R tends to 1.

A rather different formula is given elsewhere..

Alternatives

The Geweke Diagnostic compares whether the mean of the first x percent of a chain and the mean of the last y percent of a chain match.

Literature

References

  1. Peng, Roger D. 7.4 Monitoring Convergence | Advanced Statistical Computing – via bookdown.org.
  2. . doi:10.1214/20-STS812. {{cite journal}}: Cite journal requires |journal= (help); Missing or empty |title= (help)
Categories:
Gelman-Rubin statistic: Difference between revisions Add topic