- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
Scaling of the Clustering Function in Spatial Inhomogeneous Random Graphs ; volume:190 ; number:6 ; day:7 ; month:6 ; year:2023 ; pages:1-43 ; date:6.2023
Journal of statistical physics ; 190, Heft 6 (7.6.2023), 1-43, 6.2023
- Creator
-
Hofstad, Remco van der
Hoorn, Pim van der
Maitra, Neeladri
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10955-023-03122-6
- URN
-
urn:nbn:de:101:1-2023092909493516079966
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:49 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hofstad, Remco van der
- Hoorn, Pim van der
- Maitra, Neeladri
- SpringerLink (Online service)
Other Objects (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 limits of random trees and graphs
Counting Cliques and Cycles in Scale-Free 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
Relations between scaling exponents in unimodular random graphs
Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
Scaling limits of random trees and graphs - Lecture 2
Scaling limits of random trees and graphs - Lecture 1
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
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 limits of random trees and graphs
Counting Cliques and Cycles in Scale-Free 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
Relations between scaling exponents in unimodular random graphs
Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
Scaling limits of random trees and graphs - Lecture 2
Scaling limits of random trees and graphs - Lecture 1
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
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 limits of random trees and graphs
Counting Cliques and Cycles in Scale-Free 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
Relations between scaling exponents in unimodular random graphs
Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
Scaling limits of random trees and graphs - Lecture 2
Scaling limits of random trees and graphs - Lecture 1