- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9613
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Counting Cliques and Cycles in Scale-Free Inhomogeneous Random Graphs ; day:18 ; month:2 ; year:2019 ; pages:1-24
Journal of statistical physics ; (18.2.2019), 1-24
- Urheber
-
Janssen, A. J. E. M.
Leeuwaarden, Johan S. H. van
Shneer, Seva
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10955-019-02248-w
- URN
-
urn:nbn:de:101:1-2019031723132705567389
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 14.08.2025, 10:55 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Janssen, A. J. E. M.
- Leeuwaarden, Johan S. H. van
- Shneer, Seva
- SpringerLink (Online service)
Ähnliche Objekte (12)
Geometric Inhomogeneous Random Graphs for Algorithm Engineering
Distinguishing Power-Law Uniform Random Graphs from Inhomogeneous Random Graphs Through Small Subgraphs
Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
Scaling of the Clustering Function in Spatial Inhomogeneous Random Graphs
The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
A Note on the Majority Dynamics in Inhomogeneous Random Graphs
Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs
Counting Hamilton Cycles in Dirac Hypergraphs
Inhomogeneous Percolation on Ladder Graphs
Systemic cascades on inhomogeneous random financial networks
Geometric Inhomogeneous Random Graphs for Algorithm Engineering
Distinguishing Power-Law Uniform Random Graphs from Inhomogeneous Random Graphs Through Small Subgraphs
Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
Scaling of the Clustering Function in Spatial Inhomogeneous Random Graphs
The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
A Note on the Majority Dynamics in Inhomogeneous Random Graphs
Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs
Counting Hamilton Cycles in Dirac Hypergraphs
Inhomogeneous Percolation on Ladder Graphs
Systemic cascades on inhomogeneous random financial networks
Geometric Inhomogeneous Random Graphs for Algorithm Engineering
Distinguishing Power-Law Uniform Random Graphs from Inhomogeneous Random Graphs Through Small Subgraphs
Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
Scaling of the Clustering Function in Spatial Inhomogeneous Random Graphs
The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
A Note on the Majority Dynamics in Inhomogeneous Random Graphs
Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs
Counting Hamilton Cycles in Dirac Hypergraphs
Inhomogeneous Percolation on Ladder Graphs