11. Geometry Framework
• Popularity versus Similarity Model [Papadopoulos, Krioukov etc, 2012]
• 前述模型只考虑了popularity,而忽略了similarity
e.g:新的微博用户除了关注大V,还关注与自己兴趣相近的用户
• 前述模型只考虑了静态网络,没有考虑网络的动态增长
12. Geometry Framework
• Popularity versus Similarity Model [Papadopoulos, Krioukov etc, 2012]
1. 初始网络为空
2. 在时刻 :
(a) 节点 的极坐标为: ,角坐标为:
(b) 早于 的节点更新极坐标为:
3. 新加入节点与已经存在节点连接概率为:
1,2, ,i t L
2
lnir i
[0,2 ]U i
i
( ) (1 )j j ir i r r
( )
2
1
( )
1
ij i
ij
x R
T
p x
e
13. Geometry Framework
• Node coordinate inference [Papadopoulos, Krioukov etc, 2015]
1. 基于链接的推断算法
逐节点使用MLE求解:
原理为:
2. 基于公共邻居的推断算法
求出公共邻居节点的概率分布,然后使用MLE求解似然度函数
1
1
( ) [1 ( )]ij iji
L ij ij
j i
L p x p x
( ) ( , )ij ij i ip x r : :
https://bitbucket.org/dk-lab/2015_code_hypermap
23. some preliminary experiments
• 验证转发网络是否满足Hyperbolic结构
(3)Hyperbolicity是否满足(极大连通子图)
[Tree-like structure in large social and information networks, 2013, ICDM]
指出:可以使用树分解衡量图的hyperbolicity,树分解得到的tree width越低,
hyperbolicity越强
27. Reference
1. Krzysztof Nowicki and Tom A B Snijders. Estimation and prediction for stochastic
blockstructures. Journal of the American Statistical Association, 96(455):1077–
1087, 2001.
2. A.L. Barabási and R. Albert, Science 286, 509 (1999).
3. S.N.Dorogovtsev, J.F.F.Mendes and A.N. Samukhin, PRL, 2000.
4. Krioukov D, Papadopoulos F, Kitsak M, et al. Hyperbolic geometry of complex
networks[J]. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2010,
82(3 Pt 2):98-118.
5. Papadopoulos F, Aldecoa R, Krioukov D. Network Geometry Inference using
Common Neighbors[J]. Computer Science, 2015, 92(2).
6. Kleineberg K K, Boguñá M, Serrano M Á, et al. Hidden geometric correlations in
real multiplex networks[J]. Nature Physics, 2016.