Inferring the dependence graph density of binary graphical models in high dimension
From MaRDI portal
Cites work
- Cesàro mean distribution of group automata starting from measures with summable decay
- Efficiently learning Ising models on arbitrary graphs (extended abstract)
- Ergodicity for spin systems with stirrings
- Estimating the interaction graph of stochastic neural dynamics
- Exploring complex networks
- Graphical modelling of multivariate time series
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- One-dimensional infinite memory imitation models with noise
- Processes with long memory: Regenerative construction and perfect simulation
- Regularized estimation in sparse high-dimensional time series models
- Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields
- Statistical inference for a partially observed interacting system of Hawkes processes
- Statistical inference versus mean field limit for Hawkes processes
- Two-Sample Inference for High-Dimensional Markov Networks
This page was built for publication: Inferring the dependence graph density of binary graphical models in high dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227006)