Cargando…
Variational principle for scale-free network motifs
For scale-free networks with degrees following a power law with an exponent τ ∈ (2, 3), the structures of motifs (small subgraphs) are not yet well understood. We introduce a method designed to identify the dominant structure of any given motif as the solution of an optimization problem. The unique...
Autores principales: | Stegehuis, Clara, Hofstad, Remco van der, van Leeuwaarden, Johan S. H. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6494877/ https://www.ncbi.nlm.nih.gov/pubmed/31043621 http://dx.doi.org/10.1038/s41598-019-43050-8 |
Ejemplares similares
-
Epidemic spreading on complex networks with community structures
por: Stegehuis, Clara, et al.
Publicado: (2016) -
Triadic Closure in Configuration Models with Unbounded Degree Fluctuations
por: van der Hofstad, Remco, et al.
Publicado: (2018) -
Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
por: van der Hofstad, Remco, et al.
Publicado: (2018) -
Diameter in ultra‐small scale‐free random graphs
por: Caravenna, Francesco, et al.
Publicado: (2018) -
Transient analysis of the Erlang A model
por: Knessl, Charles, et al.
Publicado: (2015)