
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Carlos D. Correa, Tarik Crnovrsanin, KwanLiu Ma, "Visual Reasoning about Social Networks Using Centrality Sensitivity," IEEE Transactions on Visualization and Computer Graphics, vol. 18, no. 1, pp. 106120, January, 2012.  
BibTex  x  
@article{ 10.1109/TVCG.2010.260, author = {Carlos D. Correa and Tarik Crnovrsanin and KwanLiu Ma}, title = {Visual Reasoning about Social Networks Using Centrality Sensitivity}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {18}, number = {1}, issn = {10772626}, year = {2012}, pages = {106120}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.260}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  Visual Reasoning about Social Networks Using Centrality Sensitivity IS  1 SN  10772626 SP106 EP120 EPD  106120 A1  Carlos D. Correa, A1  Tarik Crnovrsanin, A1  KwanLiu Ma, PY  2012 KW  Social network visualization KW  centrality KW  sensitivity analysis KW  eigenvector and Markov importance. VL  18 JA  IEEE Transactions on Visualization and Computer Graphics ER   
[1] T. Antal, P.L. Krapivsky, and S. Redner, “Social Balance on Networks: The Dynamics of Friendship and Enmity,” Physica D, vol. 224, pp. 130136, May 2006.
[2] J. Anthonisse, “The Rush in a Directed Graph,” technical report, Stichting Mathetmatisch Centrum, 2005.
[3] V. Batagelj and A. Mrvar, Pajek—Analysis and Visualization of Large Networks. pp. 477+, Springer, 2002.
[4] M. Bianchini, M. Gori, and F. Scarselli, “Inside Pagerank,” ACM Trans. Internet Technology, vol. 5, no. 1, pp. 92128, 2005.
[5] P. Bonacich, “Factoring and Weighting Approaches to Status Scores and Clique Identification,” J. Math. Sociology, vol. 2, no. 1, pp. 113120, 1972.
[6] U. Brandes, “A Faster Algorithm for Betweenness Centrality,” J. Math. Sociology, vol. 25, pp. 163177, 2001.
[7] U. Brandes and T. Erlebach, Network Analysis: Methodological Foundations. Springer, 2005.
[8] U. Brandes and D. Wagner, “VisoneAnalysis and Visualization of Social Networks,” Proc. Graph Drawing Software, pp. 321340, 2004.
[9] S. Brin and L. Page, “The Anatomy of a LargeScale Hypertextual Web Search Engine,” Computer Networks and ISDN Systems, vol. 30, no. 1, pp. 107117, 1998.
[10] D. Cacuci, Sensitivity and Uncertainty Analysis: Theory Vol. 1. Chapman and Hall/CRC, 2003.
[11] T. Carpenter, G. Karakostas, and D. Shallcross, “Practical Issues and Algorithms for Analyzing Terrorist Networks.” 2002.
[12] T. Dwyer, S.H. Hong, D. Koschützki, F. Schreiber, and K. Xu, “Visual Analysis of Network Centralities,” Proc. AsiaPacific Symp. Information Visualisation, pp. 189197, 2006.
[13] L. Freeman, “Visualizing Social Networks,” J. Social Structure, vol. 1, no. 1, 2000.
[14] L.C. Freeman, “Centrality in Social Networks: Conceptual Clarification,” Social Networks, vol. 1, no. 3, pp. 215239, 1979.
[15] P. Gajer and S.G. Kobourov, “Grip: Graph Drawing with Intelligent Placement,” Proc. GD '00: Eighth Int'l Symp. Graph Drawing, pp. 222228, 2000.
[16] M. Girvan and M.E. Newman, “Community Structure in Social and Biological Networks,” Proc. Nat'l Academy of Sciences of USA, vol. 99, no. 12, pp. 78217826, 2002.
[17] A. Griewank, Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, 2000.
[18] S. Hachul and M. Jünger, “Drawing Large Graphs with a PotentialFieldBased Multilevel Algorithm,” Graph Drawing, pp. 285295, Springer, 2004.
[19] F. Harary and P. Hage, “Eccentricity and Centrality in Networks,” Social Networks, vol. 17, pp. 5763, 1995.
[20] P.G. Harrison and W.J. Knottenbelt, “Passage Time Distributions in Large Markov Chains,” SIGMETRICS Performance Evaluation Rev., vol. 30, no. 1, pp. 7785, 2002.
[21] J. Heer and D. Boyd, “Vizster: Visualizing Online Social Networks,” Proc. IEEE Symp. Information Visualization, pp. 3239, 2005.
[22] D. Holten, “Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data,” IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5, pp. 741748, Sept./Oct. 2006.
[23] http:/graphexploration.cond.org/, GUESS, the graph exploration system, 2007.
[24] http:/jung.sourceforge.net/, JUNG java universal network/graph framework, 2008.
[25] http:/mikelove.net, Genealogy of influence, 2008.
[26] http://www.yworks.com/enproducts_yed_about.html , yed graph ed., 2009.
[27] C.H. Hubbell, “An InputOutput Approach to Clique Identification,” Sociometry, vol. 28, no. 4, pp. 377399, 1965.
[28] R. Jacob, D. Koschützki, K.A. Lehmann, L. Peeters, and D. TenfeldePodehl, “Algorithms for Centrality Indices,” Network Analysis: Methodological Foundations, U. Brandes and T. Erlebach, eds., pp. 6282, Springer, 2005.
[29] H. Jeong, S.P. Mason, A.L. Barabasi, and Z.N. Oltvai, “Lethality and Centrality in Protein Networks,” Nature, vol. 411, p. 6833, 2001.
[30] Y. Jia, J. Hoberock, M. Garland, and J. Hart, “On the Visualization of Social and Other ScaleFree Networks,” IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 12851292, Nov./Dec., 2008.
[31] J. Kemeny and J. Snell, Finite Markov Chains. Springer Verlag, 1976.
[32] J.M. Kleinberg, “Authoritative Sources in a Hyperlinked Environment,” J. ACM, vol. 46, no. 5, pp. 604632, 1999.
[33] Y. Koren, L. Carmel, and D. Harel, “Drawing Huge Graphs by Algebraic Multigrid Optimization,” Multiscale Modeling and Simulation, vol. 1, no. 4, pp. 645673, 2003.
[34] D. Koschützki, K.A. Lehmann, D. TenfeldePodehl, and O. Zlotowski, “Advanced Centrality Concepts,” Network Analysis: Methodological Foundations, U. Brandes and T. Erlebach, eds., pp. 83104, Springer, 2005.
[35] D. Koschützki and F. Schreiber, “Comparison of Centralities for Biological Networks,” Proc. German Conf. Bioinformatics (GCB '04), pp. 1992006, 2004.
[36] A.N. Langville and C.D. Meyer, “Deeper Inside Pagerank,” Internet Math., vol. 1, no. 3, pp. 335380, 2003.
[37] R. Lempel and S. Moran, “Salsa: The Stochastic Approach for LinkStructure Analysis,” ACM Trans. Information Systems, vol. 19, no. 2, pp. 131160, 2001.
[38] M. Newman, “The Structure and Function of Complex Networks,” Soc, for Industrial and Applied Math. Rev., vol. 45, no. 2, pp. 167256, 2003.
[39] M.E.J. Newman, “The Structure of Scientific Collaboration Networks,” Proc. Nat'l Academy of Sciences of USA, vol. 98, no. 2, pp. 404409, Jan. 2001.
[40] A.Y. Ng, A.X. Zheng, and M.I. Jordan, “Link Analysis, Eigenvectors and Stability,” Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI), pp. 903910, 2001.
[41] A. Noack, “Energy Models for Graph Clustering,” J. Graph Algorithms Applications, vol. 11, no. 2, pp. 453480, 2007.
[42] A. Perer and B. Shneiderman, “Integrating Statistics and Visualization: Case Studies of Gaining Clarity during Exploratory Data Analysis,” Proc. SIGCHI Conf. Human Factors in Computing Systems, pp. 265274, 2008.
[43] J.P. Scott, Social Network Analysis: A Handbook. SAGE Publications, 2000.
[44] M. Shaw, “Group Structure and The Behavior of Individuals in Small Groups,” J. Psychology, vol. 38, pp. 139149, 1954.
[45] F. van Ham and A. Perer, “Search, Show Context, Expand on Demand: Supporting Large Graph Exploration with DegreeofInterest,” IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 6, pp. 953960, Nov./Dec. 2009.
[46] F. van Ham and M. Wattenberg, “Centrality Based Visualization of Small World Graphs,” Computer Graphics Forum, vol. 27, no. 3, pp. 975982, 2008.
[47] S. Wasserman, K. Faust, and M. Granovetter, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.
[48] S. White and P. Smyth, “Algorithms for Estimating Relative Importance in Networks,” Int'l Conf. Knowledge Discovery and Data Mining, pp. 266275, 2003.