Skip to main content
Log in

Detection of constant member and overlapping community from dynamic literary network

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


A literary network consists of some characters extracted from any literary text and depicts their relationships, which is a significant example of the social network. The community structures among the members in the narrative are dynamic as the plot reveals from time to time. Some members of the network may reside in more than one community simultaneously and form an overlapping community structure. Some groups of nodes may always stay together in the same community irrespective of time. These nodes are classified as the constant members of the community and behave like authoritative characters of that network for the specified time. Detection of the variable communities within the different classes of people is always challenging for literary researchers. In this paper, we have proposed a dynamic, overlapping community and constant members detection method to study the variability in the social network through the timeline. The study has done by maximizing the stability of all the existing communities based on a various complex graph measuring metrics. As a case study, we have analysed two dramas presented in different languages, namely Strife and Nabanna, written by the Nobel laureate John Galsworthy and renowned play writer Bijon Bhattacharya, respectively, to analyze the varying community structure. We have revealed various features of the characters from the detected communities and compared them with the original literature. Our results confirm a similar social scenario as depicted in the literary domain. The analytical results over the benchmark data sets are more accurate compared to the other state-of-the-art methods and less biased than the human perspective.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others


  • Agarwal A, Corvalan A, Jensen J, Rambow O (2012) Social network analysis of alice in wonderland. In: Proceedings of the NAACLHLT 2012 workshop on computational linguistics for literature, pp 88–96

  • Ahn YY, Bagrow JP, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466(7307):761

    Article  Google Scholar 

  • Bales Kristen N, Eager Zachary D, Harkin Anthony A (2016) Efficiency-modularity for finding communities and anticommunities in networks. J Complex Netw 5(1):70–83

    Google Scholar 

  • Bhat SY, Abulaish M (2015) HOCTracker: tracking the evolution of hierarchical and overlapping communities in dynamic social networks. IEEE Trans Knowl Data Eng 27(4):1013–1019

    Article  Google Scholar 

  • Bhattacharya B (2008) Nabanna, 1st edn. Dey’s Publishing, Kolkata, India

  • Chakraborty T, Srinivasan S, Ganguly N, Bhowmick S, Mukherjee A (2013) Constant communities in complex networks. Sci Rep 3:1825

    Article  Google Scholar 

  • Chaudhary R, Bhusry M (2014) A new contrive to evaluate web page ranking. In: 2014 international conference on electronics and communication systems (ICECS), pp 1–6

  • Chen M, Kuzmin K, Szymanski BK (2014) Community detection via maximization of modularity and its variants. IEEE Trans Comput Soc Syst 1(1):46–65

    Article  Google Scholar 

  • Chen W, Liu Z, Sun X, Wang Y (2010) A game-theoretic framework to identify overlapping communities in social networks. Data Min Knowl Discov 21(2):224–240

    Article  MathSciNet  Google Scholar 

  • Cheng Q, Liu Z, Huang J, Zhu C, Liu Y (2012) Web intelligence and intelligent agent technology (WI-IAT). In: International conferences on 2012IEEE/WIC/ACM, vol 1. IEEE, pp 238–242

  • Chowdhury D (2001) Gananatya Andolan. Anustup Publication, Kolkata, India

    Google Scholar 

  • Coleman JS et al (1964) Introduction to mathematical sociology. Introduction to mathematical sociology

  • da Fonseca Vieira V, Xavier CR, Evsukoff AG (2020) A comparative study of overlapping community detection methods from the perspective of the structural properties. Appl Netw Sci 5(1):1–42

    Article  Google Scholar 

  • Dao VL, Bothorel C, Lenca P (2018). Estimating the similarity of community detection methods based on cluster size distribution. In: International conference on complex networks and their applications. Springer, pp 183–194

  • Duan D, Li Y, Jin Y, Lu Z (2009) Community mining on dynamic weighted directed graphs. In: Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management. ACM, pp 11–18

  • Elson DK, McKeown K (2010) Automatic attribution of quoted speech in literary narrative. In: AAAI

  • Evans Tim S (2010) Clique graphs and overlapping communities. J Stat Mech Theory Exp 2010(12):P12037

    Article  Google Scholar 

  • Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174

    Article  MathSciNet  Google Scholar 

  • Galsworthy J (1944) Strife: a drama in three acts. Duckworth, London, United Kingdom

    Google Scholar 

  • Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826

    Article  MathSciNet  Google Scholar 

  • Gleiser PM, Danon L (2003) Community structure in jazz. Adv Complex Syst 6(04):565–573

    Article  Google Scholar 

  • Gorovits A, Gujral E, Papalexakis EE, Bogdanov P (2018) Larc: Learning activity-regularized overlapping communities across time. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1465–1474

  • Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103018

  • Hossain MA (2015) Social realistic projections of galsworthy’s strife. English Lang Lit Stud 5(4):53

  • Huang L, Wang G, Wang Y, Blanzieri E, Su C (2013) Link clustering with extended link similarity and eq evaluation division. PLoS ONE 8(6):e66005

  • Kiss GR, Armstrong C, Milroy R, Piper J (1973) An associative thesaurus of english and its computer analysis. In: The computer and literary studies, pages 153–165

  • Knuth Donald Ervin (1993) The Stanford GraphBase: a platform for combinatorial computing, vol 1. AcM Press, New York

    MATH  Google Scholar 

  • Kydros D, Anastasiadis A (2015) Social network analysis in literature. the case of the great eastern by a. embirikos. In: Proceedings of the 5th European congress of modern greek studies of the European Society of Modern Greek Studies, vol 4, pp 681–702

  • Labatut V, Bost X (2019) Extraction and analysis of fictional character networks: a survey. ACM Comput Surv (CSUR) 52(5):1–40

    Article  Google Scholar 

  • Lai J-H, Wang C-D, Philip SY (2013) Dynamic community detection in weighted graph streams. In: SDM, pp 151–161

  • Lancichinetti A, Fortunato S, Filippo R (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110

  • Lancichinetti A, Fortunato S, Kertész J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033015

  • Li C, Zhou H, Zhou J, Xiang J, Qin Y, Zhong N (2015) Change in human brain functional network based on granger causality analysis. In: 2015 IEEE international conference on cyber technology in automation, control, and intelligent systems (CYBER), pp 1889–1893

  • Li M, Liu J, Wu P, Teng X (2019) Evolutionary network embedding preserving both local proximity and community structure. IEEE Trans Evol Comput 24:523–5355

    Google Scholar 

  • Li Z, Liu J, Wu K (2017) A multiobjective evolutionary algorithm based on structural and attribute similarities for community detection in attributed networks. IEEE Trans Cybernet 48(7):1963–1976

    Article  Google Scholar 

  • Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396–405

    Article  Google Scholar 

  • Meng X, Tong Y, Liu X, Zhao S, Yang X, Tan S (2016) A novel dynamic community detection algorithm based on modularity optimization. In: 2016 7th IEEE international conference on software engineering and service science (ICSESS), pp 72–75

  • Moody J (2001) Peer influence groups: identifying dense clusters in large networks. Soc Netw 23(4):261–283

    Article  Google Scholar 

  • Muhuri S, Chakraborty S, Chakraborty SN (2018) Extracting social network and character categorization from Bengali literature. IEEE Trans Comput Soc Syst 5(2):371–381

    Article  Google Scholar 

  • Narayanam R, Narahari Y (2012) A game theory inspired, decentralized, local information based algorithm for community detection in social graphs. In: 2012 21st international conference on pattern recognition (ICPR), pp 1072–1075

  • Newman Mark EJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404–409

    Article  MathSciNet  Google Scholar 

  • Newman Mark EJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066133

  • Nguyen NP, Dinh TN, Tokala S, Thai MT (2011) Overlapping communities in dynamic networks: their detection and mobile applications. In: Proceedings of the 17th annual international conference on mobile computing and networking, pp 85–96

  • Nguyen NP, Dinh TN, Shen Y, Thai MT (2014) Dynamic social community detection and its applications. PLoS ONE 9(4):e91431

  • Nicosia V, Mangioni G, Carchiolo V, Malgeri M (2009) Extending the definition of modularity to directed graphs with overlapping communities. J Stat Mech Theory Exp 03:P03024

    Google Scholar 

  • Nilmada M, Salim R (2016) The diameter of enhanced extended fibonacci cube interconnection networks. In: Proceedings of second international conference on electrical systems, technology and information 2015 (ICESTI 2015). Springer, pp 675–683

  • Opsahl T, Agneessens F, Skvoretz J (2010) Node centrality in weighted networks: generalizing degree and shortest paths. Soc Netw 32(3):245–251

    Article  Google Scholar 

  • Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814

    Article  Google Scholar 

  • Ponnambalam L, Xiuju F, Goh RS, Sarawgi D (2016) A multi-agent model for adaptive vaccination during infectious disease outbreaks. In: International conference on computing technologies and intelligent data engineering (ICCTIDE), pp 1–5

  • Seo D, Choi Y, Lee MH, Yu SJ (2017) Development of biological network crawling, clustering and visualization system. In: 2017 14th international conference on electrical engineering/electronics, computer, telecommunications and information technology (ECTI-CON), pp 726–728

  • Shang J, Liu L, Xie F, Chen Z, Miao J, Fang X, Wu C (2014) A real-time detecting algorithm for tracking community structure of dynamic networks. arXiv:1407.2683

  • Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: extraction and mining of academic social networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 990–998

  • Tang J, Tang X, Yuan J (2017) Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans Knowl Data Eng 30(6):1095–1108

    Article  Google Scholar 

  • Tapaswi M, Bauml M, Stiefelhagen R (2015) Book2movie: aligning video scenes with book chapters. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 1827–1835

  • Teng X, Liu J, Li M (2019) Overlapping community detection in directed and undirected attributed networks using a multiobjective evolutionary algorithm. IEEE Trans Cybern 5:138–150

    Google Scholar 

  • Van Lierde H, Chow TW, Chen G (2019) Scalable spectral clustering for overlapping community detection in large-scale networks. IEEE Trans Knowl Data Eng 32(4):754–767

    Article  Google Scholar 

  • Wang W, Jiao P, He D, Jin D, Pan L, Gabrys B (2016) Autonomous overlapping community detection in temporal networks: a dynamic bayesian nonnegative matrix factorization approach. Knowl-Based Syst 110:121–134

    Article  Google Scholar 

  • Wang X, Liu G, Li J (2017) Overlapping community detection based on structural centrality in complex networks. IEEE Access 5:25258–25269

    Article  Google Scholar 

  • Whang JJ, Dhillon IS, Gleich DF (2015) Non-exhaustive, overlapping k-means. In: Proceedings of the 2015 SIAM international conference on data mining, pp 936–944

  • Xie J, Chen M, Szymanski BK. Labelrank T (2013a) Labelrankt: Incremental community detection in dynamic networks via label propagation. In: Proceedings of the workshop on dynamic networks management and mining. ACM, pages 25–32

  • Xie J, Kelley S, Szymanski BK (2013b) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv (CSUR) 45(4):43

    Article  Google Scholar 

  • Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the sixth ACM international conference on Web search and data mining, pp 587–596

  • Zachary Wayne W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452–473

    Article  Google Scholar 

  • Zhang S, Wang RS, Zhang XS (2007) Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Phys A Stat Mech Appl 374(1):483–490

    Article  Google Scholar 

  • Zhou L, Yang P, Wang L, Kong B (2015) An approach for overlapping and hierarchical community detection in social networks based on coalition formation game theory. Expert Syst Appl 42(24):9634–9646

    Article  Google Scholar 

  • Zhu Y, Kiros R, Zemel R, Salakhutdinov R, Urtasun R (2015) Aligning books and movies: Towards story-like visual explanations by watching movies and reading books. In: Proceedings of the IEEE international conference on computer vision, pp 19–27

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Susanta Chakraborty.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

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

Chakraborty, S., Muhuri, S. & Das, D. Detection of constant member and overlapping community from dynamic literary network. Soc. Netw. Anal. Min. 11, 77 (2021).

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: