Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Historical Background
Dynamic Networks: Analysis and Visualization
Conclusion and Future Directions
References
All Topics
Computer Science
Computer Graphics

Analysis and Visualization of Dynamic Networks

Profile image of Arnaud SallaberryArnaud Sallaberry

2017, Springer eBooks

https://doi.org/10.1007/978-1-4614-7163-9_382-1
visibility

…

description

26 pages

link

1 file

Abstract

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.

Related papers

Networks and Dynamics: The Structure of the World We Live In
Terry L Friesz

Network Science, Nonlinear Science and …, 2007

Many complex networks of systems have structures with similar topological properties: e.g. clustering, small world effect, and scale free structure. The dynamics of a system -either static or dynamic -are effected by the topological structure of the underlying network. Some examples of static and dynamic systems that act on networks include social, epidemiological, and transportation systems. This chapter gives an introduction to the analysis of nonlinear dynamics as it applies to such systems.

View PDFchevron_right
On analysis of complex network dynamics – changes in local topology
Marcin Budka

Social networks created based on data gathered in various computer systems are structures that constantly evolve. The nodes and their connections change because they are influenced by the external to the network events.. In this work we present a new approach to the description and quantification of patterns of complex dynamic social networks illustrated with the data from the Wroclaw University of Technology email dataset. We propose an approach based on discovery of local network connection patterns (in this case triads of nodes) as well as we measure and analyse their transitions during network evolution. We define the Triad Transition Matrix (TTM) containing the probabilities of transitions between triads, after that we show how it can help to discover the dynamic patterns of network evolution. One of the main issues when investigating the dynamical process is the selection of the time window size. Thus, the goal of this paper is also to investigate how the size of time window influences the shape of TTM and how the dynamics of triad number change depending on the window size. We have shown that, however the link stability in the network is low, the dynamic network evolution pattern expressed by the TTMs is relatively stable, and thus forming a background for fine-grained classification of complex networks dynamics. Our results open also vast possibilities of link and structure prediction of dynamic networks. The future research and applications stemming from our approach are also proposed and discussed.

View PDFchevron_right
Social Network Analysis, Large-Scale
Vladimir Batagelj

2009

View PDFchevron_right
Dynamic Network Visualization
James Moody

American Journal of Sociology, 2005

Increased interest in longitudinal social networks and the recognition that visualization fosters theoretical insight create a need for dynamic network visualizations, or network "movies." This article confronts theoretical questions surrounding the temporal representations of social networks and technical questions about how best to link network change to changes in the graphical representation. The authors divide network movies into (1) static flip books, where node position remains constant but edges cumulate over time, and (2) dynamic movies, where nodes move as a function of changes in relations. Flip books are particularly useful in contexts where relations are sparse. For more connected networks, movies are often more appropriate. Three empirical examples demonstrate the advantages of different movie styles. A new software program for creating network movies is discussed in the appendix.

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
Study on the Classification of Networks and Connection Density
Takaaki Kawanaka

International Journal of Japan Association for Management Systems

One of the widely used keywords in modern-day society is "network." Information communication networks, e.g., communication and broadcasting networks, networks of different industries across the framework of an organization, community networks of citizens, and networks of nonprofit organizations, are rapidly enhancing in various fields of social "networking." Finally, based on this trend, several researchers have focused on "network" and conducting studies in individual research fields related to social science and engineering (natural science). Several network studies have been conducted by segregating the research into social science and natural sciences. However, a few major issues remain unresolved in network studies. This study clarifies the definition and positioning of networks and networking using an interdisciplinary approach from social science (organizational theory) and engineering (graph theory). Moreover, we will focus on network connectivity and propose connection density indicators. Based on an empirical analysis, the connection density of Japanese subways will be calculated using this connection density index, and the connectivity of each subway will be examined.

View PDFchevron_right
Form and function of complex networks
Petter Holme

2004

Abstract Networks are all around us, all the time. From the biochemistry of our cells to the web of friendships across the planet. From the circuitry of modern electronics to chains of historical events. A network is the result of the forces that shaped it. Thus the principles of network formation can be, to some extent, deciphered from the network itself. All such information comprises the structure of the network. The study of network structure is the core of modern network science.

