90 citations · 219 across the 7 of their papers we have counts for
7 papers
REX: Explaining Relationships between Entity Pairs
Lujun Fang, Anish Das Sarma, Cong Yu +1
Knowledge bases of entities and relations (either constructed manually or automatically) are behind many real world search engines, including those at Yahoo!, Microsoft, and Google…
The rigorous solution for the average distance of a Sierpinski network
Zhongzhi Zhang, Lichao Chen, Lujun Fang +3
The closed-form solution for the average distance of a deterministic network--Sierpinski network--is found. This important quantity is calculated exactly with the help of recursion…
A Synthetical Weights' Dynamic Mechanism for Weighted Networks
Lujun Fang, Zhongzhi Zhang, Shuigeng Zhou +1
We propose a synthetical weights' dynamic mechanism for weighted networks which takes into account the influences of strengths of nodes, weights of links and incoming new vertices.…
Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
Zhongzhi Zhang, Shuigeng Zhou, Lujun Fang +2
Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a…
Exact analytical solution of average path length for Apollonian networks
Zhongzhi Zhang, Lichao Chen, Shuigeng Zhou +3
The exact formula for the average path length of Apollonian networks is found. With the help of recursion relations derived from the self-similar structure, we obtain the exact sol…
Recursive weighted treelike networks
Zhongzhi Zhang, Shuigeng Zhou, Lichao Chen +3
We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, whi…