2018
DOI: 10.1214/18-aoas1164
|View full text |Cite
|
Sign up to set email alerts
|

Loglinear model selection and human mobility

Abstract: Methods for selecting loglinear models were among Steve Fienberg's research interests since the start of his long and fruitful career. After we dwell upon the string of papers focusing on loglinear models that can be partly attributed to Steve's contributions and influential ideas, we develop a new algorithm for selecting graphical loglinear models that is suitable for analyzing hyper-sparse contingency tables. We show how multi-way contingency tables can be used to represent patterns of human mobility. We ana… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

4
4

Authors

Journals

citations
Cited by 16 publications
(23 citation statements)
references
References 84 publications
(125 reference statements)
0
23
0
Order By: Relevance
“…In this paper we make use of a Bayesian framework for solving the structural learning problem that is suitable for the analysis of hyper-sparse contingency tables with p = 48 variables. This framework [70] determines graphical loglinear models that are a special type of hierarchical loglinear models [8, 9]. A graphical model for a random vector X = ( X 1 , X 2 , …, X p ) is specified by an undirected graph G = ( V , E ) where V = {1, …, p } are vertices or nodes, and E ⊂ V × V are edges or links [9].…”
Section: Methodsmentioning
confidence: 99%
“…In this paper we make use of a Bayesian framework for solving the structural learning problem that is suitable for the analysis of hyper-sparse contingency tables with p = 48 variables. This framework [70] determines graphical loglinear models that are a special type of hierarchical loglinear models [8, 9]. A graphical model for a random vector X = ( X 1 , X 2 , …, X p ) is specified by an undirected graph G = ( V , E ) where V = {1, …, p } are vertices or nodes, and E ⊂ V × V are edges or links [9].…”
Section: Methodsmentioning
confidence: 99%
“…We do not apply thinning. The Bayesian copula method is implemented using the R package, BDGraph Wit, 2015, 2017;Dobra and Mohammadi, 2017;Mohammadi and Wit, 2018) using the option "gcgm". Posterior graph selection is done using Bayesian model averaging, the default option in the BDGraph package, in which it selects the graph with links for which their estimated posterior probabilities are greater than 0.5.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Selection of hierarchical loglinear models has been widely discussed in the statistical literature [21,19,1,57]. More recent approaches that work well for high-dimensional sparse contingency tables involve Bayesian Markov chain Monte Carlo (MCMC) algorithms [39,40,41,13,51,14,16,15,17].…”
Section: Approachmentioning
confidence: 99%