A local convergent ecological inference algorithm for RxC tables

Over the years, a number of methods have been proposed to forecast the unknown inner-cell values of a set of related RxC contingency tables when only their margins are known. This is a classical problem that emerges in many areas, from economics to quantitative history, being particularly ubiquitous when dealing with electoral data in sociology and political science. However, the two current major algorithms to solve this problem, based on Bayesian statistics and iterative linear programming depend on adjustable (hyper-)parameters and do not yield a unique solution: their estimates tend to fluctuate (when convergence is reached) around a stationary distribution. Within the linear programming framework, this paper proposes a new algorithm (lclphom) that always converges to a unique solution, having no adjustable parameters. This characteristic makes it easy to use and robust to claims of hacking. Furthermore, after assessing lclphom with real and simulated data, lclphom is found to yield estimates of (almost) similar accuracy to the current major solutions, being more preferable to the other lphom-family algorithms the more heterogeneous the row-fraction distributions of the tables are. Interested practitioners can easily use this new algorithm as it has been programmed in the R-package lphom.

Authors

Institutions

Publication Details

Journal
Journal of Mathematical Sociology
Published
2024-11-10
DOI
https://doi.org/10.1080/0022250x.2024.2423943
Citations
1
Primary Topic
Metabolomics and Mass Spectrometry Studies
Type
article
Field-Weighted Citation Impact
0.23

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A local convergent ecological inference algorithm for RxC tables

José M. Pavía
1 citations
Journal of Mathematical Sociology
Metabolomics and Mass Spectrometry Studies
0.23
article

A local convergent ecological inference algorithm for RxC tables

José M. Pavía
article en
1 citations

Abstract

Over the years, a number of methods have been proposed to forecast the unknown inner-cell values of a set of related RxC contingency tables when only their margins are known. This is a classical problem that emerges in many areas, from economics to quantitative history, being particularly ubiquitous when dealing with electoral data in sociology and political science. However, the two current major algorithms to solve this problem, based on Bayesian statistics and iterative linear programming depend on adjustable (hyper-)parameters and do not yield a unique solution: their estimates tend to fluctuate (when convergence is reached) around a stationary distribution. Within the linear programming framework, this paper proposes a new algorithm (lclphom) that always converges to a unique solution, having no adjustable parameters. This characteristic makes it easy to use and robust to claims of hacking. Furthermore, after assessing lclphom with real and simulated data, lclphom is found to yield estimates of (almost) similar accuracy to the current major solutions, being more preferable to the other lphom-family algorithms the more heterogeneous the row-fraction distributions of the tables are. Interested practitioners can easily use this new algorithm as it has been programmed in the R-package lphom.

Journal of Mathematical SociologyVol. 49(1)
Universitat de València (ES)
Ministerio de Ciencia e Innovación
Openalex Percentile: Top 41%
Metabolomics and Mass Spectrometry Studies
0.23
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.