iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s13278-021-00741-3
Quantum mechanical model of information sharing in social networks | Social Network Analysis and Mining Skip to main content

Advertisement

Springer Nature Link
Log in

Quantum mechanical model of information sharing in social networks

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

The social network plays a significant role in the exchange of information in the system. Information sharing includes the exchange of ideas, thoughts, opinions about some product, politics, etc. It is essential to find the amount of information shared between the nodes in the network. Therefore, we introduced a quantum mechanical model for information sharing in the social network. The model considers different states of network components (nodes) and encodes the state of mind of individuals in the network. The node’s importance in the information flow is evaluated through the quantum walk approach. Besides, we also consider some classical mechanics parameters like different centrality measures to find mutual information shared between a node with its neighbor through the concept of marginal entropy and joint entropy. In the end, the results of the classical approach and quantum mechanical approach are compared and analyzed for a network constructed using different network models and validated through some real-world datasets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Albert R, Barabási A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47

    Article  MathSciNet  Google Scholar 

  • Berry SD, Wang JB (2010) Quantum-walk-based search and centrality. Phys Rev A 82(4):042333

    Article  Google Scholar 

  • Biamonte J, Faccin M, De Domenico M (2019) Complex networks from classical to quantum. Commun Phys 2(1):1–10

    Article  Google Scholar 

  • Bianconi G, Pin P, Marsili M (2009) Assessing the relevance of node features for network structure. Proc Natl Acad Sci 106(28):11433–11438

    Article  Google Scholar 

  • Bonacich P (1987) Power and centrality: a family of measures. Am J Sociol 92(5):1170–1182

    Article  Google Scholar 

  • Buldyrev SV, Roni P, Gerald P, Eugene SH, Shlomo H (2010) Catastrophic cascade of failures in interdependent networks. Nature 464(7291):1025–1028

    Article  Google Scholar 

  • Cardillo A, Galve F, Zueco D, Gómez-Gardenes J (2013) Information sharing in quantum complex networks. Phys Rev A 87(5):052312

    Article  Google Scholar 

  • Childs AM (2009) Universal computation by quantum walk. Phys Rev Lett 102(18):180501

    Article  MathSciNet  Google Scholar 

  • Coecke B (2005) Quantum information-flow, concretely, and axiomatically. Quantum Inform 2004 5833:15–29 International Society for Optics and Photonics

    Article  Google Scholar 

  • Doostmohammadian M, Khan UA (2020) On the controllability of clustered scale-free networks. J Complex Netw 8(1):cnz014

    MathSciNet  Google Scholar 

  • Doostmohammadian M, Rabiee HR, Khan UA (2020) Centrality-based epidemic control in complex social networks. Soc Netw Anal Min 10:1–11

    Article  Google Scholar 

  • Erdős P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17–60

    MathSciNet  MATH  Google Scholar 

  • Faccin M, Migdał P, Johnson TH, Bergholm V, Biamonte JD (2014) Community detection in quantum complex networks. Phys Rev X 4(4):041012

    Google Scholar 

  • Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry, pp 35–41

  • Freeman LC, Roeder D, Mulholland RR (1979) Centrality in social networks: Ii. Experimental results. Soc Netw 2(2):119–141

    Article  Google Scholar 

  • Friedkin NE (1982) Information flow through strong and weak ties in intraorganizational social networks. Soc Netw 3(4):273–285

    Article  MathSciNet  Google Scholar 

  • Godsil C (2013) Average mixing of continuous quantum walks. J Combin Theory Ser A 120(7):1649–1662

    Article  MathSciNet  Google Scholar 

  • Izaac JA, Zhan X, Wang K, Li J, Wang JB, Xue P (2017) Centrality measure based on continuous-time quantum walks and experimental realization. Phys Rev 95(3):032318

    Article  Google Scholar 

  • Kaiser M, Hilgetag CC (2006) Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems. PLoS Comput Biol 2(7):e95

    Article  Google Scholar 

  • Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39–43

    Article  Google Scholar 

  • Kendon VM (2006) A random walk approach to quantum algorithms. Philos Trans R Soc A Math Phys Eng Sci 364(1849):3407–3422

    Article  MathSciNet  Google Scholar 

  • Kimble HJ (2008) The quantum internet. Nature 453(7198):1023–1030

    Article  Google Scholar 

  • Komar P, Kessler EM, Bishof M, Jiang L, Sørensen AS, Ye J, Lukin MD (2014) A quantum network of clocks. Nat Phys 10(8):582–587

    Article  Google Scholar 

  • Lesne A (2014) Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics. Math Struct Comput Sci 24(3):e240311

  • Lin J (1991) Divergence measures based on the shannon entropy. IEEE Trans Inf Theory 37(1):145–151

    Article  MathSciNet  Google Scholar 

  • Newman M (2018) Networks. Oxford University Press, Oxford

    Book  Google Scholar 

  • Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab

    Google Scholar 

  • Petter H, Jun KB (2002) Growing scale-free networks with tunable clustering. Phys Rev E 65(2):026107

  • Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI conference on artificial intelligence, vol 29

  • Toivonen R, Onnela J-P, Saramäki J, Hyvönen J, Kaski K (2006) A model for social networks. Phys A 371(2):851–860

    Article  Google Scholar 

  • Watts DJ, Strogatz SH (1998) Collective dynamics of–small-world’s networks. Nature 393(6684):440–442

    Article  Google Scholar 

  • Wu F, Huberman BA, Adamic LA, Tyler JR (2004) Information flow in social groups. Phys A Stat Mech Appl 337(1–2):327–335

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Technology, Delhi, India

    Rajesh Kumar

  2. Bennett University, Greater Noida, India

    Suchi Kumari

  3. Khalsa College of Engineering and Technology, Amritsar, Punjab, India

    Manju Bala

Authors
  1. Rajesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suchi Kumari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manju Bala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suchi Kumari.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, R., Kumari, S. & Bala, M. Quantum mechanical model of information sharing in social networks. Soc. Netw. Anal. Min. 11, 42 (2021). https://doi.org/10.1007/s13278-021-00741-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-021-00741-3

Keywords

Search

Navigation