IDEAS home Printed from https://ideas.repec.org/a/hin/complx/4749598.html
   My bibliography  Save this article

Robust Controllability Network Method on Temporal Network Using Temporal Link Prediction and Network Embedding

Author

Listed:
  • Yan Dou
  • WanLin Liu
  • Peyman Arebi

Abstract

Controllability in temporal networks is considered one of the most important challenges in this type of network. Network controllability methods try to fully control the network with the minimum number of control nodes. This type of network is always exposed to internal and external attacks and failures. Therefore, controllability processes need recovery mechanisms to be resistant to various types of failures. The high volume of temporal networks causes the recovery controllability processes to be disrupted. In the paper, a novel method of recovery controllability in temporal networks is proposed to improving controllability network robustness. To restore controllability of the network, the RCTE framework is proposed, in which a temporal network is converted into snapshots at discrete times and then its dimensions are reduced by using network embedding. Finally, using link prediction based on local and global similarity, links that are subject to failure are identified. The effectiveness of the proposed method against various network attacks has been evaluated and compared with other conventional methods. The results show that the RCTE framework performed better than other conventional methods. Also, the proposed method has more controllability and tolerance against malicious attacks compared to other recovery methods.

Suggested Citation

  • Yan Dou & WanLin Liu & Peyman Arebi, 2025. "Robust Controllability Network Method on Temporal Network Using Temporal Link Prediction and Network Embedding," Complexity, Hindawi, vol. 2025, pages 1-19, June.
  • Handle: RePEc:hin:complx:4749598
    DOI: 10.1155/cplx/4749598
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2025/4749598.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2025/4749598.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/cplx/4749598?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:4749598. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.