Loading…
Influencer identification of dynamical networks based on an information entropy dimension reduction method
Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control. Traditional methods usually begin from the centrality...
Saved in:
Published in: | Chinese physics B 2024-03, Vol.33 (4), p.40502 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-c233t-9fb194500457791e50ca9aea4cf26ffaeb6169af0a1f91e763d95f72c483f1373 |
container_end_page | |
container_issue | 4 |
container_start_page | 40502 |
container_title | Chinese physics B |
container_volume | 33 |
creator | Duan, Dong-Li Ji, Si-Yuan Yuan, Zi-Wei |
description | Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control. Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure. However, these algorithms do not consider network state changes. We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity. By using mean field theory and information entropy to calculate node activity, we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance. We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the
C. elegans
neural network. We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers. |
doi_str_mv | 10.1088/1674-1056/ad102e |
format | article |
fullrecord | <record><control><sourceid>iop_cross</sourceid><recordid>TN_cdi_iop_journals_10_1088_1674_1056_ad102e</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>cpb_33_4_040502</sourcerecordid><originalsourceid>FETCH-LOGICAL-c233t-9fb194500457791e50ca9aea4cf26ffaeb6169af0a1f91e763d95f72c483f1373</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7ePeYHWDdp2rQ9yuLHwoIXPYdsMoNZt8mSdJH-e1Mr3jyFyfO-w_AQcsvZPWdtu-KyqQrOarnSlrMSzsiiZHVbiFZU52Txhy_JVUp7xmQOiQXZbzweTuANROos-MGhM3pwwdOA1I5e93k-UA_DV4ifie50Aksz1p46jyH2czpXYziO1LoefJp-ItiT-WE9DB_BXpML1IcEN7_vkrw_Pb6tX4rt6_Nm_bAtTCnEUHS4411VM1bVTdNxqJnRnQZdGSwlooad5LLTyDTHjBspbFdjU5qqFchFI5aEzXtNDClFQHWMrtdxVJypyZWaZKhJhppd5crdXHHhqPbhFH0-8P_4N-V1bYA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Influencer identification of dynamical networks based on an information entropy dimension reduction method</title><source>Institute of Physics:Jisc Collections:IOP Publishing Read and Publish 2024-2025 (Reading List)</source><creator>Duan, Dong-Li ; Ji, Si-Yuan ; Yuan, Zi-Wei</creator><creatorcontrib>Duan, Dong-Li ; Ji, Si-Yuan ; Yuan, Zi-Wei</creatorcontrib><description>Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control. Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure. However, these algorithms do not consider network state changes. We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity. By using mean field theory and information entropy to calculate node activity, we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance. We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the
C. elegans
neural network. We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.</description><identifier>ISSN: 1674-1056</identifier><identifier>EISSN: 2058-3834</identifier><identifier>DOI: 10.1088/1674-1056/ad102e</identifier><language>eng</language><publisher>Chinese Physical Society and IOP Publishing Ltd</publisher><subject>dynamical networks ; low-dimensional dynamics ; network disintegration ; network influencer</subject><ispartof>Chinese physics B, 2024-03, Vol.33 (4), p.40502</ispartof><rights>2024 Chinese Physical Society and IOP Publishing Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c233t-9fb194500457791e50ca9aea4cf26ffaeb6169af0a1f91e763d95f72c483f1373</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Duan, Dong-Li</creatorcontrib><creatorcontrib>Ji, Si-Yuan</creatorcontrib><creatorcontrib>Yuan, Zi-Wei</creatorcontrib><title>Influencer identification of dynamical networks based on an information entropy dimension reduction method</title><title>Chinese physics B</title><addtitle>Chin. Phys. B</addtitle><description>Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control. Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure. However, these algorithms do not consider network state changes. We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity. By using mean field theory and information entropy to calculate node activity, we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance. We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the
C. elegans
neural network. We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.</description><subject>dynamical networks</subject><subject>low-dimensional dynamics</subject><subject>network disintegration</subject><subject>network influencer</subject><issn>1674-1056</issn><issn>2058-3834</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp1kE1LxDAQhoMouK7ePeYHWDdp2rQ9yuLHwoIXPYdsMoNZt8mSdJH-e1Mr3jyFyfO-w_AQcsvZPWdtu-KyqQrOarnSlrMSzsiiZHVbiFZU52Txhy_JVUp7xmQOiQXZbzweTuANROos-MGhM3pwwdOA1I5e93k-UA_DV4ifie50Aksz1p46jyH2czpXYziO1LoefJp-ItiT-WE9DB_BXpML1IcEN7_vkrw_Pb6tX4rt6_Nm_bAtTCnEUHS4411VM1bVTdNxqJnRnQZdGSwlooad5LLTyDTHjBspbFdjU5qqFchFI5aEzXtNDClFQHWMrtdxVJypyZWaZKhJhppd5crdXHHhqPbhFH0-8P_4N-V1bYA</recordid><startdate>20240301</startdate><enddate>20240301</enddate><creator>Duan, Dong-Li</creator><creator>Ji, Si-Yuan</creator><creator>Yuan, Zi-Wei</creator><general>Chinese Physical Society and IOP Publishing Ltd</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20240301</creationdate><title>Influencer identification of dynamical networks based on an information entropy dimension reduction method</title><author>Duan, Dong-Li ; Ji, Si-Yuan ; Yuan, Zi-Wei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c233t-9fb194500457791e50ca9aea4cf26ffaeb6169af0a1f91e763d95f72c483f1373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>dynamical networks</topic><topic>low-dimensional dynamics</topic><topic>network disintegration</topic><topic>network influencer</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Duan, Dong-Li</creatorcontrib><creatorcontrib>Ji, Si-Yuan</creatorcontrib><creatorcontrib>Yuan, Zi-Wei</creatorcontrib><collection>CrossRef</collection><jtitle>Chinese physics B</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Duan, Dong-Li</au><au>Ji, Si-Yuan</au><au>Yuan, Zi-Wei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Influencer identification of dynamical networks based on an information entropy dimension reduction method</atitle><jtitle>Chinese physics B</jtitle><addtitle>Chin. Phys. B</addtitle><date>2024-03-01</date><risdate>2024</risdate><volume>33</volume><issue>4</issue><spage>40502</spage><pages>40502-</pages><issn>1674-1056</issn><eissn>2058-3834</eissn><abstract>Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control. Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure. However, these algorithms do not consider network state changes. We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity. By using mean field theory and information entropy to calculate node activity, we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance. We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the
C. elegans
neural network. We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.</abstract><pub>Chinese Physical Society and IOP Publishing Ltd</pub><doi>10.1088/1674-1056/ad102e</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1674-1056 |
ispartof | Chinese physics B, 2024-03, Vol.33 (4), p.40502 |
issn | 1674-1056 2058-3834 |
language | eng |
recordid | cdi_iop_journals_10_1088_1674_1056_ad102e |
source | Institute of Physics:Jisc Collections:IOP Publishing Read and Publish 2024-2025 (Reading List) |
subjects | dynamical networks low-dimensional dynamics network disintegration network influencer |
title | Influencer identification of dynamical networks based on an information entropy dimension reduction method |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T11%3A53%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-iop_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Influencer%20identification%20of%20dynamical%20networks%20based%20on%20an%20information%20entropy%20dimension%20reduction%20method&rft.jtitle=Chinese%20physics%20B&rft.au=Duan,%20Dong-Li&rft.date=2024-03-01&rft.volume=33&rft.issue=4&rft.spage=40502&rft.pages=40502-&rft.issn=1674-1056&rft.eissn=2058-3834&rft_id=info:doi/10.1088/1674-1056/ad102e&rft_dat=%3Ciop_cross%3Ecpb_33_4_040502%3C/iop_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c233t-9fb194500457791e50ca9aea4cf26ffaeb6169af0a1f91e763d95f72c483f1373%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |