Skip to main content

2018 | OriginalPaper | Buchkapitel

The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs

verfasst von : Mindaugas Bloznelis, Jerzy Jaworski

Erschienen in: Algorithms and Models for the Web Graph

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

We establish the asymptotic normality of the global clustering coefficient in sparse uniform random intersection graphs.

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!

Literatur
1.
Zurück zum Zitat Bentkus, V., Götze, F., van Zwet, W.R.: An edgeworth expansion for symmetric statistics. Ann. Stat. 25, 851–896 (1997)MathSciNetCrossRef Bentkus, V., Götze, F., van Zwet, W.R.: An edgeworth expansion for symmetric statistics. Ann. Stat. 25, 851–896 (1997)MathSciNetCrossRef
2.
Zurück zum Zitat Bloznelis, M.: On combinatorial Hoeffding decomposition and asymptotic normality of sub-graph count statistics. In: Drmota, M., Flajolet, P., Gardy, D., Gittenberger, B. (eds.) Mathematics and Computer Science III. Algorithms, Trees, Combinatorics and Probabilities, pp. 73–79. Trends in Mathematics, Birkhauser (2004)CrossRef Bloznelis, M.: On combinatorial Hoeffding decomposition and asymptotic normality of sub-graph count statistics. In: Drmota, M., Flajolet, P., Gardy, D., Gittenberger, B. (eds.) Mathematics and Computer Science III. Algorithms, Trees, Combinatorics and Probabilities, pp. 73–79. Trends in Mathematics, Birkhauser (2004)CrossRef
3.
Zurück zum Zitat Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. Ann. Appl. Probab. 23, 1254–1289 (2013)MathSciNetCrossRef Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. Ann. Appl. Probab. 23, 1254–1289 (2013)MathSciNetCrossRef
4.
Zurück zum Zitat Bloznelis, M., Godehardt, E., Jaworski, J., Kurauskas, V., Rybarczyk, K.: Recent progress in complex network analysis: models of random intersection graphs. In: Lausen, B., Krolak-Schwerdt, S., Böhmer, M. (eds.) Data Science, Learning by Latent Structures, and Knowledge Discovery. SCDAKO, pp. 69–78. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-44983-7_6CrossRef Bloznelis, M., Godehardt, E., Jaworski, J., Kurauskas, V., Rybarczyk, K.: Recent progress in complex network analysis: models of random intersection graphs. In: Lausen, B., Krolak-Schwerdt, S., Böhmer, M. (eds.) Data Science, Learning by Latent Structures, and Knowledge Discovery. SCDAKO, pp. 69–78. Springer, Heidelberg (2015). https://​doi.​org/​10.​1007/​978-3-662-44983-7_​6CrossRef
5.
Zurück zum Zitat Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47 (2002) Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47 (2002)
6.
Zurück zum Zitat Hoeffding, V.: A class of statistics with asymptotically normal distribution. Ann. Math. Stat. 19, 293–325 (1948)MathSciNetCrossRef Hoeffding, V.: A class of statistics with asymptotically normal distribution. Ann. Math. Stat. 19, 293–325 (1948)MathSciNetCrossRef
7.
Zurück zum Zitat Janson, S., Nowicki, K.: The asymptotic distributions of generalized \(U\)-statistics with applications to random graphs. Probab. Theory Relat. Fields 90, 341–375 (1991)MathSciNetCrossRef Janson, S., Nowicki, K.: The asymptotic distributions of generalized \(U\)-statistics with applications to random graphs. Probab. Theory Relat. Fields 90, 341–375 (1991)MathSciNetCrossRef
8.
Zurück zum Zitat Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2002)CrossRef Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2002)CrossRef
9.
Zurück zum Zitat Rybarczyk, K., Stark, D.: Poisson approximation of the number of cliques in a random intersection graph. J. Appl. Probab. 47(3), 826–840 (2010)MathSciNetCrossRef Rybarczyk, K., Stark, D.: Poisson approximation of the number of cliques in a random intersection graph. J. Appl. Probab. 47(3), 826–840 (2010)MathSciNetCrossRef
10.
Zurück zum Zitat Stein, C.: A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, vol. 2, pp. 583–602 (1970) Stein, C.: A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, vol. 2, pp. 583–602 (1970)
11.
Zurück zum Zitat Tikhomirov, A.N.: On the convergence rate in the central limit theorem for weakly dependent random variables. Theory Probab. Appl. 25, 790–809 (1981)CrossRef Tikhomirov, A.N.: On the convergence rate in the central limit theorem for weakly dependent random variables. Theory Probab. Appl. 25, 790–809 (1981)CrossRef
12.
Zurück zum Zitat Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)CrossRef Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)CrossRef
13.
Zurück zum Zitat Yagan, O., Makowski, A.M.: Random key graphs can they be small worlds? In: 2009 First International Conference on Networks and Communications, pp. 313–318 (2009) Yagan, O., Makowski, A.M.: Random key graphs can they be small worlds? In: 2009 First International Conference on Networks and Communications, pp. 313–318 (2009)
14.
Zurück zum Zitat Zhao, J., Yagan, O., Gligor, V.: Random intersection graphs and their applications in security, wireless communication, and social networks (2015). arXiv:1504.03161 Zhao, J., Yagan, O., Gligor, V.: Random intersection graphs and their applications in security, wireless communication, and social networks (2015). arXiv:​1504.​03161
Metadaten
Titel
The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs
verfasst von
Mindaugas Bloznelis
Jerzy Jaworski
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-92871-5_2