Variational principle for scale-free network motifs

Clara Stegehuis; Remco van der Hofstad; Johan S.H. van Leeuwaarden

doi:10.1038/s41598-019-43050-8

Variational principle for scale-free network motifs

Clara Stegehuis (Corresponding author)
, Remco van der Hofstad
, Johan S.H. van Leeuwaarden

Stochastic Operations Research

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

13 Citaten (Scopus)

135 Downloads (Pure)

Samenvatting

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 optimizer describes the degrees of the vertices that together span the most likely motif, resulting in explicit asymptotic formulas for the motif count and its fluctuations. We then classify all motifs into two categories: motifs with small and large fluctuations.

Originele taal-2	Engels
Artikelnummer	6762
Aantal pagina's	10
Tijdschrift	Scientific Reports
Volume	9
Nummer van het tijdschrift	1
DOI's	https://doi.org/10.1038/s41598-019-43050-8
Status	Gepubliceerd - 1 mei 2019

Financiering

This work is supported by NWO TOP grant 613.001.451 and by the NWO Gravitation Networks grant 024.002.003. The work of R.v.d.H. is further supported by the NWO VICI grant 639.033.806. The work of J.v.L. is further supported by an NWO TOP-GO grant and by an ERC Starting Grant.

Toegang tot document

10.1038/s41598-019-43050-8

publishers versionDefinitieve gepubliceerde versie, 2,31 MB

Andere bestanden en links

Link to publication in Scopus

Dominant motif structures
Stegehuis, C. (Bijdrager), Zenodo, 21 jan. 2019
DOI: 10.5281/zenodo.2545464
Dataset

Citeer dit

@article{6f8313dbbd034757bcbd899649e47112,

title = "Variational principle for scale-free network motifs",

abstract = "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 optimizer describes the degrees of the vertices that together span the most likely motif, resulting in explicit asymptotic formulas for the motif count and its fluctuations. We then classify all motifs into two categories: motifs with small and large fluctuations.",

author = "Clara Stegehuis and Hofstad, \{Remco van der\} and \{van Leeuwaarden\}, \{Johan S.H.\}",

year = "2019",

month = may,

day = "1",

doi = "10.1038/s41598-019-43050-8",

language = "English",

volume = "9",

journal = "Scientific Reports",

issn = "2045-2322",

publisher = "Nature Publishing Group",

number = "1",

}

TY - JOUR

T1 - Variational principle for scale-free network motifs

AU - Stegehuis, Clara

AU - Hofstad, Remco van der

AU - van Leeuwaarden, Johan S.H.

PY - 2019/5/1

Y1 - 2019/5/1

N2 - 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 optimizer describes the degrees of the vertices that together span the most likely motif, resulting in explicit asymptotic formulas for the motif count and its fluctuations. We then classify all motifs into two categories: motifs with small and large fluctuations.

AB - 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 optimizer describes the degrees of the vertices that together span the most likely motif, resulting in explicit asymptotic formulas for the motif count and its fluctuations. We then classify all motifs into two categories: motifs with small and large fluctuations.

UR - https://www.scopus.com/pages/publications/85065155908

U2 - 10.1038/s41598-019-43050-8

DO - 10.1038/s41598-019-43050-8

M3 - Article

C2 - 31043621

AN - SCOPUS:85065155908

SN - 2045-2322

VL - 9

JO - Scientific Reports

JF - Scientific Reports

IS - 1

M1 - 6762

ER -

Variational principle for scale-free network motifs

Samenvatting

Financiering

Toegang tot document

Andere bestanden en links

Vingerafdruk

Datasets

Dominant motif structures

Citeer dit