2011
DOI: 10.1198/jasa.2011.tm10747
|View full text |Cite
|
Sign up to set email alerts
|

Instability, Sensitivity, and Degeneracy of Discrete Exponential Families

Abstract: In applications to dependent data, first and foremost relational data, a number of discrete exponential family models has turned out to be near-degenerate and problematic in terms of Markov chain Monte Carlo simulation and statistical inference. We introduce the notion of instability with an eye to characterize, detect, and penalize discrete exponential family models that are near-degenerate and problematic in terms of Markov chain Monte Carlo simulation and statistical inference. We show that unstable discret… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

6
164
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 125 publications
(170 citation statements)
references
References 16 publications
6
164
0
Order By: Relevance
“…The distinction is based on whether the status of one dyad influences the status of others. Dyad dependence should be modeled with care, as the patterns it induces can cascade through the network in unexpected ways, and poorly specified models can often lead to an outcome known as “model degeneracy” (Handcock, Robins, Snijders, Moody, and Besag 2003; Schweinberger 2011). With networks of any non-trivial size, κ ( θ ) may not be calculated analytically, and therefore simulation-based estimation procedures (MCMC) are used.…”
Section: Network Modeling Frameworkmentioning
confidence: 99%
“…The distinction is based on whether the status of one dyad influences the status of others. Dyad dependence should be modeled with care, as the patterns it induces can cascade through the network in unexpected ways, and poorly specified models can often lead to an outcome known as “model degeneracy” (Handcock, Robins, Snijders, Moody, and Besag 2003; Schweinberger 2011). With networks of any non-trivial size, κ ( θ ) may not be calculated analytically, and therefore simulation-based estimation procedures (MCMC) are used.…”
Section: Network Modeling Frameworkmentioning
confidence: 99%
“…Two empirical examples are presented in Sections 8.2 and 8.3. Theoretical results can be found in Handcock (2003), Schweinberger (2011), and Chatterjee and Diaconis (2013). Models with global dependence are not useful, because many real-world networks do not resemble graphs that have almost no edges or almost all possible edges.…”
Section: Local Dependencementioning
confidence: 99%
“…These informal statements can be backed up by formal results: Schweinberger and Stewart (2017) proved that a wide range of ERGMs with local dependence are non-degenerate as long as the sizes of neighborhoods are either bounded above or grow slowly with the number of neighborhoods. In contrast, many ERGMs with global dependence are known to be near-degenerate (e.g., Handcock 2003;Schweinberger 2011;Chatterjee and Diaconis 2013). While some ERGMs with global dependence, such as ERGMs with geometrically weighted model terms (Snijders et al 2006;Hunter and Handcock 2006), have turned out to be useful in applications, there are no mathematical results that show whether, and under which conditions, such ERGMs are non-degenerate as the size of the network increases.…”
Section: Probabilistic Appealmentioning
confidence: 99%
See 2 more Smart Citations