Journal of the Royal Statistical Society Series B (Statistical Methodology) · 2016 · 48 citations · 45 references
EngineeringPolitical ScienceBayesian Data AnalysisSpatial StatisticsStochastic ProcessesBayesian InferenceBayesian StatisticsMarkov ChainsMarkov ProcessesStatistical InferenceStochastic NetworksChange-point EstimationJudicial Voting PatternsMarkov Random Field ModelsNetwork Data StructuresPoint EstimatePseudo-likelihood EstimationSparsity ConstraintsSparsity Priors
This 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 pseudo-likelihood 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 proposed estimator is evaluated on synthetic data sets and is also used to explore voting patterns in the US Senate in the 1979-2012 period.
45
High dimensional graphs and variable selection with the Lasso
2006 · 2.7K citations
High-dimensional graphs and variable selection with the Lasso
The Annals of Statistics · 2006 · 2.5K citations · Full text