Comparison of Linear Modularization Criteria Using the Relational Formalism, an Approach to Easily Identify Resolution Limit

DOI10.1007/978-3-319-45763-5_6zbMath1477.68282OpenAlexW2395055622MaRDI QIDQ5016649

Jean-François Marcotorchino, Emmanuel Viennet, Patricia Conde-Céspedes

Publication date: 14 December 2021

Published in: Advances in Knowledge Discovery and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45763-5_6

zbMATH Keywords

random graphdegree distributionresolution limitreal networknull model

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Computational aspects of data analysis and big data (68T09)

Cites Work

• A Mathematical Theory of Communication
• Emergence of Scaling in Random Networks
• Fast unfolding of communities in large networks
• Approximating Symmetric Relations by Equivalence Relations
• Optimal Transport and Minimal Trade Problem, Impacts on Relational Metrics and Applications to Large Graphs and Networks Modularity
• Comparing Different Modularization Criteria Using Relational Metric
• Unnamed Item
• Unnamed Item