多維動(dòng)態(tài)復(fù)雜網(wǎng)絡(luò)中節(jié)點(diǎn)傳播重要性算法研究
[Abstract]:In recent years, with the development of complex systems, more and more people begin to use the Internet to share information and socialize. Complex networks can be regarded as the topological abstractions of a large number of real complex systems, which generally have the characteristics of small world, scale-free and containing specific community structures. With the development of complex networks, the development of complex networks gradually presents the trend of multi-dimensional coexistence. Therefore, it has important academic significance and application value to study the multi-dimensional related problems of complex networks. Complex networks are usually not fixed. In general, the insertion and deletion of edge pairs will occur with the change of time, so it becomes a new challenge to better deal with the dynamic changes of complex networks. At present, most of the existing researches on complex networks are focused on single-dimensional static complex networks, and the research results are difficult to be applied to multi-dimensional dynamic complex network scenarios. In this paper, the importance of node propagation in multi-dimensional complex networks is studied on the basis of summarizing and analyzing the existing research results. When information propagates in multidimensional networks, the difference between dimensions is measured by dimensional similarity, and the influence of information attenuation on node importance is considered, and then the definition of node propagation importance measurement and the static calculation method of this metric are given. On this basis, the change of monitoring node set is used to guide the dynamic updating of node propagation importance measure. In this paper, the static algorithm of node propagation importance and the dynamic updating algorithm are run on many real networks, and the static node importance algorithm is applied to compute the node importance of static complex network. Dynamic node importance updating algorithms are efficient and accurate for community updating in dynamic complex networks.
【學(xué)位授予單位】:遼寧大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:O157.5
【參考文獻(xiàn)】
相關(guān)期刊論文 前7條
1 吳果;房禮國;李中;;基于多指標(biāo)綜合的復(fù)雜網(wǎng)絡(luò)節(jié)點(diǎn)重要性評(píng)估[J];計(jì)算機(jī)工程與設(shè)計(jì);2016年12期
2 劉大海;張博鋒;鄒國兵;顧程偉;;微博用戶模型復(fù)雜網(wǎng)絡(luò)中多維有向社區(qū)發(fā)現(xiàn)[J];計(jì)算機(jī)應(yīng)用與軟件;2016年07期
3 楊建祥;王朝坤;王萌;陳俊;;全動(dòng)態(tài)多維網(wǎng)絡(luò)局部介數(shù)中心度算法[J];計(jì)算機(jī)學(xué)報(bào);2015年09期
4 曹玖新;董丹;徐順;鄭嘯;劉波;羅軍舟;;一種基于k-核的社會(huì)網(wǎng)絡(luò)影響最大化算法[J];計(jì)算機(jī)學(xué)報(bào);2015年02期
5 張喜平;李永樹;劉剛;王蕾;;節(jié)點(diǎn)重要度貢獻(xiàn)的復(fù)雜網(wǎng)絡(luò)節(jié)點(diǎn)重要度評(píng)估方法[J];復(fù)雜系統(tǒng)與復(fù)雜性科學(xué);2014年03期
6 苑衛(wèi)國;劉云;程軍軍;熊菲;;微博雙向“關(guān)注”網(wǎng)絡(luò)節(jié)點(diǎn)中心性及傳播影響力的分析[J];物理學(xué)報(bào);2013年03期
7 張華青;王紅;滕兆明;馬曉慧;;多維加權(quán)社會(huì)網(wǎng)絡(luò)中的個(gè)性化推薦算法[J];計(jì)算機(jī)應(yīng)用;2011年09期
相關(guān)會(huì)議論文 前2條
1 金偉新;宋憑;彭靖;肖田元;;高維空間有向復(fù)雜網(wǎng)絡(luò)脆弱性研究[A];系統(tǒng)仿真技術(shù)及其應(yīng)用(第16卷)[C];2015年
2 盧悠悠;汪小帆;;節(jié)點(diǎn)重要性指標(biāo)在有向網(wǎng)絡(luò)中的應(yīng)用[A];2006全國復(fù)雜網(wǎng)絡(luò)學(xué)術(shù)會(huì)議論文集[C];2006年
,本文編號(hào):2352789
本文鏈接:http://sikaile.net/kejilunwen/yysx/2352789.html