Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:1911.00082

Help | Advanced Search

Statistics > Methodology

arXiv:1911.00082 (stat)
[Submitted on 31 Oct 2019 (v1) , last revised 25 May 2023 (this version, v3)]

Title: Regression of binary network data with exchangeable latent errors

Title: 具有可交换潜在误差的二元网络数据回归

Authors:Frank W. Marrs, Bailey K. Fosdick
Abstract: Undirected, binary network data consist of indicators of symmetric relations between pairs of actors. Regression models of such data allow for the estimation of effects of exogenous covariates on the network and for prediction of unobserved data. Ideally, estimators of the regression parameters should account for the inherent dependencies among relations in the network that involve the same actor. To account for such dependencies, researchers have developed a host of latent variable network models, however, estimation of many latent variable network models is computationally onerous and which model is best to base inference upon may not be clear. We propose the Probit Exchangeable (PX) model for undirected binary network data that is based on an assumption of exchangeability, which is common to many of the latent variable network models in the literature. The PX model can represent the first two moments of any exchangeable network model. We leverage the EM algorithm to obtain an approximate maximum likelihood estimator of the PX model that is extremely computationally efficient. Using simulation studies, we demonstrate the improvement in estimation of regression coefficients of the proposed model over existing latent variable network models. In an analysis of purchases of politically-aligned books, we demonstrate political polarization in purchase behavior and show that the proposed estimator significantly reduces runtime relative to estimators of latent variable network models, while maintaining predictive performance.
Abstract: 无向二元网络数据由行为者对之间的对称关系指示数组成。 此类数据的回归模型允许估计外生协变量对网络的影响以及未观察到的数据的预测。 理想情况下,回归参数的估计量应考虑网络中涉及相同行为者的内在关系依赖性。 为了考虑这些依赖性,研究者开发了许多潜在变量网络模型,然而,许多潜在变量网络模型的估计计算复杂度较高,并且不清楚哪种模型最适合用于推断。 我们提出了基于可交换性假设的Probit交换模型(PX模型),该假设在文献中的许多潜在变量网络模型中都很常见。 PX模型可以表示任何可交换网络模型的前两个矩。 我们利用EM算法获得PX模型的近似最大似然估计量,该估计量极其计算高效。 通过模拟研究,我们展示了所提出模型的回归系数估计相较于现有潜在变量网络模型的改进。 在对政治倾向书籍购买行为的分析中,我们展示了购买行为中的政治极化现象,并表明所提出的估计器相对于潜在变量网络模型的估计器显著减少了运行时间,同时保持了预测性能。
Subjects: Methodology (stat.ME)
Cite as: arXiv:1911.00082 [stat.ME]
  (or arXiv:1911.00082v3 [stat.ME] for this version)
  https://doi.org/10.48550/arXiv.1911.00082
arXiv-issued DOI via DataCite

Submission history

From: Frank Marrs [view email]
[v1] Thu, 31 Oct 2019 19:55:02 UTC (4,289 KB)
[v2] Mon, 3 Feb 2020 17:22:56 UTC (1,945 KB)
[v3] Thu, 25 May 2023 19:28:30 UTC (2,181 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
stat.ME
< prev   |   next >
new | recent | 2019-11
Change to browse by:
stat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号