Identifying interacting pairs of sites in Ising models on a countable set

Galves, Antonio; Orlandi, Enza; Takahashi, Daniel Y.

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Identifying interacting pairs of sites in Ising models on a countable set

Full text
Author(s):	Galves, Antonio ^[1] ; Orlandi, Enza ^[2] ; Takahashi, Daniel Y. ^[3] Total Authors: 3
Affiliation:	^[1] Univ Sao Paulo, Inst Matemat & Estat, BR-05315970 Sao Paulo - Brazil ^[2] Univ Rome Tre, Dipartimento Matemat, I-00146 Rome - Italy ^[3] Princeton Univ, Inst Neurosci, Princeton, NJ 08648 - USA Total Affiliations: 3
Document type:	Journal article
Source:	BRAZILIAN JOURNAL OF PROBABILITY AND STATISTICS; v. 29, n. 2, p. 443-459, MAY 2015.
Web of Science Citations:	2
Abstract
This paper address the problem of identifying pairs of interacting sites from a finite sample of independent realizations of the Ising model. We consider Ising models in a infinite countable set of sites under Dobrushin uniqueness condition. The observed sample contains only the values assigned by the Ising model to a finite set of sites. Our main result is an upperbound for the probability of misidentification of the pairs of interacting sites in this finite set. (AU)

FAPESP's process:	08/08171-0 - Modeling populations of neurons with multicomponent systems with variable range interactions
Grantee:	Daniel Yasumasa Takahashi
Support Opportunities:	Scholarships in Brazil - Post-Doctoral

Short URL