{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5TVANBKJN5ROBYQVGJUS4VDBUA","short_pith_number":"pith:5TVANBKJ","schema_version":"1.0","canonical_sha256":"ecea0685496f62e0e21532692e5461a00fe56b3cd990fbdda66ad0d243eb5d0d","source":{"kind":"arxiv","id":"1107.2574","version":1},"attestation_state":"computed","paper":{"title":"A central limit theorem for adaptive and interacting Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Eric Moulines (LTCI), Gersende Fort (LTCI), Pierre Priouret (LPMA), Pierre Vandekerkhove (LAMA)","submitted_at":"2011-07-13T15:20:08Z","abstract_excerpt":"Adaptive and interacting Markov Chains Monte Carlo (MCMC) algorithms are a novel class of non-Markovian algorithms aimed at improving the simulation efficiency for complicated target distributions. In this paper, we study a general (non-Markovian) simulation framework covering both the adaptive and interacting MCMC algorithms. We establish a Central Limit Theorem for additive functionals of unbounded functions under a set of verifiable conditions, and identify the asymptotic variance. Our result extends all the results reported so far. An application to the interacting tempering algorithm (a s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1107.2574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-13T15:20:08Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ae82d801c67512dd8e418d986e56089c445441163018daf043ce2bea1013238c","abstract_canon_sha256":"9f0391fce6af01cac6d4532e42730b34d7571b5dcefe009fa5f0509c87ba8651"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:15.893058Z","signature_b64":"YH/Rlsza5h+M+mOQx+2xuzzPbD1YAQt+jni/cGtfR+xHKosExuyymgM6BwQ+AiF3DsWmXUspzqO5VHwUDL3LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecea0685496f62e0e21532692e5461a00fe56b3cd990fbdda66ad0d243eb5d0d","last_reissued_at":"2026-05-18T04:18:15.892668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:15.892668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A central limit theorem for adaptive and interacting Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Eric Moulines (LTCI), Gersende Fort (LTCI), Pierre Priouret (LPMA), Pierre Vandekerkhove (LAMA)","submitted_at":"2011-07-13T15:20:08Z","abstract_excerpt":"Adaptive and interacting Markov Chains Monte Carlo (MCMC) algorithms are a novel class of non-Markovian algorithms aimed at improving the simulation efficiency for complicated target distributions. In this paper, we study a general (non-Markovian) simulation framework covering both the adaptive and interacting MCMC algorithms. We establish a Central Limit Theorem for additive functionals of unbounded functions under a set of verifiable conditions, and identify the asymptotic variance. Our result extends all the results reported so far. An application to the interacting tempering algorithm (a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2574","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.2574","created_at":"2026-05-18T04:18:15.892719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2574v1","created_at":"2026-05-18T04:18:15.892719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2574","created_at":"2026-05-18T04:18:15.892719+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TVANBKJN5RO","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TVANBKJN5ROBYQV","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TVANBKJ","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA","json":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA.json","graph_json":"https://pith.science/api/pith-number/5TVANBKJN5ROBYQVGJUS4VDBUA/graph.json","events_json":"https://pith.science/api/pith-number/5TVANBKJN5ROBYQVGJUS4VDBUA/events.json","paper":"https://pith.science/paper/5TVANBKJ"},"agent_actions":{"view_html":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA","download_json":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA.json","view_paper":"https://pith.science/paper/5TVANBKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2574&json=true","fetch_graph":"https://pith.science/api/pith-number/5TVANBKJN5ROBYQVGJUS4VDBUA/graph.json","fetch_events":"https://pith.science/api/pith-number/5TVANBKJN5ROBYQVGJUS4VDBUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/action/storage_attestation","attest_author":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/action/author_attestation","sign_citation":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/action/citation_signature","submit_replication":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/action/replication_record"}},"created_at":"2026-05-18T04:18:15.892719+00:00","updated_at":"2026-05-18T04:18:15.892719+00:00"}