IDEAS home Printed from https://ideas.repec.org/a/taf/gmasxx/v49y2025i1p25-46.html
   My bibliography  Save this article

A local convergent ecological inference algorithm for RxC tables

Author

Listed:
  • Jose M. Pavía

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.

Suggested Citation

  • Jose M. Pavía, 2025. "A local convergent ecological inference algorithm for RxC tables," The Journal of Mathematical Sociology, Taylor & Francis Journals, vol. 49(1), pages 25-46, January.
  • Handle: RePEc:taf:gmasxx:v:49:y:2025:i:1:p:25-46
    DOI: 10.1080/0022250X.2024.2423943
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0022250X.2024.2423943
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0022250X.2024.2423943?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:gmasxx:v:49:y:2025:i:1:p:25-46. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/gmas .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.