Optimal Nonlinear Prediction of Random Fields on Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2003

Optimal Nonlinear Prediction of Random Fields on Networks


It is increasingly common to encounter time-varying random fields on networks (metabolic networks, sensor arrays, distributed computing, etc.).This paper considers the problem of optimal, nonlinear prediction of these fields, showing from an information-theoretic perspective that it is formally identical to the problem of finding minimal local sufficient statistics.I derive general properties of these statistics, show that they can be composed into global predictors, and explore their recursive estimation properties.For the special case of discrete-valued fields, I describe a convergent algorithm to identify the local predictors from empirical data, with minimal prior information about the field, and no distributional assumptions.
Fichier principal
Vignette du fichier
dmAB0102.pdf (199.64 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01183318 , version 1 (12-08-2015)



Cosma Rohilla Shalizi. Optimal Nonlinear Prediction of Random Fields on Networks. Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.11-30, ⟨10.46298/dmtcs.2310⟩. ⟨hal-01183318⟩


46 View
719 Download



Gmail Facebook X LinkedIn More