{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:55:37Z","timestamp":1757627737510,"version":"3.44.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"project SERICS","award":["PE00000014"],"award-info":[{"award-number":["PE00000014"]}]},{"name":"project Tuscany Health Ecosystem","award":["B83C22003920001"],"award-info":[{"award-number":["B83C22003920001"]}]},{"DOI":"10.13039\/501100018870","name":"Poul Due Jensen Foundation","doi-asserted-by":"crossref","award":["883901"],"award-info":[{"award-number":["883901"]}],"id":[{"id":"10.13039\/501100018870","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Villum Investigator Grant S4OS"},{"name":"the Fsc regional Tuscan project AISLEA2","award":["J54D23000780005"],"award-info":[{"award-number":["J54D23000780005"]}]},{"name":"project SMaRT COnSTRUCT","award":["J53C24001460006"],"award-info":[{"award-number":["J53C24001460006"]}]},{"name":"project FAIR","award":["I53C22001380006"],"award-info":[{"award-number":["I53C22001380006"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Regular equivalence aims to identify nodes that have links to nodes that are themselves equivalent, and is considered to capture key relational properties in networks. Exact equivalences are notoriously difficult to emerge in real-world networks because of the rather stringent criteria required. This has motivated the development of approximate approaches, which, however, do not scale well to large networks. In this paper, we present a new method to compute approximate regular equivalences for weighted networks based on a partition refinement algorithm. This is parameterized by a tolerance <jats:inline-formula>\n              <jats:tex-math>$$\\varepsilon $$<\/jats:tex-math>\n            <\/jats:inline-formula> that determines the extent to which two nodes may be deemed equivalent. We also show an asymptotic result for networks with power-law distribution that analytically provides a partition of approximately equivalent nodes. Using a number of benchmark networks, we show that our method outperforms the state of the art in terms of precision and running time. When the asymptotic partition is used to initialize the partition refinement algorithm for real-world networks, it avoids the problem of aggressive clustering that affects binary networks.<\/jats:p>","DOI":"10.1007\/s41109-025-00726-7","type":"journal-article","created":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T12:59:55Z","timestamp":1756299595000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate regular equivalence by partition refinement"],"prefix":"10.1007","volume":"10","author":[{"given":"Giuseppe","family":"Squillace","sequence":"first","affiliation":[]},{"given":"Mirco","family":"Tribastone","sequence":"additional","affiliation":[]},{"given":"Max","family":"Tschaikowski","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Vandin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"726_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-57454-7_23","volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"NK Ahmed","year":"2017","unstructured":"Ahmed NK, Rossi RA, Willke TL, Zhou R (2017) Edge role discovery via higher-order structures. Pacific-Asia conference on knowledge discovery and data mining. Springer, Cham, pp 291\u2013303"},{"issue":"3","key":"726_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/2667105","volume":"45","author":"G Ahuja","year":"2000","unstructured":"Ahuja G (2000) Collaboration networks, structural holes, and innovation: a longitudinal study. Adm Sci Q 45(3):425\u2013455","journal-title":"Adm Sci Q"},{"key":"726_CR3","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu L, Tong H, Koutra D (2015) Graph based anomaly detection and description: a survey. Data Min Knowl Disc 29:626\u2013688","journal-title":"Data Min Knowl Disc"},{"key":"726_CR4","doi-asserted-by":"crossref","unstructured":"Bacci G, Bacci G, Larsen KG, Tribastone M, Tschaikowski M, Vandin A (2021) Efficient local computation of differential bisimulations via coupling and up-to methods. In: 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). pp 1\u201314","DOI":"10.1109\/LICS52264.2021.9470555"},{"issue":"1","key":"726_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1999.1683","volume":"60","author":"C Baier","year":"2000","unstructured":"Baier C, Engelen B, Majster-Cederbaum M (2000) Deciding bisimilarity and similarity for probabilistic processes. J Comput Syst Sci 60(1):187\u2013231","journal-title":"J Comput Syst Sci"},{"key":"726_CR6","volume-title":"The science of networks","author":"A-L Barab\u00e1si","year":"2012","unstructured":"Barab\u00e1si A-L (2012) The science of networks. Perseus, Cambridge MA"},{"issue":"5","key":"726_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1038\/scientificamerican0503-60","volume":"288","author":"A-L Barab\u00e1si","year":"2003","unstructured":"Barab\u00e1si A-L, Bonabeau E (2003) Scale-free networks. Sci Am 288(5):60\u201369","journal-title":"Sci Am"},{"key":"726_CR8","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets"},{"key":"726_CR9","doi-asserted-by":"publisher","first-page":"100247","DOI":"10.1016\/j.cosrev.2020.100247","volume":"37","author":"HD Bedru","year":"2020","unstructured":"Bedru HD, Yu S, Xiao X, Zhang D, Wan L, Guo H, Xia F (2020) Big networks: a survey. Computer science review 37:100247","journal-title":"Computer science review"},{"issue":"1","key":"726_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B, Riordan O (2004) The diameter of a scale-free random graph. Combinatorica 24(1):5\u201334","journal-title":"Combinatorica"},{"issue":"1","key":"726_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0378-8733(89)90018-X","volume":"11","author":"SP Borgatti","year":"1989","unstructured":"Borgatti SP, Everett MG (1989) The class of all regular equivalences: algebraic structure and computation. Social networks 11(1):65\u201388","journal-title":"Social networks"},{"key":"726_CR12","doi-asserted-by":"crossref","unstructured":"Borgatti SP, Everett MG (1992) Notions of position in social network analysis. Soc Methodol 1\u201335","DOI":"10.2307\/270991"},{"issue":"4","key":"726_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0378-8733(93)90012-A","volume":"15","author":"SP Borgatti","year":"1993","unstructured":"Borgatti SP, Everett MG (1993) Two algorithms for computing regular equivalence. Soc Netw 15(4):361\u2013376","journal-title":"Soc Netw"},{"key":"726_CR14","first-page":"12","volume":"6","author":"SP Borgatti","year":"2002","unstructured":"Borgatti SP, Everett MG, Freeman LC (2002) Ucinet for windows: software for social network analysis. Harvard MA analytic technologies 6:12\u201315","journal-title":"Harvard MA analytic technologies"},{"issue":"3","key":"726_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00357-010-9062-8","volume":"27","author":"U Brandes","year":"2010","unstructured":"Brandes U, Lerner J (2010) Structural similarity: spectral methods for relaxed blockmodeling. J Classif 27(3):279\u2013306","journal-title":"J Classif"},{"key":"726_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-95322-4_5","volume-title":"Optimization and Operations Research: Proceedings of a Workshop Held at the University of Bonn, October 2\u20138, 1977","author":"P Brucker","year":"1978","unstructured":"Brucker P (1978) On the complexity of clustering problems. Optimization and Operations Research: Proceedings of a Workshop Held at the University of Bonn, October 2\u20138, 1977. Springer, Berlin, pp 45\u201354"},{"issue":"1","key":"726_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/3215235","volume":"31","author":"P Buchholz","year":"1994","unstructured":"Buchholz P (1994) Exact and ordinary lumpability in finite Markov chains. J Appl Probab 31(1):59\u201375","journal-title":"J Appl Probab"},{"issue":"38","key":"726_CR18","doi-asserted-by":"publisher","first-page":"10029","DOI":"10.1073\/pnas.1702697114","volume":"114","author":"L Cardelli","year":"2017","unstructured":"Cardelli L, Tribastone M, Tschaikowski M, Vandin A (2017a) Maximal aggregation of polynomial dynamical systems. Proc Natl Acad Sci 114(38):10029\u201310034","journal-title":"Proc Natl Acad Sci"},{"key":"726_CR19","doi-asserted-by":"crossref","unstructured":"Cardelli L, Tribastone M, Tschaikowski M, Vandin A (2017b) ERODE: A tool for the evaluation and reduction of ordinary differential equations. In: TACAS","DOI":"10.1007\/978-3-662-54580-5_19"},{"key":"726_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-99154-2_7","volume-title":"Quantitative Evaluation of Systems","author":"L Cardelli","year":"2018","unstructured":"Cardelli L, Tribastone M, Tschaikowski M, Vandin A (2018) Guaranteed error bounds on approximate model abstractions through reachability analysis. In: McIver A, Horvath A (eds) Quantitative Evaluation of Systems. Springer, Cham, pp 104\u2013121"},{"key":"726_CR21","doi-asserted-by":"publisher","first-page":"100876","DOI":"10.1016\/j.jlamp.2023.100876","volume":"134","author":"L Cardelli","year":"2023","unstructured":"Cardelli L, Squillace G, Tribastone M, Tschaikowski M, Vandin A (2023) Formal lumping of polynomial differential equations through approximate equivalences. J Log Algebr Methods Programm 134:100876","journal-title":"J Log Algebr Methods Programm"},{"key":"726_CR70","unstructured":"Cardelli L, Squillace G, Tribastone M, TchaikowskiM, Vandin A Evaluation, Reduction, and Approximation of Dynamical Systems and Networks withERODE International Symposium on Automated Technology for Verification and Analysis (ATVA)2025 (accepted)"},{"issue":"5","key":"726_CR22","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.aam.2013.07.003","volume":"51","author":"M Chamberland","year":"2013","unstructured":"Chamberland M, Straub A (2013) On gamma quotients and infinite products. Adv Appl Math 51(5):546\u2013562","journal-title":"Adv Appl Math"},{"key":"726_CR23","doi-asserted-by":"crossref","unstructured":"Chen D, Breugel F, Worrell J (2012) On the complexity of computing probabilistic bisimilarity. Foundations of software science and computational structures: 15th International Conference,, FOSSACS 2012, Held as Part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24\u2013April 1, 2012. Proceedings 15. Springer, Berlin, pp 437\u2013451","DOI":"10.1007\/978-3-642-28729-9_29"},{"issue":"4","key":"726_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1038\/nphys560","volume":"3","author":"V Colizza","year":"2007","unstructured":"Colizza V, Pastor-Satorras R, Vespignani A (2007) Reaction-diffusion processes and metapopulation models in heterogeneous networks. Nat Phys 3(4):276\u2013282","journal-title":"Nat Phys"},{"issue":"1","key":"726_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms7864","volume":"6","author":"M De Domenico","year":"2015","unstructured":"De Domenico M, Nicosia V, Arenas A, Latora V (2015) Structural reducibility of multilayer networks. Nat Commun 6(1):1\u20139","journal-title":"Nat Commun"},{"key":"726_CR26","doi-asserted-by":"crossref","unstructured":"Donnat C, Zitnik M, Hallac D, Leskovec J (2018) Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th ACM SIGKDD International conference on knowledge discovery & data mining. pp 1320\u20131329","DOI":"10.1145\/3219819.3220025"},{"key":"726_CR27","volume-title":"Generalized blockmodeling","author":"P Doreian","year":"2005","unstructured":"Doreian P, Batagelj V, Ferligoj A (2005) Generalized blockmodeling, vol 25. Cambridge University Press, Cambridge"},{"issue":"4","key":"726_CR28","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0378-8733(85)90013-9","volume":"7","author":"MG Everett","year":"1985","unstructured":"Everett MG (1985) Role similarity and complexity in social networks. Soc Netw 7(4):353\u2013359","journal-title":"Soc Netw"},{"issue":"3\u20134","key":"726_CR29","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.1990.9990067","volume":"15","author":"MG Everett","year":"1990","unstructured":"Everett MG, Boyd JP, Borgatti SP (1990) Ego-centered and local roles: a graph theoretic approach. J Math Sociol 15(3\u20134):163\u2013172","journal-title":"J Math Sociol"},{"key":"726_CR30","unstructured":"Freeman SC, Freeman LC (1979) The networkers network: a study of the impact of a new communications medium on sociometric structure. School of Social Sciences University of Calif..???"},{"issue":"4","key":"726_CR31","doi-asserted-by":"publisher","first-page":"0215296","DOI":"10.1371\/journal.pone.0215296","volume":"14","author":"T Funke","year":"2019","unstructured":"Funke T, Becker T (2019) Stochastic block models: a comparison of variants and inference methods. PLoS ONE 14(4):0215296","journal-title":"PLoS ONE"},{"key":"726_CR32","doi-asserted-by":"crossref","unstructured":"Gaulier G, Zignago S (2010) BACI: International trade database at the product-level. the 1994-2007 version. Working Papers 2010\u201323, CEPII. http:\/\/www.cepii.fr\/CEPII\/fr\/publications\/wp\/abstract.asp?NoDoc=2726","DOI":"10.2139\/ssrn.1994500"},{"key":"726_CR33","first-page":"483","volume-title":"Joint European conference on machine learning and knowledge discovery in databases","author":"D Jin","year":"2019","unstructured":"Jin D, Heimann M, Rossi RA, Koutra D (2019a) Node2bits: Compact time-and attribute-aware node representations for user stitching. Joint European conference on machine learning and knowledge discovery in databases. Springer, Cham, pp 483\u2013506"},{"key":"726_CR34","doi-asserted-by":"crossref","unstructured":"Jin D, Heimann M, Safavi T, Wang M, Lee W, Snider L, Koutra D (2019b) Smart roles: Inferring professional roles in email networks. In: Proceedings of the 25th ACM SIGKDD International conference on knowledge discovery & data mining. pp 2923\u20132933","DOI":"10.1145\/3292500.3330735"},{"issue":"1","key":"726_CR35","doi-asserted-by":"publisher","first-page":"275","DOI":"10.25300\/MISQ\/2014\/38.1.13","volume":"38","author":"GC Kane","year":"2014","unstructured":"Kane GC, Alavi M, Labianca G, Borgatti SP (2014) What s different about social media networks? a framework and research agenda. MIS Q 38(1):275\u2013304","journal-title":"MIS Q"},{"key":"726_CR36","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web. pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"issue":"1","key":"726_CR37","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F Lorrain","year":"1971","unstructured":"Lorrain F, White HC (1971) Structural equivalence of individuals in social networks. J Math Soc 1(1):49\u201380","journal-title":"J Math Soc"},{"issue":"3","key":"726_CR38","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1006\/jtbi.2003.3147","volume":"220","author":"JJ Luczkovich","year":"2003","unstructured":"Luczkovich JJ, Borgatti SP, Johnson JC, Everett MG (2003) Defining and measuring trophic role similarity in food webs using regular equivalence. J Theor Biol 220(3):303\u2013321","journal-title":"J Theor Biol"},{"issue":"1","key":"726_CR39","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0378-8733(02)00036-9","volume":"25","author":"M Marx","year":"2003","unstructured":"Marx M, Masuch M (2003) Regular equivalence and dynamic logic. Soc Netw 25(1):51\u201365","journal-title":"Soc Netw"},{"issue":"2","key":"726_CR40","first-page":"49","volume":"17","author":"M Matjasi\u0109","year":"2020","unstructured":"Matjasi\u0109 M, Cugmas M, \u1e90iberna A (2020) Blockmodeling: an R package for generalized blockmodeling. Adv Methodoland Stat 17(2):49\u201366","journal-title":"Adv Methodoland Stat"},{"key":"726_CR41","volume-title":"A Calcul Commun Syst","author":"R Milner","year":"1982","unstructured":"Milner R (1982) A Calcul Commun Syst. Springer, Berlin, Heidelberg"},{"issue":"5","key":"726_CR42","first-page":"2045","volume":"33","author":"G Nikolentzos","year":"2019","unstructured":"Nikolentzos G, Vazirgiannis M (2019) Learning structural node representations using graph kernels. IEEE Trans Knowl Data Eng 33(5):2045\u20132056","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"726_CR43","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Soc Netw 31(2):155\u2013163","journal-title":"Soc Netw"},{"key":"726_CR44","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1009991701667","volume":"1","author":"L Orsenigo","year":"1997","unstructured":"Orsenigo L, Pammolli F, Riccaboni M, Bonaccorsi A, Turchetti G (1997) The evolution of knowledge and the dynamics of an industry network. J Manag Govern 1:147\u2013175","journal-title":"J Manag Govern"},{"issue":"6","key":"726_CR45","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige R, Tarjan R (1987) Three partition refinement algorithms. SIAM J Comput 16(6):973\u2013989","journal-title":"SIAM J Comput"},{"key":"726_CR46","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"726_CR47","doi-asserted-by":"crossref","unstructured":"Peixoto TP (2019) Bayesian stochastic blockmodeling. In: Advances in network clustering and blockmodeling. pp 289\u2013332","DOI":"10.1002\/9781119483298.ch11"},{"issue":"5","key":"726_CR48","doi-asserted-by":"publisher","first-page":"027","DOI":"10.1093\/comnet\/cnab027","volume":"9","author":"T Petrov","year":"2021","unstructured":"Petrov T, Tognazzi S (2021) Exact and approximate role assignment for multi-layer networks. J Complex Netw 9(5):027. https:\/\/doi.org\/10.1093\/comnet\/cnab027","journal-title":"J Complex Netw"},{"key":"726_CR49","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1140\/epjb\/e2007-00340-y","volume":"60","author":"J Reichardt","year":"2007","unstructured":"Reichardt J, White DR (2007) Role models for complex networks. Eur Phys J B 60:217\u2013224","journal-title":"Eur Phys J B"},{"key":"726_CR50","doi-asserted-by":"crossref","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR (2017) struc2vec: Learning node representations from structural identity. In: Proceedings of the 23rd ACM SIGKDD International conference on knowledge discovery and data mining. pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"key":"726_CR51","doi-asserted-by":"crossref","unstructured":"Rossi RA, Gallagher B, Neville J, Henderson K (2013) Modeling dynamic behavior in large evolving graphs. In: Proceedings of the sixth ACM international conference on web search and data mining. pp 667\u2013676","DOI":"10.1145\/2433396.2433479"},{"issue":"5","key":"726_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397191","volume":"14","author":"RA Rossi","year":"2020","unstructured":"Rossi RA, Jin D, Kim S, Ahmed NK, Koutra D, Lee JB (2020) On proximity and structural role-based embeddings in networks: misconceptions, techniques, and applications. ACM Trans Knowl Discov Data (TKDD) 14(5):1\u201337","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"1","key":"726_CR53","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0378-8733(78)90014-X","volume":"1","author":"LD Sailer","year":"1978","unstructured":"Sailer LD (1978) Structural equivalence: meaning and definition, computation and application. Soc Netw 1(1):73\u201390","journal-title":"Soc Netw"},{"issue":"4","key":"726_CR54","doi-asserted-by":"publisher","first-page":"857","DOI":"10.2307\/2580193","volume":"70","author":"DA Smith","year":"1992","unstructured":"Smith DA, White DR (1992) Structure and dynamics of the global economy: network analysis of international trade 1965\u20131980. Soc Forces 70(4):857\u2013893","journal-title":"Soc Forces"},{"key":"726_CR55","doi-asserted-by":"crossref","unstructured":"Squillace G, Tribastone M, Tschaikowski M, Vandin A  (2024) Efficient Network Embedding by Approximate Equitable Partitions, 2024 IEEE International Conference on Data Mining (ICDM), Abu Dhabi, United Arab Emirates, pp. 440\u2013449.","DOI":"10.1109\/ICDM59182.2024.00051"},{"key":"726_CR56","doi-asserted-by":"crossref","unstructured":"Tu K, Cui P, Wang X, Yu PS, Zhu W (2018) Deep recursive network embedding with regular equivalence. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & data mining. pp 2357\u20132366","DOI":"10.1145\/3219819.3220068"},{"key":"726_CR57","doi-asserted-by":"crossref","unstructured":"Valmari A, Franceschinis G (2010) Simple O(m logn) time markov chain lumping. In: Esparza, J., Majumdar, R. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS, vol. 6015, pp. 38\u201352","DOI":"10.1007\/978-3-642-12002-2_4"},{"issue":"6684","key":"726_CR58","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"2","key":"726_CR59","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0378-8733(83)90025-4","volume":"5","author":"DR White","year":"1983","unstructured":"White DR, Reitz KP (1983) Graph and semigroup homomorphisms on networks of relations. Soc Netw 5(2):193\u2013234","journal-title":"Soc Netw"},{"key":"726_CR60","unstructured":"Zafarani R, Liu H (2009) Social Computing Data Repository at ASU. http:\/\/socialcomputing.asu.edu"},{"issue":"1","key":"726_CR61","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.socnet.2006.04.002","volume":"29","author":"A \u017diberna","year":"2007","unstructured":"\u017diberna A (2007) Generalized blockmodeling of valued networks. Soc Netw 29(1):105\u2013126","journal-title":"Soc Netw"},{"issue":"1","key":"726_CR62","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1080\/00222500701790207","volume":"32","author":"A Ziberna","year":"2008","unstructured":"Ziberna A (2008) Direct and indirect approaches to blockmodeling of valued networks in terms of regular equivalence. J Math Soc 32(1):57\u201384","journal-title":"J Math Soc"},{"issue":"2","key":"726_CR63","first-page":"99","volume":"6","author":"A \u017diberna","year":"2009","unstructured":"\u017diberna A (2009) Evaluation of direct and indirect blockmodeling of regular equivalence in valued networks by simulations. Adv Methodol Stat 6(2):99\u2013134","journal-title":"Adv Methodol Stat"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00726-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00726-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00726-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:47:08Z","timestamp":1757479628000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-025-00726-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"references-count":64,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["726"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00726-7","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"7 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"39"}}