Information Technology Reference
In-Depth Information
(c) our quadrilateral
Simmelian backbone
Fig. 7.
Layouts of the same synthetic network determined by different edge embed-
dedness methods combined with our UMST (sparsification ratio of 80%).
Colors encode groups - ground truth.
(a) Jaccard [20]
(b) triadic
Simmelian backbone [17]
By design, our technique appears to be best suited for small-world networks
with multiple centers. While these are common, especially in social media, it will
be interesting to identify variants for hierarchically clustered graphs and single-
centered core-periphery structures such as the network of world trade [25].
References
1. Auber, D., Chiricota, Y., Jourdan, F., Melancon, G.: Multiscale visualization of
small world networks. In: INFOVIS. IEEE Computer Society (2003)
2. Benczur, A.A., Karger, D.R.: Approximating
s-t
minimum cuts in o(
n
2
)time.In:
Miller, G.L. (ed.) STOC, pp. 47-55. ACM (1996)
3. Brandes, U., Pich, C.: Eigensolver methods for progressive multidimensional scaling
of large data. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp.
42-53. Springer, Heidelberg (2007)
4. Brandes, U., Pich, C.: An experimental study on distance-based graph drawing.
In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 218-229.
Springer, Heidelberg (2009)
5. Burt, R.S.: Structural holes versus network closure as social capital. Social Capital:
Theory and Research, pp. 31-56 (2001)
6. Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J.
Comput. 14(1), 210-223 (1985)
7. Cohen, J.D.: Drawing graphs to convey proximity: An incremental arrangement
method. ACM Trans. Comput.-Hum. Interact. 4(3), 197-229 (1997)
8. Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic
subgraph statistics. J. Graph Algorithms Appl. 16(2), 543-567 (2012)
9. Gansner, E.R., Koren, Y., North, S.C.: Graph drawing by stress majorization. In:
Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239-250. Springer, Heidelberg (2005)
10. Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization.
Comput. Graph. Forum 28(3), 983-990 (2009)
11. Hurter, C., Telea, A., Ersoy, O.: Moleview: An attribute and structure-based se-
mantic lens for large element-based plots. IEEE TVCG 17(12), 2600-2609 (2011)
