Skip to main content
Erschienen in: Social Network Analysis and Mining 4/2013

01.12.2013 | Original Article

A mathematical model of dynamic social networks

verfasst von: John L. Pfaltz

Erschienen in: Social Network Analysis and Mining | Ausgabe 4/2013

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A mathematical model for dynamic networks is developed that is based on closed, rather than open, sets. For a social network, it seems appropriate to use a neighborhood concept to establish these sets. We then define a rigorous concept of continuous change, and show that it shares some of the properties associated with the continuity of the calculus. We demonstrate that continuity is local in nature, in that if the network change is discontinuous, it will be so at a single point and the discontinuity will be apparent in that point’s immediate neighborhood. Necessary and sufficient criteria for continuity are provided when the change involves only the addition, or deletion, of individual nodes or connections (edges). To illustrate large scale continuous change, we choose a practical process which reduces a complex network to its fundamental cycles, in the course of which most triadically closed subportions are removed. Finally, we explore several variants of the neighborhood concept, and prove that a rigorous notion of fuzzy closure can be defined.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Fußnoten
1
In graph theory, Y.η is often called the “open neighborhood of Y” and denoted N(Y), while Y.ρ, denoted N[Y] has been called the “closed neighborhood of Y” (Agnarsson and Greenlaw 2007; Harary 1969). This is a rather different meaning of “closed”.
 
2
Because homomorphisms are point functions, not set valued operators, we employ prefix notation.
 
3
A graph, or subgraph, is said to be chordal if it contains no cycles of length greater than 3 without a chord (edge) joining two of its points (Jacobson and Peters 1990; McKee 1993).
 
4
Figure reprinted with permission from Newman (2006). Copyright (2006) by the American Physical Society.
 
5
E.g. the typical \(\epsilon-\delta\) definition of real analysis (Royden 1988).
 
6
Many graph theory texts say that Y.η is an “open” neighborhood, c.f (Agnarsson and Greenlaw 2007; Harary 1969).
 
