Skip to main content

2021 | OriginalPaper | Buchkapitel

40. Efficient Information Flow Based on Graphical Network Characteristics

verfasst von : Rahul Saxena, Mahipal Jadeja, Atul Kumar Verma

Erschienen in: Proceedings of the International Conference on Paradigms of Computing, Communication and Data Sciences

Verlag: Springer Singapore

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

search-config
loading …

Abstract

In today’s environment of rapid information generation, getting precise information about an event is not only sufficient but getting that information in time (or as early as possible) is rather more important. Further, in certain situations, it may also be equally important to put a control to a sort of outbreak in the network. This calls for the processes and techniques which can be developed to make the information to flow from one source to another as per the desired necessities. Social networks, VANETs, electrical circuit networks, etc. are prime examples where channelized information flow is required to accomplish the desired task. For this, we need to map or mimic the real information flow scenario to some simulative environment or model. In this paper, basic graph theory concepts have been used to model various scenarios of these suggested networks to depict how network characteristics can play a vital role to make the information flow happen in a more systematic and optimized way so that the desired task can be accomplished. The paper takes into consideration degree distribution of the graph, PageRank scores, strongly connected components, weakly connected components, average path length, etc. and other desired characteristics that will guide node to node information flow so that various parameters remain optimized like path length, no. of nodes visited, etc. The graphical model will be mimicked using Stanford Network Analysis Platform (SNAP) to evaluate these basic measure’s characteristics and help us propose different algorithms depending upon the scenarios. Finally, the paper will be concluded with an insight that how the algorithms can be worked out to already existing framework using these network characteristics.

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 Segaran T, Evans C, Taylor J (2009) Programming the semantic web: build flexible applications with graph data. O’Reilly Media Inc., MA, USA Segaran T, Evans C, Taylor J (2009) Programming the semantic web: build flexible applications with graph data. O’Reilly Media Inc., MA, USA
2.
Zurück zum Zitat Bigdeli A, Tizghadam A, Leon-Garcia A (2009) Comparison of network criticality, algebraic connectivity, and other graph metrics. In: Proceedings of the 1st annual workshop on simplifying complex network for practitioners. ACM, Venice, Italy, pp 1–6 Bigdeli A, Tizghadam A, Leon-Garcia A (2009) Comparison of network criticality, algebraic connectivity, and other graph metrics. In: Proceedings of the 1st annual workshop on simplifying complex network for practitioners. ACM, Venice, Italy, pp 1–6
3.
Zurück zum Zitat Frey C, Züfle A, Emrich T, Renz M (2018) Efficient information flow maximization in probabilistic graphs. IEEE Trans Knowl Data Eng 30(5):880–894CrossRef Frey C, Züfle A, Emrich T, Renz M (2018) Efficient information flow maximization in probabilistic graphs. IEEE Trans Knowl Data Eng 30(5):880–894CrossRef
4.
Zurück zum Zitat Chen YC, Peng WC, Lee SY (2012) Efficient algorithms for influence maximization in social networks. Knowl Inf Syst 33(3):577–601. (Springer) Chen YC, Peng WC, Lee SY (2012) Efficient algorithms for influence maximization in social networks. Knowl Inf Syst 33(3):577–601. (Springer)
5.
Zurück zum Zitat Saito K, Kimura M, Ohara K, Motoda H (2016) Detecting critical links in complex network to maintain information flow/reachability. In: Richard B, Zhang ML (eds) Proceedings of the 14th pacific rim international conference on trends in artificial intelligence. Springer, Cham, pp 419–432 Saito K, Kimura M, Ohara K, Motoda H (2016) Detecting critical links in complex network to maintain information flow/reachability. In: Richard B, Zhang ML (eds) Proceedings of the 14th pacific rim international conference on trends in artificial intelligence. Springer, Cham, pp 419–432
6.
Zurück zum Zitat Temel T, Karimov F (2019) Information systems model for targeting policies: a graph-theoretic analysis of expert knowledge. Expert Syst Appl 119:400–414CrossRef Temel T, Karimov F (2019) Information systems model for targeting policies: a graph-theoretic analysis of expert knowledge. Expert Syst Appl 119:400–414CrossRef
7.
Zurück zum Zitat Bagrow J et al (2019) Publisher correction: information flow reveals prediction limits in online social activity. Nat Hum Behav 3(2):195CrossRef Bagrow J et al (2019) Publisher correction: information flow reveals prediction limits in online social activity. Nat Hum Behav 3(2):195CrossRef
8.
Zurück zum Zitat Liu W, Wu X, Yang W, Zhu X, Zhong S (2019) Modeling cyber rumor spreading over mobile social networks: a compartment approach. Appl Math Comput 343:214–229MATH Liu W, Wu X, Yang W, Zhu X, Zhong S (2019) Modeling cyber rumor spreading over mobile social networks: a compartment approach. Appl Math Comput 343:214–229MATH
9.
Zurück zum Zitat Indu V, Thampi SM (2019) A nature-inspired approach based on forest fire model for modeling rumor propagation in social networks. J Netw Comput Appl 125:28–41CrossRef Indu V, Thampi SM (2019) A nature-inspired approach based on forest fire model for modeling rumor propagation in social networks. J Netw Comput Appl 125:28–41CrossRef
10.
Zurück zum Zitat Li Y, Qiu B, Chen Y, Zhao HV (2019) Analysis of information diffusion with irrational users: a graphical evolutionary game approach. In: 2019 IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, Brighton, United Kingdom, pp 2527–2531 Li Y, Qiu B, Chen Y, Zhao HV (2019) Analysis of information diffusion with irrational users: a graphical evolutionary game approach. In: 2019 IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, Brighton, United Kingdom, pp 2527–2531
11.
Zurück zum Zitat Hartmann M, Golovchenko Y, Augenstein I (2019) Mapping (dis-) information flow about the MH17 plane crash. In: Proceedings of the second workshop on natural language processing for internet freedom: censorship, disinformation, and propaganda. Association for Computational Linguistics, Hong Kong, China, pp 45–55 Hartmann M, Golovchenko Y, Augenstein I (2019) Mapping (dis-) information flow about the MH17 plane crash. In: Proceedings of the second workshop on natural language processing for internet freedom: censorship, disinformation, and propaganda. Association for Computational Linguistics, Hong Kong, China, pp 45–55
12.
Zurück zum Zitat Sucharitha Y, Vijayawada Y, Prasad VK (2019) Analysis of early detection of emerging patterns from social media networks: a data mining techniques perspective. In: Soft computing and signal processing. Springer, Singapore, pp 15–25 Sucharitha Y, Vijayawada Y, Prasad VK (2019) Analysis of early detection of emerging patterns from social media networks: a data mining techniques perspective. In: Soft computing and signal processing. Springer, Singapore, pp 15–25
15.
Zurück zum Zitat Park S, Lee W, Choe B, Lee SG (2019) A survey on personalized PageRank computation algorithms. IEEE Access 7:163049–163062CrossRef Park S, Lee W, Choe B, Lee SG (2019) A survey on personalized PageRank computation algorithms. IEEE Access 7:163049–163062CrossRef
Metadaten
Titel
Efficient Information Flow Based on Graphical Network Characteristics
verfasst von
Rahul Saxena
Mahipal Jadeja
Atul Kumar Verma
Copyright-Jahr
2021
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-7533-4_40

Neuer Inhalt