Generation of arbitrary two-point correlated directed networks with given modularity
From MaRDI portal
Publication:420319
Recommendations
- Generating directed networks with predetermined assortativity measures
- A simple and efficient algorithm for modeling modular complex networks
- Convergence of rank based degree-degree correlations in random directed networks
- Tailored graph ensembles as proxies or null models for real networks II: Results on directed graphs
- Community structure detection for directed networks through modularity optimisation
Cites work
- A critical point for random graphs with a given degree sequence
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Community structure in social and biological networks
- Complex networks and decentralized search algorithms
- Dynamics of directed graphs: The world-wide Web
- Ecological networks. Linking structure to dynamics in food webs. Papers based on the presentation at the workshop `From structure to dynamics in complex ecological networks', Santa Fe, NM, USA, February 2004.
- Statistical mechanics of complex networks
- The asymptotic number of labeled graphs with given degree sequences
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The Structure and Function of Complex Networks
Cited in
(5)- Algorithm for multiplex network generation with shared links
- A modified algorithm of multiplex networks generation based on overlapped links
- Global epidemic invasion thresholds in directed cattle subpopulation networks having source, sink, and transit nodes
- Universal construction mechanism for networks from one-dimensional symbol sequences
- Generating directed networks with predetermined assortativity measures
This page was built for publication: Generation of arbitrary two-point correlated directed networks with given modularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420319)