Literatur
Zurück zum Zitat Agnarsson G, Greenlaw R (2007) Graph theory: modeling, applications and algorithms. Prentice Hall, Upper Saddle River Agnarsson G, Greenlaw R (2007) Graph theory: modeling, applications and algorithms. Prentice Hall, Upper Saddle River
Zurück zum Zitat Ando K (2006) Extreme point axioms for closure spaces. Discrete Math 306:3181–3188 Ando K (2006) Extreme point axioms for closure spaces. Discrete Math 306:3181–3188
Zurück zum Zitat Bourqui R, Gilbert F, Simonetto P, Zaidi F, Sharan U, Jourdan F (2009) Detecting structural changes and command hierarchies in dynamic social networks. In: 2009 Advances in Social Network Analysis and Mining, Athens, Greece, pp 83–88 Bourqui R, Gilbert F, Simonetto P, Zaidi F, Sharan U, Jourdan F (2009) Detecting structural changes and command hierarchies in dynamic social networks. In: 2009 Advances in Social Network Analysis and Mining, Athens, Greece, pp 83–88
Zurück zum Zitat Christakis NA, Fowler JH (2009) Connected, the surprising power of our social networks and how they shape our lives. Little Brown & Co., New York Christakis NA, Fowler JH (2009) Connected, the surprising power of our social networks and how they shape our lives. Little Brown & Co., New York
Zurück zum Zitat Daraganova G, Pattison P, Koskinen J, Mitchell B, Bill A, Watts M, Baum S (2012) Networks and geography: modelling community network structures as the outcome of both spatial and network processes. Social Netw 34:6–17CrossRef Daraganova G, Pattison P, Koskinen J, Mitchell B, Bill A, Watts M, Baum S (2012) Networks and geography: modelling community network structures as the outcome of both spatial and network processes. Social Netw 34:6–17CrossRef
Zurück zum Zitat Dekker A (2006) Conceptual distance in social network analysis. J Social Struct 6(3):1–31 Dekker A (2006) Conceptual distance in social network analysis. J Social Struct 6(3):1–31
Zurück zum Zitat Freeman LC (2000) Visualizing social networks. J Social Struct 1(1):1–19 Freeman LC (2000) Visualizing social networks. J Social Struct 1(1):1–19
Zurück zum Zitat Giblin PJ (1977) Graphs, surfaces and homology. Chapman and Hall, London Giblin PJ (1977) Graphs, surfaces and homology. Chapman and Hall, London
Zurück zum Zitat Harary F (1969) Graph theory. Addison-Wesley, Reading Harary F (1969) Graph theory. Addison-Wesley, Reading
Zurück zum Zitat Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York
Zurück zum Zitat Hipp JR, Farris RW, Boessen A (2012) Measuring ‘neighborhood’: constructing network neighborhoods. Social Netw 34:128–140 Hipp JR, Farris RW, Boessen A (2012) Measuring ‘neighborhood’: constructing network neighborhoods. Social Netw 34:128–140
Zurück zum Zitat Jacobson MS, Peters K (1990) Chordal graphs and upper irredundance, upper domination and independence. Discrete Math 86(1–3):59–69MathSciNetCrossRefMATH Jacobson MS, Peters K (1990) Chordal graphs and upper irredundance, upper domination and independence. Discrete Math 86(1–3):59–69MathSciNetCrossRefMATH
Zurück zum Zitat Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: WWW 2008, Proceedings of 17th International Conference on the World Wide Web, pp 695–704 Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: WWW 2008, Proceedings of 17th International Conference on the World Wide Web, pp 695–704
Zurück zum Zitat McKee TA, McMorris FR (1999) Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia McKee TA, McMorris FR (1999) Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia
Zurück zum Zitat Mollenhorst G, Völker B, Flap H (2012) Shared contexts and triadic closure in core discussion networks. Social Netw 34:292–302 Mollenhorst G, Völker B, Flap H (2012) Shared contexts and triadic closure in core discussion networks. Social Netw 34:292–302
Zurück zum Zitat Monjardet B (2007) Closure operators and choice operators: a survey. In: Fifth International Conference on Concept Lattices and their Applications, Montpellier, France, Oct. 2007. Lecture notes. Monjardet B (2007) Closure operators and choice operators: a survey. In: Fifth International Conference on Concept Lattices and their Applications, Montpellier, France, Oct. 2007. Lecture notes.
Zurück zum Zitat Monjardet B, Raderinirina V (2001) The duality between the antiexchange closure operators and the path independent choice operators on a finite set. Math Social Sci 41(2):131–150MathSciNetCrossRefMATH Monjardet B, Raderinirina V (2001) The duality between the antiexchange closure operators and the path independent choice operators on a finite set. Math Social Sci 41(2):131–150MathSciNetCrossRefMATH
Zurück zum Zitat Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(036104):1–22 Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(036104):1–22
Zurück zum Zitat Pfaltz JL (2006) Logical implication and causal dependency. In: Schärfe H, Hitzler P, Øhrstrøm P (eds) Conceptual structures: inspiration and application, volume Springer Verlag LNAI 4068 (supplemental volume), Aalborg University, pp 145–157 Pfaltz JL (2006) Logical implication and causal dependency. In: Schärfe H, Hitzler P, Øhrstrøm P (eds) Conceptual structures: inspiration and application, volume Springer Verlag LNAI 4068 (supplemental volume), Aalborg University, pp 145–157
Zurück zum Zitat Pfaltz JL (2008) Establishing logical rules from empirical data. Int J Artif Intell Tools 17(5):985–1001CrossRef Pfaltz JL (2008) Establishing logical rules from empirical data. Int J Artif Intell Tools 17(5):985–1001CrossRef
Zurück zum Zitat Richards W, Seary A (2000) Eigen analysis of networks. J Social Struct 1(2):1–16 Richards W, Seary A (2000) Eigen analysis of networks. J Social Struct 1(2):1–16
Zurück zum Zitat Royden HL (1988) Real analysis. Mcmillian, New York Royden HL (1988) Real analysis. Mcmillian, New York
Zurück zum Zitat Saito A (2010) (ed) Graphs and combinatorics. Springer, Berlin Saito A (2010) (ed) Graphs and combinatorics. Springer, Berlin
Zurück zum Zitat Smyth P (2003) Statistical modeling of graph and network data. In: Proceedings of IJCAI Workshop on Learning Statistical Models from Relational Data, Acapulco, Mexico Smyth P (2003) Statistical modeling of graph and network data. In: Proceedings of IJCAI Workshop on Learning Statistical Models from Relational Data, Acapulco, Mexico
Zurück zum Zitat Šlapal JA (2004) Galois correspondence for digital topology. In: Denecke K, Erné M, Wismath SL (eds) Galois connections and applications. Kluwer Academic, Dordrecht, pp 413–424 Šlapal JA (2004) Galois correspondence for digital topology. In: Denecke K, Erné M, Wismath SL (eds) Galois connections and applications. Kluwer Academic, Dordrecht, pp 413–424
Metadaten
Titel
A mathematical model of dynamic social networks
verfasst von
John L. Pfaltz
Publikationsdatum
01.12.2013
Verlag
Springer Vienna
Erschienen in
Social Network Analysis and Mining / Ausgabe 4/2013
Print ISSN: 1869-5450
Elektronische ISSN: 1869-5469
DOI
https://doi.org/10.1007/s13278-013-0109-9

Weitere Artikel der Ausgabe 4/2013

Social Network Analysis and Mining 4/2013 Zur Ausgabe