Academia.eduAcademia.edu

Outline

Title
Abstract
Definition of the Subject
Introduction
Statistical Approach
Future Directions
References
All Topics
Computer Science
Theoretical Computer Science

Social Network Analysis, Large-Scale

Profile image of Vladimir BatageljVladimir Batagelj

2009

https://doi.org/10.1007/978-0-387-30440-3_489
visibility

…

description

31 pages

link

1 file

Abstract
sparkles

AI

This paper provides an overview of social network analysis with a focus on large-scale networks. It defines core concepts such as vertices and edges, explaining the formal structure of networks in terms of graphs and associated data. It then discusses the application of networks to analyze collaborations and interactions among various entities, supported by a dataset of EU projects.

Related papers

Applied network analysis
Bert Schijf

Quality and Quantity, 1980

View PDFchevron_right
A Network Analysis Primer
Michael P.H. Stumpf

Statistical and Evolutionary Analysis of …, 2010

Graph methods form a cornerstone of modern systems biology. In this chapter we review the fundamental apparatus of statistical descriptors and measures of graph properties. There is no single meaningful statistic that can describe all aspects of a network and we present a range of different measures that, when combined and critically evaluated, allow us to gain non-trivial insights into the architecture of complex networks in biology.

View PDFchevron_right
Pajek — Analysis and Visualization of Large Networks
A. Mrvar

Mathematics and Visualization, 2004

We shall start with a presentation of some typical and well-known real-life networks. After introducing the fundamental concepts of network analysis the following topics will be presented: -network representations: graph, matrix; -types of networks: undirected/directed networks, multi-relational networks, 2-mode networks, temporal networks; -size and density: small, large and huge networks; sparse and dense networks; -description of networks in Pajek input file; -network layouts: automatic and manual drawing; -connection with statistical packages (SPSS, R); -paths in networks: the shortest path;

View PDFchevron_right
Pajek: Program for Analysis and Visualization of Large Networks
Vladimir Batagelj

2006

View PDFchevron_right
A Curve Shaped Description of Large Networks, with an Application to the Evaluation of Network Models
Xianchuang Su

PLoS ONE, 2011

View PDFchevron_right
Introducing Network Analysis
Geoffrey Canright, Kenth Engø-Monsen

This article serves as an introduction to this special issue of Telektronikk on network analysis. The introduction consists of three parts. In part 1 we give the motivation for studing networks as a general concept with wide applicability. We support this idea with a variety of example applications. Then in part 2 we offer an overview of many of the basic ideas and terms in modern network analysis, including where possible, clear quantitative definitions. The terms in part 2 are terms that turn up in a wide variety of fields where networks are important. Finally, in part 3 we give a “reader’s guide” to the other articles in this issue.

View PDFchevron_right
Complex networks: Structure and dynamics
Vito Latora

Physics Reports, 2006

View PDFchevron_right
Pajek-program for analysis and visualization of large network
Vladimir Batagelj

1996

View PDFchevron_right
Analysing Networks of Networks
kseniia Puzyreva

2020

We consider data with multiple observations or reports on a network in the case when these networks themselves are connected through some form of network ties. We could take the example of a cognitive social structure where there is another type of tie connecting the actors that provide the reports; or the study of interpersonal spillover effects from one cultural domain to another facilitated by the social ties. Another example is when the individual semantic structures are represented as semantic networks of a group of actors and connected through these actors' social ties to constitute knowledge of a social group. How to jointly represent the two types of networks is not trivial as the layers and not the nodes of the layers of the reported networks are coupled through a network on the reports. We propose to transform the different multiple networks using line graphs, where actors are affiliated with ties represented as nodes, and represent the totality of the different types ...

View PDFchevron_right
Pajek Program for Analysis and Visualization of Large Networks Reference Manual
Vladimir Batagelj

2000

View PDFchevron_right

References (64)

  1. ANDERSON-JA-1983-V13-P799 KNAPP-AG-1984-V10-P616
  2. Adamic L.A., Lukose R.M., Huberman B.A.(2002) Local Search in Unstruc- tured Networks. in Handbook of Graphs and Networks: From the Genome to the Internet, S. Bornholdt, and H.G. Schuster (eds.), Wiley-VCH, Berlin.
  3. Ahmed A., Batagelj V., Fu X., Hong S-H., Merrick D., Mrvar A. (2007) Vi- sualisation and Analysis of the Internet Movie Database. Asia-Pacific Sym- posium on Visualisation (APVIS2007): Sydney, NSW, Australia, February 5-7, 2007 : proceedings. New York: IEEE, p. 17-24.
  4. Albert R., Barabási A-L. (2002) Statistical mechanics of complex networks. Reviews of Modern Physics, Vol. 74, 47-97.
  5. Alvarez-Hamelin J.I., Dall'Asta L., Barrat A., Vespignani A. (2005) k- core decomposition: a tool for the visualization of large scale networks. cs.NI/0504107, 28 Apr 2005.
  6. Batagelj V. (1989) Similarity measures between structured objects. Proceed- ings of International Course and Conference on the Interfaces between Math- ematics, Chemistry and Computer Science, Dubrovnik, 20-25 June 1988, A. Graovac (Ed.). Studies in Physical and Theoretical Chemistry, Vol. 63; Elsevier/Noth-Holland, Amsterdam, p. 25-40.
  7. Batagelj V., Brandes U. (2005) Efficient Generation of Large Random Net- works. Physical Review E 71, 036113, 2005.
  8. Batagelj V., Ferligoj A. (2000) Clustering relational data. in Data Analysis (ed.: W. Gaul, O. Opitz, M. Schader), Springer, Berlin, 3-15.
  9. Batagelj V., Mrvar A. (2000) Some Analyses of Erdős Collaboration Graph. Social Networks 22, 173-186.
  10. Batagelj V., Mrvar A. (2001) A Subquadratic Triad Census Algorithm for Large Sparse Networks with Small Maximum Degree. Social Networks 23, 23743.
  11. Batagelj V., Mrvar A. (2007) Hierarchical clustering with relational con- straints of large data sets. 6th Slovenian International Conference on Graph Theory, Bled, 24 -30 June 2007.
  12. Batagelj V., Mrvar A. (2008) Analysis of kinship relations with Pajek. in press Social Science Computer Review -SSCORE.
  13. Batagelj V., Zaveršnik, M. (2002) Generalized Cores, arxiv cs.DS/0202039
  14. Batagelj V., Zaveršnik M. (2007) Short cycle connectivity. Discrete Mathe- matics 307(3-5), 310-318.
  15. Brandes U. (2001) A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2):163-177.
  16. Breiger R.L. (2004) The analysis of social networks.
  17. Chakrabarti D., Zhan Y., Faloutsos C. (2004) R-MAT: A Recursive Model for Graph Mining. in SIAM Data Mining 2004, Orlando, Florida, USA.
  18. Doreian P., Batagelj V., Ferligoj A. (2000) Symmetric-Acyclic Decomposi- tions of Networks. Journal of Classification, 17(1), 3-28.
  19. Ferligoj A., Batagelj V. (1983) Some types of clustering with relational con- straints. Psychometrika, 48(4), 541-552.
  20. Freeman L.C. (1979) Centrality in Social Networks: A Conceptual Clarifi- cation. Social Networks 1: 211-213.
  21. Garfield E, Sher IH, and Torpie RJ. (1964) The Use of Citation Data in Writing the History of Science. Philadelphia: The Institute for Scientific In- formation, December 1964.
  22. Granovetter M. (1973) The Strength of Weak Ties. American Journal of So- ciology 78: 1360-80.
  23. Huisman M., Van Duijn M.A.J. (2005) Software for social network analysis. In: P.J. Carrington, J. Scott, S. Wasserman, Models and methods in social network analysis (pp. 270-316). Cambridge: Cambridge University Press.
  24. Hummon N.P., Doreian P. (1990) Computational Methods for Social Net- work Analysis. Social Networks, 12, 273-288.
  25. Kleinberg J. (1998) Authoritative sources in a hyperlinked environment. Proc. 9th ACM-SIAM Symposium on Discrete Algorithms.
  26. Kleinberg J., Kumar R., Raghavan P., Rajagopalan S., Tomkins A.(1999) The Web as a graph: measurements, models and methods. Proceedings of the 5th International Computing and combinatorics Conference.
  27. Leskovec J., Kleinberg J., Faloutsos C. (2006) Laws of Graph Evolution: Densification and Shrinking Diameters.
  28. Li L., Alderson D., Tanaka R., Doyle J.C., Willinger W. (2005) Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications. cond-mat/0501169.
  29. Mane K.K., Börner K. (2004) Mapping topics and topic bursts in PNAS. PNAS 101: 5287-5290.
  30. Newman M.E.J. (2003) The structure and function of complex networks. SIAM Review 45, 167-256.
  31. Pennock D.M., Flake G.W., Lawrence S., Glover E.J., Giles C.L. (2002) Winners dont take all: Characterizing the competition for links on the web. PNAS 99(8), 52075211.
  32. Seidman S.B. (1983) Network Structure And Minimum Degree. Social Net- works 5:269-287.
  33. Schank T., Wagner D. (2005) Finding, counting and listing all triangles in large graphs, an experimental study. In Workshop on Experimental and Ef- ficient Algorithms (WEA), 606-609.
  34. Snyder D., Kick E. (1979) The World System and World Trade: An Empirical Exploration of Conceptual Conflicts. Sociological Quaterly, 20,1, 23-36.
  35. Snijders T.A.B. (2005) Models for Longitudinal Network Data. Chapter 11 in P. Carrington, J. Scott, and S. Wasserman (Eds.), Models and methods in social network analysis. New York: Cambridge University Press.
  36. Stuckenschmidt H., Klein M. (2004) Structure-Based Partitioning of Large Concept Hierarchies. Proceedings of the 3rd International Semantic Web Conference ISWC 2004, Hiroshima, Japan.
  37. White D.R., Batagelj V., Mrvar A. (1999) Analyzing Large Kinship and Mar- riage Networks with Pgraph and Pajek. Social Science Computer Review - SSCORE, 17, 245-274.
  38. Zaveršnik M., Batagelj V. (2004) Islands. Slides from Sunbelt XXIV, Por- torož, Slovenia, 12.-16. May 2004, Books and Reviews
  39. Abello J., Pardalos P.M., Resende M.G. (Eds.) (2002) Handbook of Massive Data Sets. Springer.
  40. Ahuja R.K., Magnanti T.L., Orlin J.B. (1993) Network Flows: Theory, Al- gorithms, and Applications. Prentice Hall.
  41. Batagelj V., Mrvar A. (2003) Pajek -Analysis and Visualization of Large Networks. in Jünger, M., Mutzel, P., (Eds.) Graph Drawing Software. Springer, Berlin, p. 77-103.
  42. Brandes U., Erlebach T. (Eds.) (2005) Network Analysis: Methodological Foundations. LNCS, Springer, Berlin.
  43. Bollobás B. (2001) Random Graphs. Cambridge University Press.
  44. Carrington P.J., Scott J., Wasserman S. (Eds.) (2005) Models and Methods in Social Network Analysis. Cambridge University Press.
  45. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. (2001) Introduction to algorithms. Cambridge (Mass.): MIT Press.
  46. Degenne A., Forsé M. (1999) Introducing Social Networks. SAGE Publica- tions.
  47. Doreian P., Batagelj V., Ferligoj A. (2005) Generalized Blockmodeling, Cambridge University Press.
  48. Dorogovtsev S.N., Mendes J.F.F. (2003) Evolution of Networks: From Bio- logical Nets to the Internet and Www. Oxford University Press.
  49. de Nooy W., Mrvar A., Batagelj V. (2005) Exploratory Social Network Anal- ysis with Pajek, Cambridge University Press.
  50. Harary F., Norman R.Z., Cartwright D. (1965) Structural Models: An In- toroduction to the Theory of Directed Graphs. John Wiley.
  51. Knuth D.E. (1993) The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley.
  52. Newman M.E.J., Barabási A-L., Watts D. (2006) The Structure and Dynam- ics of Networks. Princeton Studies in Complexity.
  53. Scott J.P. (2000) Social Network Analysis: A Handbook. SAGE Publications.
  54. Wasserman S., Faust K. (1994) Social Network Analysis: Methods and Ap- plications. Cambridge University Press.
  55. Web Resources
  56. Complex Networks Collaboratory: http://cxnets.googlepages.com/
  57. The Edinburgh Associative Thesaurus: http://www.eat.rl.ac.uk/
  58. Internet Movie Database http://www.imdb.com/
  59. The Kansas Event Data System: http://web.ku.edu/keds/
  60. Matthieu Latapy. Triangle computation web page. http://www-rp.lip6.fr/˜latapy/Triangles/
  61. Nber: http://www.nber.org/patents/
  62. Netminer: http://www.netminer.com/
  63. Pajek: http://vlado.fmf.uni-lj.si/pub/networks/Pajek data sets: http://vlado.fmf.uni-lj.si/pub/networks/data/.
  64. UCINET: http://www.analytictech.com/

Related papers

Analysis and visualization of large networks
Vladimir Batagelj

Graph drawing software, 2003

Networks are used in social sciences from thirties (Moreno). Most networks collected till 1990 are small (some tens of vertices). Development of IT in nineties enabled collection of large networks-several thousands or millions of vertices. Large networks are usually sparse m < < n 2. network size n = |V | m = |L| source ODLIS dictionary 61K 2909

View PDFchevron_right
Computing Efficiency of Complex Networks 8 week Project Report for Summer Research Fellowship Program 2013 Indian Academy of Sciences Contents
Sriniketh Vijayaraghavan
View PDFchevron_right
Analysis and Visualization of Dynamic Networks
Arnaud Sallaberry

Encyclopedia of Social Network Analysis and Mining, 2014

Network or a Graph: A mathematical structure to represent objects and their interactions. Objects are represented by Nodes or Vertices (often denoted by a set V) and interactions are represented by Links or Edges (often denoted by a set E). Mathematically, a graph G is defined as a tuple G(V, E). Mathematicians use the 2 term Graph whereas scientists from other disciplines usually use the term Network to refer to the same concept. Throughout this text, we use these terms interchangeably. Social Network: A network where objects represent people and their interactions represent some sort of relationship among people. For example, two individuals may be connected to each other if they have studied at the same school, or play for the same football team. Clusters: A group of nodes (representing objects) that are densely connected to each other and sparsely connected to other nodes in the network. Formally, a clustering of a static graph G = (V, E) is defined by a set C of subsets of V : C = {c 1 , c 2 , ..., c l } such that V = c 1 ∪ c 2 ∪ ... ∪ c l. Small World Network: A graph with two characteristic properties. The average path length i.e. the number of nodes needed to traverse from one node to another on average is low, as compared to an equivalent size random graph. The second characteristic is the high transitivity among nodes i.e. many sets of three nodes are connected to each other with three vertices. Scale Free Network: A graph whose degree distribution follows a power law where the power law coefficient is usually between [2,3]. In other words, this means that most nodes nodes have only a few connections (low degree) and few nodes have many connections (high degree) in the network. Definition Network Science has emerged as an interdisciplinary field of study to model many physical and real world systems. A network, although consists of only a set of nodes and edges, but is a very powerful structure to represent a wide variety of systems such as people related through social relations, airports related through flights and Formally, we can define a dynamic network as a network which undergoes structural changes over time. The analysis and visualization of these networks is the study of algorithms, methods, tools and techniques which help us understand these networks and extract applicable knowledge from them. The study of Dynamic Networks forms a new and cross disciplinary area of study with research opportunities and applications in many diverse fields.

View PDFchevron_right
Analysis of Large Networks with Pajek
vladimir batagelj

2008

View PDFchevron_right
Algorithms for analysis of large networks
Vladimir Batagelj
View PDFchevron_right

Related topics

  • Computational Complexity

    • Cited by

    On bibliographic networks
    Vladimir Batagelj

    Scientometrics, 2013

    In the paper we show that the bibliographic data can be transformed into a collection of compatible networks. Using network multiplication different interesting derived networks can be obtained. In defining them an appropriate normalization should be considered. The proposed approach can be applied also to other collections of compatible networks. We also discuss the question when the multiplication of sparse networks preserves sparseness. The proposed approaches are illustrated with analyses of collection of networks on the topic "social network" obtained from the Web of Science.

    View PDFchevron_right
    Crowding out the change: business networks and persisting economic elites in the South of Italy over Unification (1840–1880)
    Maria Carmela Schisani

    Cliometrica

    In this article, we study the effect of the Unification on the network power of economic elites in the South of Italy. We study the persistence of economic elites as evidence of the stability of the institutional set up beyond the effect of Unification, and thus as a primary explaining factor of the persistence of social forces slowing and opposing modernization. We use original archival data on the universe of Naples enterprises to build the networks of business relations between individual economic actors for the 20-year period immediately before and after Unification. The persistence of network power and its determinants is tested via a difference-in-difference model. The main finding is that economic elites persist over Unification. The long-term business relations, rooted in the Bourbon period, the persisting lobbying power of the financial industry, the close collusive ties with potential foreign competitors and the closeness to politics after 1861 are all elements that explai...

    View PDFchevron_right
    An algebraic approach to temporal network analysis based on temporal quantities
    Vladimir Batagelj

    Social Network Analysis and Mining, 2016

    In a temporal network, the presence and activity of nodes and links can change through time. To describe temporal networks we introduce the notion of temporal quantities. We define the addition and multiplication of temporal quantities in a way that can be used for the definition of addition and multiplication of temporal networks. The corresponding algebraic structures are semirings. The usual approach to (data) analysis of temporal networks is to transform it into a sequence of time slices-static networks corresponding to selected time intervals and analyze each of them using standard methods to produce a sequence of results. The approach proposed in this paper enables us to compute these results directly. We developed fast algorithms for the proposed operations. They are available as an open source Python library TQ (Temporal Quantities) and a program Ianus. The proposed approach enables us to treat as temporal quantities also other network characteristics such as degrees, connectivity components, centrality measures, Pathfinder skeleton, etc. To illustrate the developed tools we present some results from the analysis of Franzosi's violence network and Corman's Reuters terror news network.

    View PDFchevron_right
    The Graph Landscape: using visual analytics for graph set analysis
    Florence Wang

    Journal of Visualization, 2016

    In a variety of research and application areas, graphs are an important structure for data modeling and analysis. While graph properties can have a crucial influence on the performance of graph algorithms, and thus on the outcome of experiments, often only basic analysis of the graphs under investigation in an experimental evaluation is performed and a few characteristics are reported in publications. We present Graph Landscape, a concept for the visual analysis of graph set properties. The Graph Landscape aims to support researchers to explore graphs and graph sets regarding their properties, to allow to select good experimental test sets, analyze newly generated sets, compare sets and assess the validity (or range) of experimental results and corresponding conclusions. Keywords Graphs Á Multidimensional data Á Visualization Á Analysis 1 Introduction Graphs are a versatile data structure that is used to model data in a variety of domains, including biology, security, social sciences, telecommunication, economics, and engineering. The resulting graphs and their properties facilitate the analysis of the data, e.g., in biology to find out the underlying principles of biological processes, or in social sciences to discover leaders and dynamic group behavior. Many online databases and collections of graphs are available that support such network analysis (KEGG Kyoto

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved