Skip to main content

2024 | OriginalPaper | Buchkapitel

An Analytical Approximation of Simplicial Complex Distributions in Communication Networks

verfasst von : Ke Shen, Mayank Kejriwal

Erschienen in: Complex Networks & Their Applications XII

Verlag: Springer Nature Switzerland

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

search-config
loading …

Abstract

In recent years, there has been a growing recognition that higher-order structures are important features in real-world networks. A particular class of structures that has gained prominence is known as a simplicial complex. Despite their application to complex processes such as social contagion and novel measures of centrality, not much is currently understood about the distributional properties of these complexes in communication networks. Furthermore, it is also an open question as to whether an established growth model, such as scale-free network growth with triad formation, is sophisticated enough to capture the distributional properties of simplicial complexes. In this paper, we use empirical data on five real-world communication networks to propose a functional form for the distributions of two important simplicial complex structures. We also show that, while the scale-free network growth model with triad formation captures the form of these distributions in networks evolved using the model, the best-fit parameters are significantly different between the real network and its simulated equivalent. An auxiliary contribution is an empirical profile of the two simplicial complexes in these five real-world networks.

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 "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!

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!

Fußnoten
1
Technically, we refer to these in this paper as S*- and T-* complexes, with the * indicating that we are considering the maximal definition of the complex e.g., an S*-complex is not a strict sub-graph of another S-complex.
 
2
A measure of the degree of clustering, the clustering coefficient \(\gamma _v\) of node v is given by \(\frac{|\mathcal {E}(\varGamma _v)|}{\frac{k_v(k_v-1)}{2}}\), where \(|\mathcal {E}(\varGamma _v)|\) is the number of edges that exist between node v’s neighbors.
 
3
These are edges that are not part of any triangles.
 
4
But subject to the ‘quad’ constraint noted in the Introduction.
 
8
The differences between generated networks corresponding to the same real network were found to be very minor, so we just show one such network (per real network) in the Fig. 2. However, subsequently described statistical analyses make use of all the generated networks.
 
9
In our case, this is simply the set of adjacency factors.
 
10
Specifically, on the Eq. 1 model, the MND’ (average over generated networks) is higher for Email-Enron than for the reference; on Equation refeq2, the MND’ is higher for both Uni. of Kiel and Phone Calls.
 
Literatur
3.
Zurück zum Zitat Barabási, A.L., et al.: Network science. Cambridge university press (2016) Barabási, A.L., et al.: Network science. Cambridge university press (2016)
4.
Zurück zum Zitat Barbarossa, S., Sardellitti, S., Ceci, E.: Learning from signals defined over simplicial complexes. In: 2018 IEEE Data Science Workshop (DSW), pp. 51–55. IEEE (2018) Barbarossa, S., Sardellitti, S., Ceci, E.: Learning from signals defined over simplicial complexes. In: 2018 IEEE Data Science Workshop (DSW), pp. 51–55. IEEE (2018)
8.
Zurück zum Zitat Eisenberg, E., Levanon, E.Y.: Preferential attachment in the protein network evolution. Phys. Rev. Lett. 91(13), 138701 (2003)CrossRef Eisenberg, E., Levanon, E.Y.: Preferential attachment in the protein network evolution. Phys. Rev. Lett. 91(13), 138701 (2003)CrossRef
9.
Zurück zum Zitat Estrada, E., Ross, G.J.: Centralities in simplicial complexes. applications to protein interaction networks. J. Theoretical Biol. 438, 46–60 (2018) Estrada, E., Ross, G.J.: Centralities in simplicial complexes. applications to protein interaction networks. J. Theoretical Biol. 438, 46–60 (2018)
11.
Zurück zum Zitat Foley, J.P., Dorsey, J.G.: A review of the exponentially modified gaussian (emg) function: evaluation and subsequent calculation of universal data. J. Chromatogr. Sci. 22(1), 40–46 (1984)CrossRef Foley, J.P., Dorsey, J.G.: A review of the exponentially modified gaussian (emg) function: evaluation and subsequent calculation of universal data. J. Chromatogr. Sci. 22(1), 40–46 (1984)CrossRef
14.
Zurück zum Zitat Hagberg, A., Swart, P., S Chult, D.: Exploring network structure, dynamics, and function using networkx. Tech. rep., Los Alamos National Lab.(LANL), Los Alamos, NM (United States) (2008) Hagberg, A., Swart, P., S Chult, D.: Exploring network structure, dynamics, and function using networkx. Tech. rep., Los Alamos National Lab.(LANL), Los Alamos, NM (United States) (2008)
15.
Zurück zum Zitat Hidalgo, C.A.: Economic complexity theory and applications. Nat. Rev. Phys. 3(2), 92–113 (2021)CrossRef Hidalgo, C.A.: Economic complexity theory and applications. Nat. Rev. Phys. 3(2), 92–113 (2021)CrossRef
16.
Zurück zum Zitat Hidalgo, C.A., Hausmann, R.: The building blocks of economic complexity. Proc. Natl. Acad. Sci. 106(26), 10570–10575 (2009)CrossRef Hidalgo, C.A., Hausmann, R.: The building blocks of economic complexity. Proc. Natl. Acad. Sci. 106(26), 10570–10575 (2009)CrossRef
17.
Zurück zum Zitat Hofmann, S.G., Curtiss, J., McNally, R.J.: A complex network perspective on clinical science. Perspect. Psychol. Sci. 11(5), 597–605 (2016)CrossRef Hofmann, S.G., Curtiss, J., McNally, R.J.: A complex network perspective on clinical science. Perspect. Psychol. Sci. 11(5), 597–605 (2016)CrossRef
18.
Zurück zum Zitat Holme, P., Kim, B.: Growing scale-free networks with tunable clustering. Phys. Rev. E, Stat. Nonlinear Soft Matter Phys. 652 Pt 2, 026107 (2002) Holme, P., Kim, B.: Growing scale-free networks with tunable clustering. Phys. Rev. E, Stat. Nonlinear Soft Matter Phys. 652 Pt 2, 026107 (2002)
19.
Zurück zum Zitat Iacopini, I., Petri, G., Barrat, A., Latora, V.: Simplicial models of social contagion. Nat. Commun. 10(1), 1–9 (2019)CrossRef Iacopini, I., Petri, G., Barrat, A., Latora, V.: Simplicial models of social contagion. Nat. Commun. 10(1), 1–9 (2019)CrossRef
20.
Zurück zum Zitat Jeong, H., Néda, Z., Barabási, A.L.: Measuring preferential attachment in evolving networks. EPL (Europhys. Lett.) 61(4), 567 (2003)CrossRef Jeong, H., Néda, Z., Barabási, A.L.: Measuring preferential attachment in evolving networks. EPL (Europhys. Lett.) 61(4), 567 (2003)CrossRef
21.
Zurück zum Zitat Kejriwal, M.: Link prediction between structured geopolitical events: Models and experiments. Front. Big Data 4, 779792 (2021)CrossRef Kejriwal, M.: Link prediction between structured geopolitical events: Models and experiments. Front. Big Data 4, 779792 (2021)CrossRef
22.
Zurück zum Zitat Kejriwal, M.: On using centrality to understand importance of entities in the panama papers. PLoS ONE 16(3), e0248573 (2021)CrossRef Kejriwal, M.: On using centrality to understand importance of entities in the panama papers. PLoS ONE 16(3), e0248573 (2021)CrossRef
23.
Zurück zum Zitat Kejriwal, M., Dang, A.: Structural studies of the global networks exposed in the panama papers. Appli. Netw. Sci. 5(1), 1–24 (2020) Kejriwal, M., Dang, A.: Structural studies of the global networks exposed in the panama papers. Appli. Netw. Sci. 5(1), 1–24 (2020)
24.
Zurück zum Zitat Kejriwal, M., Gu, Y.: Network-theoretic modeling of complex activity using UK online sex advertisements. Appli. Netw. Sci. 5, 1–23 (2020) Kejriwal, M., Gu, Y.: Network-theoretic modeling of complex activity using UK online sex advertisements. Appli. Netw. Sci. 5, 1–23 (2020)
25.
Zurück zum Zitat Kejriwal, M., Kapoor, R.: Network-theoretic information extraction quality assessment in the human trafficking domain. Appli. Netw. Sci. 4(1), 1–26 (2019) Kejriwal, M., Kapoor, R.: Network-theoretic information extraction quality assessment in the human trafficking domain. Appli. Netw. Sci. 4(1), 1–26 (2019)
27.
Zurück zum Zitat Knill, O.: The energy of a simplicial complex. Linear Algebra and its Applications (2020) Knill, O.: The energy of a simplicial complex. Linear Algebra and its Applications (2020)
28.
Zurück zum Zitat Lewis, T.G.: Network science: Theory and applications. John Wiley & Sons (2011) Lewis, T.G.: Network science: Theory and applications. John Wiley & Sons (2011)
29.
Zurück zum Zitat Lin, J., Ban, Y.: Complex network topology of transportation systems. Transp. Rev. 33(6), 658–685 (2013)CrossRef Lin, J., Ban, Y.: Complex network topology of transportation systems. Transp. Rev. 33(6), 658–685 (2013)CrossRef
31.
Zurück zum Zitat Milnor, J.: The geometric realization of a semi-simplicial complex. Annal. Math, 357–362 (1957) Milnor, J.: The geometric realization of a semi-simplicial complex. Annal. Math, 357–362 (1957)
32.
Zurück zum Zitat Milward, H.B., Provan, K.G.: Measuring network structure. Public Administration 76(2), 387–407 (1998)CrossRef Milward, H.B., Provan, K.G.: Measuring network structure. Public Administration 76(2), 387–407 (1998)CrossRef
33.
Zurück zum Zitat Mitchison, G., Durbin, R.: Bounds on the learning capacity of some multi-layer networks. Biol. Cybern. 60(5), 345–365 (1989)MathSciNetCrossRef Mitchison, G., Durbin, R.: Bounds on the learning capacity of some multi-layer networks. Biol. Cybern. 60(5), 345–365 (1989)MathSciNetCrossRef
34.
Zurück zum Zitat Motter, A.E., Zhou, C., Kurths, J.: Enhancing complex-network synchronization. EPL (Europhys. Lett.) 69(3), 334 (2005)CrossRef Motter, A.E., Zhou, C., Kurths, J.: Enhancing complex-network synchronization. EPL (Europhys. Lett.) 69(3), 334 (2005)CrossRef
35.
Zurück zum Zitat Pastor-Satorras, R., Castellano, C., Van Mieghem, P., Vespignani, A.: Epidemic processes in complex networks. Rev. Mod. Phys. 87(3), 925 (2015)MathSciNetCrossRef Pastor-Satorras, R., Castellano, C., Van Mieghem, P., Vespignani, A.: Epidemic processes in complex networks. Rev. Mod. Phys. 87(3), 925 (2015)MathSciNetCrossRef
36.
Zurück zum Zitat Schaub, M.T., Benson, A.R., Horn, P., Lippner, G., Jadbabaie, A.: Random walks on simplicial complexes and the normalized hodge 1-laplacian. SIAM Rev. 62(2), 353–391 (2020)MathSciNetCrossRef Schaub, M.T., Benson, A.R., Horn, P., Lippner, G., Jadbabaie, A.: Random walks on simplicial complexes and the normalized hodge 1-laplacian. SIAM Rev. 62(2), 353–391 (2020)MathSciNetCrossRef
38.
Zurück zum Zitat Serrano, D.H., Gómez, D.S.: Centrality measures in simplicial complexes: Applications of topological data analysis to network science. Appl. Math. Comput. 382, 125331 (2020)MathSciNetCrossRef Serrano, D.H., Gómez, D.S.: Centrality measures in simplicial complexes: Applications of topological data analysis to network science. Appl. Math. Comput. 382, 125331 (2020)MathSciNetCrossRef
39.
Zurück zum Zitat Serrano, D.H., Hernández-Serrano, J., Gómez, D.S.: Simplicial degree in complex networks. applications of topological data analysis to network science. Chaos, Solitons Fractals 137, 109839 (2020) Serrano, D.H., Hernández-Serrano, J., Gómez, D.S.: Simplicial degree in complex networks. applications of topological data analysis to network science. Chaos, Solitons Fractals 137, 109839 (2020)
40.
Zurück zum Zitat Skaburskis, A.: The origin of “wicked problems.” Planning Theory Pract. 9(2), 277–280 (2008) Skaburskis, A.: The origin of “wicked problems.” Planning Theory Pract. 9(2), 277–280 (2008)
42.
Zurück zum Zitat Torres, J.J., Bianconi, G.: Simplicial complexes: higher-order spectral dimension and dynamics. J. Phys. Complexity 1(1), 015002 (2020)CrossRef Torres, J.J., Bianconi, G.: Simplicial complexes: higher-order spectral dimension and dynamics. J. Phys. Complexity 1(1), 015002 (2020)CrossRef
43.
Zurück zum Zitat Torres, L., Blevins, A.S., Bassett, D.S., Eliassi-Rad, T.: The why, how, and when of representations for complex systems. arXiv preprint arXiv:2006.02870 (2020) Torres, L., Blevins, A.S., Bassett, D.S., Eliassi-Rad, T.: The why, how, and when of representations for complex systems. arXiv preprint arXiv:​2006.​02870 (2020)
45.
Zurück zum Zitat Wang, D., Zhao, Y., Leng, H., Small, M.: A social communication model based on simplicial complexes. Phys. Lett. A 384(35), 126895 (2020)MathSciNetCrossRef Wang, D., Zhao, Y., Leng, H., Small, M.: A social communication model based on simplicial complexes. Phys. Lett. A 384(35), 126895 (2020)MathSciNetCrossRef
46.
Zurück zum Zitat Xu, J., Wickramarathne, T.L., Chawla, N.V.: Representing higher-order dependencies in networks. Sci. Adv. 2(5), e1600028 (2016)CrossRef Xu, J., Wickramarathne, T.L., Chawla, N.V.: Representing higher-order dependencies in networks. Sci. Adv. 2(5), e1600028 (2016)CrossRef
Metadaten
Titel
An Analytical Approximation of Simplicial Complex Distributions in Communication Networks
verfasst von
Ke Shen
Mayank Kejriwal
Copyright-Jahr
2024
DOI
https://doi.org/10.1007/978-3-031-53503-1_2

Premium Partner