IDEAS home Printed from https://ideas.repec.org/a/oup/biomet/v109y2022i3p721-734..html
   My bibliography  Save this article

Local linear graphon estimation using covariates
[Representations for partially exchangeable arrays of random variables]

Author

Listed:
  • S Chandna
  • S C Olhede
  • P J Wolfe

Abstract

SummaryWe consider local linear estimation of the graphon function, which determines probabilities of pairwise edges between nodes in an unlabelled network. Real-world networks are typically characterized by node heterogeneity, with different nodes exhibiting different degrees of interaction. Existing approaches to graphon estimation are limited to local constant approximations, and are not designed to estimate heterogeneity across the full network. In this paper, we show how continuous node covariates can be employed to estimate heterogeneity in the network via a local linear graphon estimator. We derive the bias and variance of an oracle-based local linear graphon estimator, and thus obtain the mean integrated squared error optimal bandwidth rule. We also provide a plug-in bandwidth selection procedure that makes local linear estimation for unlabelled networks practically feasible. The finite-sample performance of our approach is investigated in a simulation study, and the method is applied to a school friendship network and an email network to illustrate its advantages over existing methods.

Suggested Citation

  • S Chandna & S C Olhede & P J Wolfe, 2022. "Local linear graphon estimation using covariates [Representations for partially exchangeable arrays of random variables]," Biometrika, Biometrika Trust, vol. 109(3), pages 721-734.
    • Handle: RePEc:oup:biomet:v:109:y:2022:i:3:p:721-734.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/biomet/asab057
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    References listed on IDEAS

    as
    1. Yuan Zhang & Elizaveta Levina & Ji Zhu, 2017. "Estimating network edge probabilities by neighbourhood smoothing," Biometrika, Biometrika Trust, vol. 104(4), pages 771-783.
    2. Bailey K. Fosdick & Peter D. Hoff, 2015. "Testing and Modeling Dependencies Between a Network and Nodal Attributes," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 110(511), pages 1047-1056, September.
    3. Aldous, David J., 1981. "Representations for partially exchangeable arrays of random variables," Journal of Multivariate Analysis, Elsevier, vol. 11(4), pages 581-598, December.
    4. Hardle, W. & Marron, J. S., 1995. "Fast and simple scatterplot smoothing," Computational Statistics & Data Analysis, Elsevier, vol. 20(1), pages 1-17, July.
    5. Hoff P.D. & Raftery A.E. & Handcock M.S., 2002. "Latent Space Approaches to Social Network Analysis," Journal of the American Statistical Association, American Statistical Association, vol. 97, pages 1090-1098, December.
    6. Ting Yan & Binyan Jiang & Stephen E. Fienberg & Chenlei Leng, 2019. "Statistical Inference in a Directed Network Model With Covariates," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 114(526), pages 857-868, April.
    7. Patrick O. Perry & Patrick J. Wolfe, 2013. "Point process modelling for directed interaction networks," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 75(5), pages 821-849, November.
    8. N. Binkiewicz & J. T. Vogelstein & K. Rohe, 2017. "Covariate-assisted spectral clustering," Biometrika, Biometrika Trust, vol. 104(2), pages 361-377.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lucy L. Gao & Daniela Witten & Jacob Bien, 2022. "Testing for association in multiview network data," Biometrics, The International Biometric Society, vol. 78(3), pages 1018-1030, September.
    2. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    3. Samrachana Adhikari & Tracy Sweet & Brian Junker, 2021. "Analysis of longitudinal advice‐seeking networks following implementation of high stakes testing," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 184(4), pages 1475-1500, October.
    4. Chen, Mingli & Fernández-Val, Iván & Weidner, Martin, 2021. "Nonlinear factor models for network and panel data," Journal of Econometrics, Elsevier, vol. 220(2), pages 296-324.
    5. Cornelius Fritz & Michael Lebacher & Göran Kauermann, 2020. "Tempus volat, hora fugit: A survey of tie‐oriented dynamic network models in discrete and continuous time," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 74(3), pages 275-299, August.
    6. Qiuping Wang & Yuan Zhang & Ting Yan, 2023. "Asymptotic theory in network models with covariates and a growing number of node parameters," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 75(2), pages 369-392, April.
    7. Ma, Shujie & Su, Liangjun & Zhang, Yichong, 2020. "Detecting Latent Communities in Network Formation Models," Economics and Statistics Working Papers 12-2020, Singapore Management University, School of Economics.
    8. Bryan S. Graham, 2019. "Network Data," Papers 1912.06346, arXiv.org.
    9. Fengqin Tang & Chunning Wang & Jinxia Su & Yuanyuan Wang, 2020. "Spectral clustering-based community detection using graph distance and node attributes," Computational Statistics, Springer, vol. 35(1), pages 69-94, March.
    10. Wei Zhao & S.N. Lahiri, 2022. "Estimation of the Parameters in an Expanding Dynamic Network Model," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 84(1), pages 261-282, June.
    11. François Caron & Emily B. Fox, 2017. "Sparse graphs using exchangeable random measures," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(5), pages 1295-1366, November.
    12. Junhui Cai & Dan Yang & Wu Zhu & Haipeng Shen & Linda Zhao, 2021. "Network regression and supervised centrality estimation," Papers 2111.12921, arXiv.org.
    13. Babkin, Sergii & Stewart, Jonathan R. & Long, Xiaochen & Schweinberger, Michael, 2020. "Large-scale estimation of random graph models with local dependence," Computational Statistics & Data Analysis, Elsevier, vol. 152(C).
    14. Volfovsky, Alexander & Airoldi, Edoardo M., 2016. "Sharp total variation bounds for finitely exchangeable arrays," Statistics & Probability Letters, Elsevier, vol. 114(C), pages 54-59.
    15. Junlong Zhao & Xiumin Liu & Hansheng Wang & Chenlei Leng, 2022. "Dimension reduction for covariates in network data [On semidefinite relaxations for the block model]," Biometrika, Biometrika Trust, vol. 109(1), pages 85-102.
    16. Federica Bianchi & Francesco Bartolucci & Stefano Peluso & Antonietta Mira, 2020. "Longitudinal networks of dyadic relationships using latent trajectories: evidence from the European interbank market," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 69(4), pages 711-739, August.
    17. Peter D. Hoff, 2009. "Multiplicative latent factor models for description and prediction of social networks," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 261-272, December.
    18. Tadao Hoshino, 2020. "A Pairwise Strategic Network Formation Model with Group Heterogeneity: With an Application to International Travel," Papers 2012.14886, arXiv.org, revised Feb 2021.
    19. Robert Lunde & Purnamrita Sarkar, 2023. "Subsampling sparse graphons under minimal assumptions," Biometrika, Biometrika Trust, vol. 110(1), pages 15-32.
    20. Long, Yuhang & Huang, Tao, 2022. "A note on a dynamic network model with homogeneous structure," Statistics & Probability Letters, Elsevier, vol. 184(C).

    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:oup:biomet:v:109:y:2022:i:3:p:721-734.. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/biomet .

    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.