• Corpus ID: 230437656

Modularity maximisation for graphons

  title={Modularity maximisation for graphons},
  author={Florian Klimm and Nick S. Jones and Michael T. Schaub},
. Networks are a widely-used tool to investigate the large-scale connectivity structure in complex systems and graphons have been proposed as an infinite size limit of dense networks. The detection of communities or other meso-scale structures is a prominent topic in network science as it allows the identification of functional building blocks in complex systems. When such building blocks may be present in graphons is an open question. In this paper, we define a graphon-modularity and demonstrate… 

Figures and Tables from this paper


Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Resolution limit in community detection
It is found that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined.
The many facets of community detection in complex networks
A focused review of the different motivations that underpin community detection and highlights the different facets of community detection, which delineates the many lines of research and points out open directions and avenues for future research.
Null models for community detection in spatially embedded, temporal networks
The effects of using null models that take incorporate spatial information are investigated, a novel null model based on the radiation model of population spread is proposed, and a novel spatial benchmark networks are developed in which the connections between entities are based on distance or flux between nodes.
Modularity and community structure in networks.
  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.
Community detection in graphs
Centrality Measures for Graphons: Accounting for Uncertainty in Networks
A statistical approach based on graphon theory is suggested: formal definitions of centrality measures for graphons are introduced and their connections to classical graph centralities measures are established, demonstrating that graphon centrality functions arise naturally as limits of their counterparts defined on sequences of graphs of increasing size.
Sparse graphs using exchangeable random measures
  • F. Caron, E. Fox
  • Computer Science
    Journal of the Royal Statistical Society. Series B, Statistical methodology
  • 2017
A scalable Hamiltonian Monte Carlo algorithm for posterior inference is presented, which is used to analyse network properties in a range of real data sets, including networks with hundreds of thousands of nodes and millions of edges.
Relating modularity maximization and stochastic block models in multilayer networks
It is shown that maximizing modularity is equivalent, under certain conditions, to maximizing the posterior probability of community assignments under a suitably chosen stochastic block model, and versions of this equivalence are derived for various types of multilayer structure, including temporal, multiplex, and multilevel networks.
Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks
This paper investigates the detection of communities in temporal networks represented as multilayer networks with time-dependent financial-asset correlation networks and introduces a diagnostic to measure the persistence of community structure in a multilayers network partition.