{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:11:08Z","timestamp":1770963068461,"version":"3.50.1"},"reference-count":58,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72101265"],"award-info":[{"award-number":["72101265"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72401286"],"award-info":[{"award-number":["72401286"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>To overcome the limitations of current link prediction methods in effectively leveraging topological information and node importance, this paper introduces a new model called AMPS (Adaptive Multi-scale Potential-enhanced Path Similarity). The model is built on a hierarchical structure that captures both global network topology and local interaction patterns, with full compatibility for directed and undirected networks. This is achieved through a process that quantifies node potential fields, enhances multi-scale similarity, and fuses information across scales. Specifically, we define three types of potential field models, global, local, and k-hop, to flexibly measure node importance. We also introduce two complementary prediction modules: an enhanced common neighbor matrix (PCN), which uses potential fields to refine local structural details, and a feature-weighted generalized path similarity (GLP), which integrates node importance into path evaluation. The final similarity score is obtained by adaptively combining the outputs of PCN and GLP. Experiments on 12 undirected datasets and 9 directed datasets demonstrate that AMPS significantly outperforms other mainstream algorithms in terms of the AUC metric. It also exhibits strong robustness under varying training set ratios, maintaining stable advantages in both directed and undirected scenarios. This framework provides a physically intuitive, topology-aware, and high-precision solution for link prediction across various types of networks.<\/jats:p>","DOI":"10.3390\/bdcc10020048","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T13:58:49Z","timestamp":1770127129000},"page":"48","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["AMPS: A Direction-Aware Adaptive Multi-Scale Potential Model for Link Prediction in Complex Networks"],"prefix":"10.3390","volume":"10","author":[{"given":"Xinghua","family":"Qin","sequence":"first","affiliation":[{"name":"Department of Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6116-0569","authenticated-orcid":false,"given":"Sizheng","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengmeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yirun","family":"Ruan","sequence":"additional","affiliation":[{"name":"Department of Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3334","DOI":"10.1121\/10.0019748","article-title":"A Spectrally Discretized Wide-Angle Parabolic Equation Model for Simulating Acoustic Propagation in Laterally Inhomogeneous Oceans","volume":"153","author":"Tu","year":"2023","journal-title":"J. Acoust. Soc. Am."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"6905","DOI":"10.1038\/s41598-023-34055-5","article-title":"A Link Prediction-Based Recommendation System Using Transactional Data","volume":"13","author":"Yilmaz","year":"2023","journal-title":"Sci. Rep."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1007\/s10994-023-06475-x","article-title":"Temporal Graph Learning for Dynamic Link Prediction with Text in Online Social Networks","volume":"113","author":"Dileo","year":"2024","journal-title":"Mach. Learn."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"130672","DOI":"10.1016\/j.physa.2025.130672","article-title":"A Novel Probabilistic Connectivity Network Link Prediction Model for Natural Gas Price Based on an Improved K-Shell Algorithm","volume":"671","author":"Liu","year":"2025","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"nwae073","DOI":"10.1093\/nsr\/nwae073","article-title":"Beyond network centrality: Individual-level behavioral traits for predicting information superspreaders in social media","volume":"11","author":"Zhou","year":"2024","journal-title":"Natl. Sci. Rev."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"101079","DOI":"10.1016\/j.joi.2020.101079","article-title":"Predicting Scientific Research Trends Based on Link Prediction in Keyword Networks","volume":"14","author":"Behrouzi","year":"2020","journal-title":"J. Informetr."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"123035","DOI":"10.1016\/j.oceaneng.2025.123035","article-title":"Application of a Spectral Scheme for Simulating Slowly Horizontally Varying Three-Dimensional Ocean Acoustic Propagation","volume":"343","author":"Tu","year":"2026","journal-title":"Ocean. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","article-title":"Clustering and Preferential Attachment in Growing Networks","volume":"64","author":"Newman","year":"2001","journal-title":"Phys. Rev. E"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and Neighbors on the Web","volume":"25","author":"Adamic","year":"2003","journal-title":"Soc. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of Scaling in Random Networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting Missing Links via Local Information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A New Status Index Derived from Sociometric Analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01164627","article-title":"Resistance Distance","volume":"12","author":"Klein","year":"1993","journal-title":"J. Math. Chem."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"101606","DOI":"10.1016\/j.jocs.2022.101606","article-title":"MNERLP-MUL: Merged Node and Edge Relevance Based Link Prediction in Multiplex Networks","volume":"60","author":"Mishra","year":"2022","journal-title":"J. Comput. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"114046","DOI":"10.1016\/j.chaos.2023.114046","article-title":"A Novel Similarity-Based Parameterized Method for Link Prediction","volume":"175","author":"Rai","year":"2023","journal-title":"Chaos Solitons Fractals"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"122051","DOI":"10.1016\/j.ins.2025.122051","article-title":"A General Link Prediction Method Based on Path Node Information and Source Node Information","volume":"709","author":"Kong","year":"2025","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"102513","DOI":"10.1016\/j.jocs.2024.102513","article-title":"CICN: Higher-Order Link Prediction with Clustering Mutual Information of Common Neighbors","volume":"85","author":"Yao","year":"2025","journal-title":"J. Comput. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"126284","DOI":"10.1016\/j.eswa.2024.126284","article-title":"Simplicial Motif Predictor Method for Higher-Order Link Prediction","volume":"269","author":"Yang","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3793","DOI":"10.1007\/s12065-024-00958-z","article-title":"Rb-Based: Link Prediction Based on the Resource Broadcast of Nodes for Complex Networks","volume":"17","author":"Liu","year":"2024","journal-title":"Evol. Intel."},{"key":"ref_20","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":"ref_21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0378-8733(92)90017-2","article-title":"Building Stochastic Blockmodels","volume":"14","author":"Anderson","year":"1992","journal-title":"Soc. Netw."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"22955","DOI":"10.1038\/srep22955","article-title":"Predicting Missing Links and Identifying Spurious Links via Likelihood Analysis","volume":"6","author":"Pan","year":"2016","journal-title":"Sci. Rep."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., and Skiena, S. (2014, January 24\u201327). DeepWalk: Online Learning of Social Representations. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623732"},{"key":"ref_24","first-page":"855","article-title":"Node2vec: Scalable Feature Learning for Networks","volume":"2016","author":"Grover","year":"2016","journal-title":"Knowl. Discov. Databases"},{"key":"ref_25","unstructured":"Zhang, M., and Chen, Y. (2018). Link Prediction Based on Graph Neural Networks. Proceedings of the Advances in Neural Information Processing Systems, Montreal, QC, Canada, 3\u20138 December 2018, Curran Associates, Inc."},{"key":"ref_26","first-page":"100802","article-title":"SEAL+: A Subgraph-Enhanced Framework for Link Prediction with Graph Neural Networks","volume":"44","author":"Karami","year":"2025","journal-title":"J. Ind. Inf. Integr."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"126292","DOI":"10.1016\/j.eswa.2024.126292","article-title":"GLC: A Dual-Perspective Approach for Identifying Influential Nodes in Complex Networks","volume":"268","author":"Ruan","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1140\/epjb\/s10051-020-00037-z","article-title":"A Degree-Related and Link Clustering Coefficient Approach for Link Prediction in Complex Networks","volume":"94","author":"Wang","year":"2021","journal-title":"Eur. Phys. J. B"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1016\/j.ins.2022.07.030","article-title":"Link Prediction Algorithm Based on the Initial Information Contribution of Nodes","volume":"608","author":"Liu","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"124980","DOI":"10.1016\/j.physa.2020.124980","article-title":"Link Prediction Using Node Information on Local Paths","volume":"557","author":"Aziz","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physa.2016.01.038","article-title":"Link Prediction with Node Clustering Coefficient","volume":"452","author":"Wu","year":"2016","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Hu, J., Han, Y., and Hu, J. (2010, January 15\u201316). Topological Potential: Modeling Node Importance with Activity and Local Effect in Complex Networks. Proceedings of the 2010 Second International Conference on Computer Modeling and Simulation, Cambridge, UK.","DOI":"10.1109\/ICCMS.2010.192"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"122926","DOI":"10.1016\/j.physa.2019.122926","article-title":"Identifying Critical Nodes in Metro Network Considering Topological Potential: A Case Study in Shenzhen City\u2014China","volume":"539","author":"Du","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.comcom.2023.11.003","article-title":"Key Node Identification in Social Networks Based on Topological Potential Model","volume":"213","author":"Zhang","year":"2024","journal-title":"Comput. Commun."},{"key":"ref_35","unstructured":"Feng, J., Chen, Y., Li, F., Sarkar, A., and Zhang, M. (2023). How Powerful Are K-Hop Message Passing Graph Neural Networks. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1093\/comjnl\/bxac157","article-title":"Link Prediction Based on Local Structure and Node Information Along Local Paths","volume":"67","author":"Li","year":"2024","journal-title":"Comput. J."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"507386","DOI":"10.1155\/2015\/507386","article-title":"Identifying Missing and Spurious Interactions in Directed Networks","volume":"11","author":"Zhang","year":"2015","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Zhang, Q.-M., L\u00fc, L., Wang, W.-Q., Yu, X., and Zhou, T. (2013). Potential Theory for Directed Networks. PLoS ONE, 8.","DOI":"10.1371\/annotation\/6dff4052-f7c3-4b0a-88da-85cdd5d3addd"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Nandini, Y.V., Lakshmi, T.J., Enduri, M.K., and Sharma, H. (2024). Link Prediction in Complex Networks Using Average Centrality-Based Similarity Score. Entropy, 26.","DOI":"10.3390\/e26060433"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An Information Flow Model for Conflict and Fission in Small Groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Kunegis, J. (2013). KONECT: The Koblenz Network Collection. Proceedings of the 22nd International Conference on World Wide Web, Rio de Janeiro, Brazil, 13\u201317 May 2013, ACM.","DOI":"10.1145\/2487788.2488173"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","article-title":"Community Structure in Jazz","volume":"6","author":"Gleiser","year":"2003","journal-title":"Advs. Complex Syst."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","article-title":"What\u2019s in a Crowd? Analysis of Face-to-Face Behavioral Networks","volume":"271","author":"Isella","year":"2011","journal-title":"J. Theor. Biol."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"027104","DOI":"10.1103\/PhysRevE.72.027104","article-title":"Community Detection in Complex Networks Using Extremal Optimization","volume":"72","author":"Duch","year":"2005","journal-title":"Phys. Rev. E"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"9277","DOI":"10.1609\/aaai.v29i1.9277","article-title":"The Network Data Repository with Interactive Graph Analytics and Visualization","volume":"29","author":"Rossi","year":"2015","journal-title":"AAAI"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","article-title":"Self-Similar Community Structure in Organisations","volume":"68","author":"Guimera","year":"2003","journal-title":"Phys. Rev. E"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Adamic, L., Labs, H., Glance, N., and Blvd, B. (2005, January 21\u201325). The Political Blogosphere and the 2004 U.S. Election: Divided They Blog. Proceedings of the 3rd International Workshop on Link Discovery, Chicago, IL, USA.","DOI":"10.1145\/1134271.1134277"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"2443","DOI":"10.1093\/nar\/gkg340","article-title":"Topological Structure Analysis of the Protein-Protein Interaction Network in Budding Yeast","volume":"31","author":"Bu","year":"2003","journal-title":"Nucleic Acids Res."},{"key":"ref_49","unstructured":"Qiao, H. (2025, October 18). Fengduqianhe\/GraphEmbedding-Master 2025. Available online: https:\/\/github.com\/fengduqianhe\/GraphEmbedding-master."},{"key":"ref_50","unstructured":"(2025, October 18). Openflights|Infrastructure Networks|Network Data Repository. Available online: https:\/\/networkrepository.com\/inf-openflights.php."},{"key":"ref_51","unstructured":"(2025, October 18). Chess. Available online: http:\/\/www.konect.cc\/networks\/chess\/."},{"key":"ref_52","unstructured":"(2025, November 19). Introduction to Mathematical Sociology|Princeton University Press. Available online: https:\/\/press.princeton.edu\/books\/hardcover\/9780691145495\/introduction-to-mathematical-sociology."},{"key":"ref_53","unstructured":"Batagelj, V., and Mrvar, A. (October, January 29). Pajek\u2014Analysis and Visualization of Large Networks. Proceedings of the International Symposium on Graph Drawing, New York, NY, USA."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"253","DOI":"10.2307\/2785979","article-title":"The Diffusion of an Innovation Among Physicians","volume":"20","author":"Coleman","year":"1957","journal-title":"Sociometry"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-21863-7_17","article-title":"Matching Organizational Structure and Social Network Extracted from Email Communication","volume":"Volume 87","author":"Abramowicz","year":"2011","journal-title":"Business Information Systems"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., and Kleinberg, J. (2010). Predicting Positive and Negative Links in Online Social Networks. arXiv.","DOI":"10.1145\/1772690.1772756"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0378-8733(01)00042-9","article-title":"Peer Influence Groups: Identifying Dense Clusters in Large Networks","volume":"23","author":"Moody","year":"2001","journal-title":"Soc. Netw."},{"key":"ref_58","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":"Zhou","year":"2011","journal-title":"Phys. A Stat. Mech. Its Appl."}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/10\/2\/48\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T05:19:09Z","timestamp":1770959949000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/10\/2\/48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,3]]},"references-count":58,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["bdcc10020048"],"URL":"https:\/\/doi.org\/10.3390\/bdcc10020048","relation":{},"ISSN":["2504-2289"],"issn-type":[{"value":"2504-2289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,3]]}}}