Source localization in complex networks with optimal observers based on maximum entropy sampling

Hu, Zhao-Long; Wang, Hong-Jue; Sun, Lei; Tang, Chang-Bing; Li, Minglu

doi:10.1016/j.eswa.2024.124946

Expert Systems with Applications

2024

DOI: 10.1016/j.eswa.2024.124946

|View full text |Cite

Source localization in complex networks with optimal observers based on maximum entropy sampling

Zhao-Long Hu,

Hong-Jue Wang,

Lei Sun

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Identify information sources with different start times in complex networks based on sparse observers

Deng 邓,

Hu 胡,

Lin 林

et al. 2024

Chinese Phys. B

View full text Add to dashboard Cite

The dissemination of information across various locations is an ubiquitous occurrence, however, prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial moments. Although there are many research results of multi-source identification, the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains unresolved. In this study, we provide the backward spread tree theorem and source centrality theorem, and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start times. The proposed algorithm does not require prior knowledge of the number of sources, however, it can estimate both the initial spread moment and the spread duration. The core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear programming. Extensive experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and efficiency. Furthermore, we find that our method maintains robustness irrespective of the number of sources and the average degree of network. Compared with classical and state-of-the art source identification methods, our method generally improves the AUROC value by 0.1 to 0.2.

show abstract

Identify information sources with different start times in complex networks based on sparse observers

Deng 邓,

Hu 胡,

Lin 林

et al. 2024

Chinese Phys. B

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Source localization in complex networks with optimal observers based on maximum entropy sampling

Cited by 1 publication

References 56 publications

Identify information sources with different start times in complex networks based on sparse observers

Identify information sources with different start times in complex networks based on sparse observers

Contact Info

Product

Resources

About