Skip to main content

Change point estimation in high dimensional Markov random‐field models

Buy Article:

$43.00 + tax (Refund Policy)

The paper investigates a change point estimation problem in the context of high dimensional Markov random‐field models. Change points represent a key feature in many dynamically evolving network structures. The change point estimate is obtained by maximizing a profile penalized pseudolikelihood function under a sparsity assumption. We also derive a tight bound for the estimate, up to a logarithmic factor, even in settings where the number of possible edges in the network far exceeds the sample size. The performance of the estimator proposed is evaluated on synthetic data sets and is also used to explore voting patterns in the US Senate in the 1979–2012 period.
No References
No Citations
No Supplementary Data
No Article Media
No Metrics

Keywords: Change point analysis; High dimensional inference; Markov random fields; Network analysis; Profile pseudolikelihood

Document Type: Research Article

Publication date: 01 September 2017

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more