{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:46:05Z","timestamp":1753875965736,"version":"3.41.2"},"reference-count":54,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Robert Bosch Centre for Data Science and Artificial Intelligence","award":["CR1920BT618RBCX008947"],"award-info":[{"award-number":["CR1920BT618RBCX008947"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,20]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Link prediction between nodes is an important problem in the study of complex networks. In this work, we investigate determining directed links in conserved flow networks from data. A novel approach to predict the unknown links of an underlying conserved network, and the directions of flows associated with them are proposed. The directed link prediction is achieved by finding the missing values in the incidence matrix of the network by combining singular value decomposition, principal component analysis and tools from graph theory using steady-state flow data. In contrast to traditional integer optimization-based approaches, the proposed approach accomplishes the task of directed link prediction in cubic time. The methodology is corroborated via synthetic studies for flow data generated from networks based on Erd\u0151s\u2013R\u00e9nyi, Watts\u2013Strogatz and Barab\u00e1si\u2013Albert network models at different signal-to-noise ratios. It is empirically shown that all unknown directed links can be correctly predicted with large enough noisy data, in an asymptotic sense, to correctly estimate the missing values in the incidence matrix.<\/jats:p>","DOI":"10.1093\/comnet\/cnab037","type":"journal-article","created":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T21:33:37Z","timestamp":1633124017000},"source":"Crossref","is-referenced-by-count":1,"title":["Predicting unknown directed links of conserved networks from flow data"],"prefix":"10.1093","volume":"9","author":[{"given":"Satya Jayadev","family":"Pappu","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Robert of Centre for Data Science & Artificial Intelligence, and pCoE fro Network Systems Learning, Control and Evolution, Indian Institute of Technology Madras, Chennai - 600036, Tamil Nadu, India"}]},{"given":"Ramkrishna","family":"Pasumarthy","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Robert of Centre for Data Science & Artificial Intelligence, and pCoE fro Network Systems Learning, Control and Evolution, Indian Institute of Technology Madras, Chennai - 600036, Tamil Nadu, India"}]},{"given":"Nirav","family":"Bhatt","sequence":"additional","affiliation":[{"name":"Department of Biotechnology, Robert of Centre for Data Science & Artificial Intelligence, and pCoE fro Network Systems Learning, Control and Evolution, Indian Institute of Technology Madras, Chennai - 600036, Tamil Nadu, India"}]}],"member":"286","published-online":{"date-parts":[[2021,11,18]]},"reference":[{"key":"2021111813415514900_B1","doi-asserted-by":"crossref","first-page":"248101","DOI":"10.1103\/PhysRevLett.123.248101","article-title":"Phenotypes of vascular flow networks","volume":"123","author":"Ronellenfitsch,","year":"2019","journal-title":"Phys. Rev. Lett"},{"key":"2021111813415514900_B2","doi-asserted-by":"crossref","first-page":"035006","DOI":"10.1103\/RevModPhys.88.035006","article-title":"Control principles of complex systems","volume":"88","author":"Liu,","year":"2016","journal-title":"Rev. Mod. Phys."},{"key":"2021111813415514900_B3","doi-asserted-by":"crossref","first-page":"7234","DOI":"10.1073\/pnas.1617387114","article-title":"Structure-based control of complex networks with nonlinear dynamics","volume":"114","author":"Za\u00f1udo,","year":"2017","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021111813415514900_B4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/2487166.2487186","article-title":"Inferring connectivity model from meter measurements in distribution networks","volume-title":"Proceedings of the Fourth International Conference on Future Energy Systems","author":"Arya,","year":"2013"},{"key":"2021111813415514900_B5","doi-asserted-by":"crossref","first-page":"028701","DOI":"10.1103\/PhysRevLett.114.028701","article-title":"Robust reconstruction of complex networks from sparse data","volume":"114","author":"Han,","year":"2015","journal-title":"Phys. Rev. Lett."},{"key":"2021111813415514900_B6","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1038\/s41567-018-0076-1","article-title":"Network structure from rich but noisy data","volume":"14","author":"Newman,","year":"2018","journal-title":"Nat. Phys."},{"key":"2021111813415514900_B7","first-page":"041011","article-title":"Reconstructing networks with unknown and heterogeneous errors","volume":"8","author":"Peixoto,","year":"2018","journal-title":"Phys. Rev. X"},{"key":"2021111813415514900_B8","doi-asserted-by":"crossref","first-page":"22073","DOI":"10.1073\/pnas.0908366106","article-title":"Missing and spurious interactions and the reconstruction of complex networks","volume":"106","author":"Guimer\u00e0,","year":"2009","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021111813415514900_B9","first-page":"47","article-title":"The network completion problem: inferring missing nodes and edges in networks","volume-title":"Proceedings of the 2011 SIAM International Conference on Data Mining","author":"Kim,","year":"2011"},{"key":"2021111813415514900_B10","doi-asserted-by":"crossref","first-page":"043113","DOI":"10.1103\/PhysRevResearch.2.043113","article-title":"Link prediction with hyperbolic geometry","volume":"2","author":"Kitsak,","year":"2020","journal-title":"Phys. Rev. Res."},{"key":"2021111813415514900_B11","first-page":"1","article-title":"Link prediction in complex networks using information-theoretic measures","volume":"8","author":"Malhotra,","year":"2020","journal-title":"J. Complex Netw."},{"key":"2021111813415514900_B12","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1093\/comnet\/cnz007","article-title":"Discovering spurious links in multiplex networks based on interlayer relevance","volume":"7","author":"Samei,","year":"2019","journal-title":"J. Complex Netw."},{"key":"2021111813415514900_B13","doi-asserted-by":"crossref","first-page":"5113","DOI":"10.1109\/TSG.2017.2680542","article-title":"Identifying topology of low voltage distribution networks based on smart meter data","volume":"9","author":"Pappu,","year":"2018","journal-title":"IEEE Trans. Smart Grid"},{"key":"2021111813415514900_B14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1042\/bse0450161","article-title":"Network reconstruction based on steady-state data","volume":"45","author":"Wolkenhauer,","year":"2008","journal-title":"Essays Biochem."},{"key":"2021111813415514900_B15","first-page":"252","article-title":"Network flows: theory, algorithms and applications","volume":"41","author":"Ahuja,","year":"1995","journal-title":"ZOR-Methods Models Oper. Res."},{"article-title":"Learning conserved networks from flows","year":"2019","author":"Satya Jayadev,","key":"2021111813415514900_B16"},{"key":"2021111813415514900_B17","doi-asserted-by":"crossref","first-page":"010301","DOI":"10.1103\/PhysRevE.95.010301","article-title":"Reconstructing links in directed networks from noisy dynamics","volume":"95","author":"Ching,","year":"2017","journal-title":"Phys. Rev. E"},{"key":"2021111813415514900_B18","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","article-title":"Hierarchical structure and the prediction of missing links in networks","volume":"453","author":"Clauset,","year":"2008","journal-title":"Nature"},{"key":"2021111813415514900_B19","doi-asserted-by":"crossref","first-page":"23393","DOI":"10.1073\/pnas.1914950117","article-title":"Stacking models for nearly optimal link prediction in complex networks","volume":"117","author":"Ghasemian,","year":"2020","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021111813415514900_B20","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: a survey","volume":"390","author":"L\u00fc,","year":"2011","journal-title":"Physica A"},{"key":"2021111813415514900_B21","first-page":"69","article-title":"A survey of link prediction in complex networks","volume":"49","author":"Mart\u00ednez,","year":"2016","journal-title":"ACM Comput. Surv."},{"key":"2021111813415514900_B22","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-642-23783-6_28","article-title":"Link prediction via matrix factorization","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Menon,","year":"2011"},{"key":"2021111813415514900_B23","first-page":"1","article-title":"Link prediction in complex networks via matrix perturbation and decomposition","volume":"7","author":"Xu,","year":"2017","journal-title":"Sci. Rep."},{"key":"2021111813415514900_B24","first-page":"1","article-title":"An information-theoretic model for link prediction in complex networks","volume":"5","author":"Zhu,","year":"2015","journal-title":"Sci. Rep."},{"key":"2021111813415514900_B25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2180861.2180866","article-title":"Friendship prediction and homophily in social media","volume":"6","author":"Aiello,","year":"2012","journal-title":"ACM Trans. Web (TWEB)"},{"key":"2021111813415514900_B26","first-page":"1","article-title":"Similarity-based future common neighbors model for link prediction in complex networks","volume":"8","author":"Li,","year":"2018","journal-title":"Sci. Rep."},{"key":"2021111813415514900_B27","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Liben-Nowell,","year":"2007","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"key":"2021111813415514900_B28","doi-asserted-by":"crossref","first-page":"2019","DOI":"10.1145\/2783258.2788609","article-title":"Predicting future scientific discoveries based on a networked analysis of the past literature","volume-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Nagarajan,","year":"2015"},{"key":"2021111813415514900_B29","first-page":"42","article-title":"Finding experts by link prediction in co-authorship networks","author":"Pavlov,","year":"2007","journal-title":"Proceedings of the 2nd International Conference on Finding Experts on the Web with Semantics - Volume 290"},{"key":"2021111813415514900_B30","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.physa.2018.02.189","article-title":"Statistical similarity measures for link prediction in heterogeneous complex networks","volume":"501","author":"Shakibian,","year":"2018","journal-title":"Physica A"},{"key":"2021111813415514900_B31","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1038\/nbt.2601","article-title":"Network link prediction by global silencing of indirect correlations","volume":"31","author":"Barzel,","year":"2013","journal-title":"Nat. Biotechnol."},{"key":"2021111813415514900_B32","first-page":"1","article-title":"Homophily and missing links in citation networks","volume":"5","author":"Ciotti,","year":"2015","journal-title":"EPJ Data Sci."},{"key":"2021111813415514900_B33","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.physa.2018.06.051","article-title":"Link prediction in complex networks based on the interactions among paths","volume":"510","author":"Yao,","year":"2018","journal-title":"Physica A"},{"key":"2021111813415514900_B34","first-page":"141","article-title":"Link prediction approach to collaborative filtering","volume-title":"Proceedings of the 5th ACM\/IEEE-CS Joint Conference on Digital Libraries (JCDL\u201905)","author":"Chen,","year":"2005"},{"key":"2021111813415514900_B35","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/IJCNN.2011.6033365","article-title":"Graph-based features for supervised link prediction","volume-title":"The 2011 International Joint Conference on Neural Networks","author":"Cukierski,","year":"2011"},{"key":"2021111813415514900_B36","doi-asserted-by":"crossref","first-page":"38002","DOI":"10.1209\/0295-5075\/117\/38002","article-title":"Link prediction via matrix completion","volume":"117","author":"Pech,","year":"2017","journal-title":"EPL (Europhys. Lett.)"},{"volume-title":"Graph Theory with Applications to Engineering and Computer Science","year":"2017","author":"Deo,","key":"2021111813415514900_B37"},{"key":"2021111813415514900_B38","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2307\/2371127","article-title":"2-Isomorphic graphs","volume":"55","author":"Whitney,","year":"1933","journal-title":"Am. J. Math."},{"journal-title":"Lectures on Network Systems","year":"2020","author":"Bullo,","key":"2021111813415514900_B39"},{"key":"2021111813415514900_B40","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.sysconle.2015.08.013","article-title":"Modeling of physical network systems","volume":"101","author":"van der Schaft,","year":"2017","journal-title":"Syst.& Control Lett."},{"key":"2021111813415514900_B41","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.compchemeng.2015.03.016","article-title":"Deconstructing principal component analysis using a data reconciliation perspective","volume":"77","author":"Narasimhan,","year":"2015","journal-title":"Comput. Chem. Eng."},{"key":"2021111813415514900_B42","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.conengprac.2007.04.006","article-title":"Model identification and error covariance matrix estimation from noisy data using PCA","volume":"16","author":"Narasimhan,","year":"2008","journal-title":"Control Eng. Pract."},{"key":"2021111813415514900_B43","first-page":"1","article-title":"Singular value decomposition and principal component analysis","volume":"1","author":"Elsborg,","year":"2004","journal-title":"Neural Netw."},{"key":"2021111813415514900_B44","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/(SICI)1099-128X(199707)11:4<339::AID-CEM476>3.0.CO;2-L","article-title":"Maximum likelihood principal component analysis","volume":"11","author":"Wentzell,","year":"1997","journal-title":"J. Chemom."},{"key":"2021111813415514900_B45","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear-time algorithm for graph realization","volume":"13","author":"Bixby,","year":"1988","journal-title":"Math. Oper. Res."},{"volume-title":"Matrix Computations","year":"2012","author":"Golub,","key":"2021111813415514900_B46"},{"volume-title":"Linear Algebra","year":"1995","author":"Fraleigh,","key":"2021111813415514900_B47"},{"key":"2021111813415514900_B48","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert,","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"2021111813415514900_B49","doi-asserted-by":"crossref","first-page":"2720","DOI":"10.1109\/ACC.2007.4282913","article-title":"LMI-based algorithm for the reconstruction of biological networks","volume-title":"2007 American Control Conference","author":"Amato,","year":"2007"},{"key":"2021111813415514900_B50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1752-0509-3-25","article-title":"Efficient, sparse biological network determination","volume":"3","author":"August,","year":"2009","journal-title":"BMC Syst. Biol."},{"key":"2021111813415514900_B51","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1016\/j.automatica.2011.02.006","article-title":"Inferring stable genetic networks from steady-state data","volume":"47","author":"Zavlanos,","year":"2011","journal-title":"Automatica"},{"key":"2021111813415514900_B52","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107279667","volume-title":"Optimization Models","author":"Calafiore,","year":"2014"},{"key":"2021111813415514900_B53","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/CACSD.2004.1393890","article-title":"YALMIP: a toolbox for modeling and optimization in MATLAB","volume-title":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No. 04CH37508)","author":"Lofberg,","year":"2004"},{"key":"2021111813415514900_B54","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-1-4757-1904-8_7","article-title":"Principal component analysis and factor analysis","volume-title":"Principal Component Analysis.","author":"Jolliffe,","year":"1986"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/9\/6\/cnab037\/41174787\/cnab037.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/9\/6\/cnab037\/41174787\/cnab037.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:45:40Z","timestamp":1637243140000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnab037\/6431016"}},"subtitle":[],"editor":[{"given":"Tiago P","family":"Peixoto","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,10,20]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,10,20]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnab037","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2021,12,1]]},"published":{"date-parts":[[2021,10,20]]},"article-number":"cnab037"}}