Joint estimation of parameters in Ising model
Ising 模型参数的联合估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确以耦合图描述相互依赖,并研究图结构对参数联合估计的影响,直接对应网络方法。
Ising 模型参数的联合估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study joint estimation of the inverse temperature and magnetization parameters $(\beta ,B)$ of an Ising model with a nonnegative coupling matrix $A_{n}$ of size $n\times n$, given one sample from the Ising model. We give a general bound on the rate of consistency of the bi-variate pseudo-likelihood estimator. Using this, we show that estimation at rate $n^{-1/2}$ is always possible if $A_{n}$ is the adjacency matrix of a bounded degree graph. If $A_{n}$ is the scaled adjacency matrix of a graph whose average degree goes to $+\infty $, the situation is a bit more delicate. In this case, estimation at rate $n^{-1/2}$ is still possible if the graph is not regular (in an asymptotic sense). Finally, we show that consistent estimation of both parameters is impossible if the graph is Erdős–Renyi with parameter $p>0$ independent of $n$, thus confirming that estimation is harder on approximately regular graphs with large degree.