|
Literature on Social Network Analysis
|
|
Basics
|
|
V. Batagelj and A. Mrvar.
Pajek: Program for Analysis and Visualization of Large Networks, Reference Manual.
2008.
Link
|
|
W. de Nooy, A. Mrvar and V. Batagelj.
Exploratory Social Network Analysis with Pajek.
Cambridge University Press.
2005.
|
|
S. Wasserman and K. Faust.
Social Network Analysis, Methods and Applications.
Cambridge University Press.
1997.
|
|
Centrality Measures
|
|
D. Aingworthy, C. Chekuriz, P. Indykx and R. Motwani.
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication).
ACM-SIAM Symposium on Discrete Algorithms.
1996.
Link
|
|
D.A. Bader and K. Madduri.
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks.
Proc. The 35th International Conference on Parallel Processing (ICPP).
2006.
Link
|
|
P. Bonacich.
Power and Centrality: A Family of Measures.
The American Journal of Sociology 92(5):1170-1182.
1987.
|
|
S. Borgatti.
The Key Player Problem.
Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers pp.241-252.
2003.
Link
|
|
S. Borgatti.
Centrality and network flow.
Social Networks 27:55-71.
2005.
Link
|
|
S. Borgatti and M. G. Everett.
A Graph-theoretic perspective on centrality.
Social Networks.
2005.
Link
|
|
S. Borgatti.
Identifying sets of key players in a social network.
Computational & Mathematical Organization Theory 12:21-34.
2006.
Link
|
|
S. P. Borgatti and K. M. Carley and D. Krackhardt.
On the Robustness of Centrality Measures under Conditions of Imperfect Data.
Social Networks 28:124-136.
2006.
Link
|
|
U. Brandes.
A Faster Algorithm for Betweenness Centrality.
Journal of Mathematical Sociology 25(2):163-177.
2001.
Link
|
|
S. Brin and L. Page.
The Anatomy of a Large-Scale Hypertextual Web Search Engine.
Computer Networks 30(1-7):107-117.
1998.
Link
|
|
B. Cornwell.
A Complement-Derived Centrality Index for Disconnected Graphs.
Connections 26(2):70-81.
2005.
Link
|
|
E. Costenbader and T. W. Valente.
The stability of centrality measures when networks are sampled.
Social Networks 25:283-307.
2003.
Link
|
|
D. Eppstein and J. Wang.
Fast Approximation of Centrality.
Journal of Graph Algorithms and Applications 8(1):39-45.
2004.
Link
|
|
M. Everett and S. P. Borgatti.
Ego network betweenness.
Social Networks 27:31-38.
2005.
Link
|
|
L. C. Freeman, S. P. Borgatti and D. R. White.
Centrality in valued graphs: A measure of betweenness based on network flow.
Social Networks 13:141-154.
1991.
Link
|
|
A. Greenwald and J. R. Wicks.
QuickRank: A Recursive Ranking Algorithm.
2007.
Link
|
|
T. H. Haveliwala.
Efficient Computation of PageRank.
Stanford Digital Library Technologies Project - Technical Report 31.
1999.
Link
|
|
C. Kiss and M. Bichler.
Identification of Influencers - Measuring Influence in Customer Networks.
2007.
Link
|
|
K. Ko, K. J. Lee and C. Park.
Rethinking Preferential Attachment Scheme: Degree centrality versus closeness centrality.
Connections 27(3).
2007.
Link
|
|
C. Kohlschuetter and P.-A. Chirita and W. Nejdl.
Efficient Parallel Computation of PageRank.
1999.
Link
|
|
M. E. J. Newman.
A measure of betweenness centrality based on random walks.
Social Networks 27(1):39-54
2005.
Link
|
|
L. Page, S. Brin, R. Motwani and T. Winograd.
The PageRank Citation Ranking: Bringing Order to the Web.
1999.
Link
|
|
D. R. White and S. P. Borgatti.
Betweenness centrality measures for directed graphs.
Social Networks 16:335-346.
1994.
Link
|
|
J. R. Wicks and A. Greenwald.
More Efficient Parallel Computation of PageRank.
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval pp.861-862.
2007.
Link
|
|
Network Sampling
|
|
E. Costenbader and T. W. Valente.
The stability of centrality measures when networks are sampled.
Social Networks 25:283-307.
2003.
Link
|
|
P. Lavallee.
Indirect Sampling.
Springer Series in Statistics.
2007.
|
|
Telecommunications Graphs
|
|
M. Lonkila.
Phone notebooks as data on personal networks.
Connections 26(1).
2004.
Link
|
|
A. A. Nanavati, S. Gurumurthy, G. Das, D. Chakraborty, K. Dasgupta and S. Mukherjea.
On the Structural Properties of Massive Telecom Call Graphs: Findings and Implications.
In Proceedings of ACM Conference on Information and Knowledge Management (CIKM).
2006.
Link
|
|
Communities
|
|
B. Balasundaram, S. Butenko, I. V.Hicks and S. Sachdeva.
Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem.
Unpublished.
2006.
Link
|
|
T. Falowski, J. Bartelheimer and M. Spiliopoulou.
Mining and Visualizing the Evolution of Subgroups in Social Networks.
In Proc. of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence.
2006.
Link
|
|
T. Falowski and M. Spiliopoulou.
Users in Volatile Communities: Studying Active Participation and Community Evolution.
User Modeling.
2007.
|
|
P. L. Flom, S. R. Friedman, S. Strauss and A. Neaigus.
A New Measure of Linkage Between Two Sub-networks.
Connections 26(1).
2004.
|
|
M. E. J. Newman.
Fast algorithm for detecting community structure in networks.
Physical Review E:69.
2007.
|
|
Multi-Mode Networks
|
|
P. Bonacich, A. C. Holdren and M. Johnston.
Hyper-edges and Multi-dimensional Centrality.
Social Networks 26(3):189-203
2002.
Links
|
|
L. Singh.
Exploring graph mining approaches for dynamic heterogeneous networks.
2007.
|
|
Web Mining
|
|
L. A. Adamic, O. Buyukkokten and E. Adar.
A social network caught in the Web.
First Monday 8(6).
2003.
Links
|
|
L. A. Adamic and E. Adar.
Friends and Neighbors on the Web.
Social Networks 25(3):211--230.
2003.
Links
|
|
R. Albert, H. Jeong and A.-L. Barabasi.
The Diameter of the World-Wide Web.
Nature 401:130-131.
1999.
Links
|
|
A. Joshi, T. Finin, A. Java, A. Kale and P. Kolari.
Web (2.0) Mining: Analyzing Social Media.
The NSF Symposium on Next Generation of Data Mining and Cyber-Enabled Discovery for Innovation.
2007.
|
|
P.S. Keila and D.B. Skillicorn.
Detecting Unusual and Deceptive Communication in Email.
2005.
Link
|
|
H. W. Park.
Hyperlink Network Analysis: A New Method for the Study of Social Structure on the Web.
Connections 25(1).
2003.
Link
|
|
Mailing List Analysis
|
|
N. Agarwal, H. Liu, John Salerno and Philip Yu.
Searching for "Familiar Strangers" on Blogosphere: Problems and Challenges.
NSF Symposium on Next-Generation Data Mining and Cyber-enabled Discovery and Innovation.
2007.
|
|
Dynamic Networks
|
|
P. A. Gloor and Y. Zhao.
Visualizing Time in Social Networks with TeCFlow.
Link
|
|
P. A. Gloor and Y. Zhao.
TeCFlow - A Temporal Communication Flow Visualizer for Social Network Analysis.
Proceedings of the Computer Supported Collaborative Work Conference CSCW'04, Workshop on Social Networks.
2004.
Link
|
|
Visualization
|
|
L. C. Freeman.
Visualizing Social Networks.
Journal of Social Structure 1(1).
2001.
Link
|
|
C. McGrath, D. Krackhardt and J. Blythe.
Visualizing Complexity in Networks: Seeing Both the Forest and the Trees.
Connections 25(1).
2003.
Link
|
|
Weighted Networks
|
|
A. Barrat, M. Barthélemy, R. Pastor-Satorras and A. Vespignani.
The architecture of complex weighted networks.
Proceedings of the National Academy of Science, USA 111(11):3747-3752.
2004.
Link
|
|
Other
|
|
R. Albert and A.-L. Barabasi.
Statistical mechanics of complex networks.
Reviews of Modern Physics 74.
2002.
Link
|
|
J. Balthrop, S. Forrest, M. E. J. Newman and M. M. Williamson.
Technological networks and the spread of computer viruses.
Science 304:527-529.
2004.
Link
|
|
A. Basu.
Social Network Analysis of Terrorist Organizations in India.
NAACSOS.
2005.
Link
|
|
A. H. Dekker.
A Category-Theoretic Approach to Social Network Analysis.
Electronic Notes in Theoretical Computer Science 61.
2001.
Link
|
|
C. McCarty and A. Wutich.
Conceptual and Empirical Arguments for Including or Excluding Ego from Structural Analyses of Personal Networks.
Connections 26(2).
2005.
Link
|
|
L. R. Izquierdo and R. A. Hanneman.
Introduction to the formal analysis of social networks using mathematica.
2006.
Link
|
|
E. M. Jin, M. Girvan and M. E. J. Newman.
The structure of growing social networks.
2001.
Link
|
|
V. E. Krebs.
Mapping Networks of Terrorist Cells.
Connections 24(3).
2002.
Link
|
|
N. Lefebvre and M. Balmer.
Fast shortest path computation in time-dependent traffic networks.
Swiss Transport Research Conference.
2007.
Link
|
|
I. Mergel and M. Hennig.
Marktanalyse zu Netzwerkanalyse-Büchern.
Working Paper.
2006.
Link
|
|
M. E. J. Newman and J. Park.
Why social networks are different from other types of networks.
Physical Review 68.
2003.
Link
|
|
M. Ouimet, R. Landry and N. Amara.
Network Positions and Radical Innovation: A Social Network Analysis of the Quebec Optics and Photonics Cluster.
The DRUID Summer Conference 2004 on Industrial Dynamics, Innovation and Development.
2004.
Link
|
|
J. Skvoretz and K. Faust.
Relations, Species, and Network Structure.
JoSS 3.
Link
|
|
T. A. B. Snijders and S. P. Borgatti.
Non-Parametric Standard Errors and Tests for Network Statistics.
Connections 22(2).
1999.
Link
|
|
R. V. Solé, R. Ferrer Cancho, J. M. Montoya and S. Valverde.
Selection, Tinkering and Emergence in Complex Networks.
Complexity 8(1):20-33.
2002.
Link
|
|
D.J. Watts and S.H. Strogatz.
Collective dynamics of small-world networks.
Nature 393(6684):440-442
1999.
Link
|
|
D. J. Watts, P. S. Dodds and M. E. J. Newman.
Identity and search in social networks.
Science 296:1302-1305.
2002.
Link
|