View PDFchevron_right

References (15)

  1. Adler(2007)] Adler RM (2007) A dynamic social network software platform for counter-terrorism decision support. In: ISI, IEEE, pp 47-54
  2. Akhmanova and Steinmetz(2008)] Akhmanova A, Steinmetz MO (2008) Tracking the ends: a dy- namic protein network controls the fate of microtubule tips. Nature Review Molecular Cell Biology 9(4):309-322 [Barabási and Albert(1999)] Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509-512
  3. Bender-deMoll and McFarland(2006)] Bender-deMoll S, McFarland DA (2006) The art and science of dynamic network visualization. Journal of Social Structure 7(2) [Borgatti et al(2009)Borgatti, Mehra, Brass, and Labianca] Borgatti SP, Mehra A, Brass DJ, Labi- anca G (2009) Network analysis in the social sciences. Science 323(5916):892-895 [Brandes and Erlebach(2005)] Brandes U, Erlebach T (eds) (2005) Network Analysis: Methodological Foundations, Lecture Notes in Computer Science, vol 3418. Springer-Verlag New York, Inc. [Burch et al(2011)Burch, Vehlow, Beck, Diehl, and Weiskopf] Burch M, Vehlow C, Beck F, Diehl S, Weiskopf D (2011) Parallel edge splatting for scalable dynamic graph visualization. IEEE Trans- actions on Visualization and Computer Graphics 17(12):2344-2353 [Casteigts et al(2011)Casteigts, Flocchini, Quattrociocchi, and Santoro] Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2011) Time-varying graphs and dynamic networks. In: Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks, Springer-Verlag, ADHOC-NOW'11, pp 346-359
  4. Cazabet et al(2010)Cazabet, Amblard, and Hanachi] Cazabet R, Amblard F, Hanachi C (2010) De- tection of overlapping communities in dynamical social networks. In: Social Computing (Social- Com), 2010 IEEE Second International Conference on, IEEE, pp 309-314
  5. Freeman(2000)] Freeman LC (2000) Visualizing social networks. Journal of Social Structure 1(1) [Freeman(2004)] Freeman LC (2004) The Development of Social Network Analysis: A Study in the Sociology of Science. Empirical Press, BookSurge, Vancouver, BC [Frishman and Tal(2008)] Frishman Y, Tal A (2008) Online dynamic graph drawing. IEEE Transac- tions on Visualization and Computer Graphics 14(4):727-740
  6. Gilbert et al(2011)Gilbert, Simonetto, Zaidi, Jourdan, and Bourqui] Gilbert F, Simonetto P, Zaidi F, Jourdan F, Bourqui R (2011) Communities and hierarchical structures in dynamic social net- works: analysis and visualization. Social Network Analysis and Mining 1:83-95 [Holme and Saramäki(2012)] Holme P, Saramäki J (2012) Temporal networks. Physics Reports 519(3):97-125
  7. Hu et al(2012)Hu, Kobourov, and Veeramoni] Hu Y, Kobourov SG, Veeramoni S (2012) Embedding, clustering and coloring for dynamic maps. In: Proceedings of the 5th IEEE Pacific Visualization Symposium (PacificVis 2012), pp 33-40
  8. Kolar et al(2010)Kolar, Song, Ahmed, and Xing] Kolar M, Song L, Ahmed A, Xing EP (2010) Esti- mating time-varying networks. Ann Appl Stat 4:94-123
  9. Moody et al(2005)Moody, Mcfarland, and Bender-demoll] Moody J, Mcfarland D, Bender-demoll S (2005) Dynamic network visualization. American Journal of Sociology 110(4):1206-1241 [Moreno(1934)] Moreno J (1934) Who shall survive? Nervous and Mental Disease Publishing Com- pany, Washington [Newcomb(1961)] Newcomb TM (1961) The acquaintance process. Holt, Rinehart and Winston (New York) [Newman and Girvan(2004)] Newman MEJ, Girvan M (2004) Graph clustering. Physical Review E 69(026113)
  10. Pavlopoulos et al(2008)Pavlopoulos, Wegener, and Schneider] Pavlopoulos G, Wegener AL, Schnei- der R (2008) A survey of visualization tools for biological network analysis. BioData Mining 1(1):12 [Purchase and Samra(2008)] Purchase H, Samra A (2008) Extremes are better: Investigating mental map preservation in dynamic graphs. In: Proceedings of the 5th International Conference on Diagrammatic Representation and Inference (Diagrams 2008), Springer, LNCS, vol 5223, pp 60- 73 [Robins et al(2007)Robins, Pattison, Kalish, and Lusher] Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p) models for social networks. Social Net- works 29(2):173-191
  11. Sallaberry et al(2013)Sallaberry, Muelder, and Ma] Sallaberry A, Muelder C, Ma KL (2013) Cluster- ing, visualizing, and navigating for large dynamic graphs. In: Proceedings of the 20th International Symposium on Graph Drawing (GD 2012), LNCS 7704, Springer Berlin Heidelberg, pp 487-498 [Sampson(1968)] Sampson SF (1968) A novitiate in a period of change: An experimental and case study of social relationships. PhD thesis, Cornell University [Schaeffer(2007)] Schaeffer SE (2007) Graph clustering. Computer Science Review 1(1):27-64 [Suderman and Hallett(2007)] Suderman M, Hallett M (2007) Tools for visually exploring biological networks. Bioinformatics 23(20):2651-2659
  12. Taylor et al(2009)Taylor, Linding, Warde-Farley, Liu, Pesquita, Faria, Bull, Pawson, Morris, and Wrana]
  13. Taylor IW, Linding R, Warde-Farley D, Liu Y, Pesquita C, Faria D, Bull S, Pawson T, Morris Q, Wrana JL (2009) Dynamic modularity in protein interaction networks predicts breast cancer outcome. Nature Biotechnology 27(2):199-204
  14. Trier(2008)] Trier M (2008) Towards dynamic visualization for understanding evolution of digital communication networks. Information Systems Research 19(3):335-350
  15. Tufte(1990)] Tufte ER (1990) Envisionning Information. Graphics Press, Cheshire, CT [Watts and Strogatz(1998)] Watts DJ, Strogatz SH (1998) Collective dynamics of 'small-world' net- works. Nature 393:440-442

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
Complex networks: Structure and dynamics
Vito Latora

