IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v193y2024ics0167947323002268.html
   My bibliography  Save this article

Generalized latent space model for one-mode networks with awareness of two-mode networks

Author

Listed:
  • Fan, Xinyan
  • Fang, Kuangnan
  • Pu, Dan
  • Qin, Ruixuan

Abstract

Latent space models have been widely studied for one-mode networks, in which the same type of nodes connect with each other. In many applications, one-mode networks are often observed along with two-mode networks, which reflect connections between different types of nodes and provide important information for understanding the one-mode network structure. However, the classical one-mode latent space models have several limitations in incorporating two-mode networks. To address this gap, a generalized latent space model is proposed to capture common structures and heterogeneous connecting patterns across one-mode and two-mode networks. Specifically, each node is embedded with a latent vector and network-specific degree parameters that determine the connection probabilities between nodes. A projected gradient descent algorithm is developed to estimate the latent vectors and degree parameters. Moreover, the theoretical properties of the estimators are established and it has been proven that the estimation accuracy of the shared latent vectors can be improved through incorporating two-mode networks. Finally, simulation studies and applications on two real-world datasets demonstrate the usefulness of the proposed model.

Suggested Citation

  • Fan, Xinyan & Fang, Kuangnan & Pu, Dan & Qin, Ruixuan, 2024. "Generalized latent space model for one-mode networks with awareness of two-mode networks," Computational Statistics & Data Analysis, Elsevier, vol. 193(C).
  • Handle: RePEc:eee:csdana:v:193:y:2024:i:c:s0167947323002268
    DOI: 10.1016/j.csda.2023.107915
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947323002268
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2023.107915?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.

    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:eee:csdana:v:193:y:2024:i:c:s0167947323002268. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.