当前位置:网站首页>复杂网络建模(二)
复杂网络建模(二)
2022-07-07 04:58:00 【坝坝头伯爵】
介数
介数分为节点介数和边介数,反映了节点或边在整个网络中的作用和影响力。
节点的介数Bi定义为
B i = ∑ j ≠ l ≠ i [ N j l ( i ) / N j l ] B_i=\sum_{j\neq l\neq i}^{}[N_{jl}(i)/N_jl] Bi=j=l=i∑[Njl(i)/Njl]
其中,Njl表示节点Vj和节点Vl之间的最短路径条数,Njl(i)表示节点Vj和节点Vl之间的最短路径经过节点Vi的条数。
边的介数Bij定义为
B i j = ∑ ( l , m ) ≠ ( i , j ) [ N l m ( e i j ) / N l m ] B_{ij}=\sum_{ {(l,m)}\neq (i,j)}^{}[N_{lm}(e_{ij})/N_lm] Bij=(l,m)=(i,j)∑[Nlm(eij)/Nlm]
式中,Nlm表示节点Vl和Vm之间的最短路径条数,Nlm(eij)表示节点Vl和Vm之间的最短路径经过边eij的条数。
核度
一个图的k-核是指反复去掉度值小于k的节点及其连线后,所剩的子图,该子图的节点数就是该核的大小。
节点核度的最大值叫做网络的核度。
网络密度
网络密度指的是一个网络中个节点之间联络的紧密程度。网络G的网络密度d(G)定义为
d ( G ) = 2 M / [ N ( N − 1 ) ] d(G)=2M/[N(N-1)] d(G)=2M/[N(N−1)]
M为网络中实际拥有的连接数,N为网络节点数,当网络完全连通时,密度为1.
边栏推荐
- Introduction to basic components of wechat applet
- 青龙面板--整理能用脚本
- Network learning (III) -- highly concurrent socket programming (epoll)
- Main window in QT learning 27 application
- Leetcode 40: combined sum II
- Leetcode 43 String multiplication (2022.02.12)
- CTF daily question day43 rsa5
- 芯片 设计资料下载
- Merging binary trees by recursion
- The zblog plug-in supports the plug-in pushed by Baidu Sogou 360
猜你喜欢
Linux server development, MySQL transaction principle analysis
json 数据展平pd.json_normalize
2022 tea master (intermediate) examination questions and mock examination
2022茶艺师(初级)考试题模拟考试题库及在线模拟考试
【数字IC验证快速入门】12、SystemVerilog TestBench(SVTB)入门
Avatary的LiveDriver试用体验
Few shot Learning & meta learning: small sample learning principle and Siamese network structure (I)
LeetCode 90:子集 II
探索干货篇!Apifox 建设思路
2022 recurrent training question bank and answers of refrigeration and air conditioning equipment operation
随机推荐
uniapp 移动端强制更新功能
Network learning (II) -- Introduction to socket
[UVM practice] Chapter 1: configuring the UVM environment (taking VCs as an example), run through the examples in the book
Sign up now | oar hacker marathon phase III, waiting for your challenge
C语言通信行程卡后台系统
You Li takes you to talk about C language 6 (common keywords)
Rust versus go (which is my preferred language?)
Recursive method to verify whether a tree is a binary search tree (BST)
Avatary的LiveDriver试用体验
OpenJudge NOI 2.1 1752:鸡兔同笼
CTF daily question day43 rsa5
Content of string
Open source ecosystem | create a vibrant open source community and jointly build a new open source ecosystem!
mysql多列索引(组合索引)特点和使用场景
Force buckle 144 Preorder traversal of binary tree
王爽 《汇编语言》之寄存器
Explore dry goods! Apifox construction ideas
PHP exports millions of data
Chip design data download
LeetCode中等题之我的日程安排表 I