Physics Reports, 2006

View PDFchevron_right
Internship report: \Di erence Graphs In Dynamic Networks"
monju tipu

This internship took place in the IXXI structure (Rh^one-Alpes Complex Systems Institute) in Lyon. I conducted research on the dynamic of complex networks under the supervision of Christophe Crespelle and Eric Fleury. These two researchers are both members of the D-NET (Dynamic Network) team of the ENS de Lyon Computer Science Laboratory (LIP, Laboratoire de l'Informatique du Parallelisme). More precisely, I analysed the dynamic of a speci c complex network from an innovative point of view. This approach has provided interesting results and has thereby helped us to study the possibility of modelling this ynamic.

View PDFchevron_right
Dynamics of Real-world Networks
Jure Leskovec

2007

Abstract In our recent work we found very interesting and unintuitive patterns for time evolving networks, which change some of the basic assumptions that were made in the past. The main objective of observing the evolution patterns is to develop models that explain processes which govern the network evolution. Such models can then be fitted to real networks, and used to generate realistic graphs or give formal explanations about their properties.

View PDFchevron_right
Network science
Katy Borner

2008

This chapter reviews the highly interdisciplinary field of network science, which is concerned with the study of networks, be they biological, technological, or scholarly in character. It contrasts, compares, and integrates techniques and algorithms developed in disciplines as diverse as mathematics, statistics, physics, social network analysis, information science, and computer science.

View PDFchevron_right

Related topics

  • Computer Science
  • Visualization
  • Dynamic Network Analysis(DNA)
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved