A functional limit theorem for random graphs with applications to subgraph count statistics

Svante Janson

Type: Article

Publication Date: 1990-03-01

Citations: 43

DOI: https://doi.org/10.1002/rsa.3240010103

View Publication

Locations

Random Structures and Algorithms - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	An example of graph limits of growing sequences of random graphs	2013	Svante Janson Simone Severini
+ PDF Chat	The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph	1995	Svante Janson
+	Random Graphs	2017	Pierre Brémaud
+ PDF Chat	Kinetic Theory of Random Graphs	2005	E. Ben‐Naim
+ PDF Chat	A random graph growth model	2023	Michael Färber Alexander Gnedin Wajid Mannan
+ PDF Chat	A random tree model associated with random graphs	1990	David Aldous
+	The number of descendants in a random directed acyclic graph	2023	Svante Janson
+	A Random Graph Growth Model	2023	Michael Färber Alexander Gnedin Wajid Mannan
+	More on quasi-random graphs, subgraph counts and graph limits	2014	Svante Janson Vera T. Sós
+	More on quasi-random graphs, subgraph counts and graph limits	2014	Svante Janson Vera T. Sós
+	More on quasi-random graphs, subgraph counts and graph limits	2015	Svante Janson Vera T. Sós
+ PDF Chat	Scale-Free Property for Degrees and Weights in an N-Interactions Random Graph Model*	2016	István Fazekas Bettina Porvázsnyik
+	Large induced subgraphs of random graphs with given degree sequences	2024	Angus Southwell Nick Wormald
+	Functional Central Limit Theorem for Subgraph Counting Processes	2015	Takashi Owada
+ PDF Chat	Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs	2024	Shankar Bhamidi Amarjit Budhiraja Akshay Sakanaveeti
+	Functional central limit theorem for subgraph counting processes	2017	Takashi Owada
+ PDF Chat	The number of descendants in a random directed acyclic graph	2023	Svante Janson
+	Are Randomly Grown Graphs Really Random	2001	Duncan S. Callaway John E. Hopcroft Jon Kleinberg M. E. J. Newman Steven H. Strogatz
+	The Evolution of Random Graphs—the Giant Component	2001	Béla Bollobás
+	A kinetic approach to the random f-graph process. Paths, cycles and components	1996	Krystyna T. Balińska Henryk Galina Louis V. Quintas Jerzy Szymański

Works That Cite This (41)

Action	Title	Year	Authors
+	Multicyclic components in a random graph process	1993	Svante Janson
+	Proportional graphs	1991	Svante Janson Jan Kratochvı́l
+	A graph Fourier transform and proportional graphs	1995	Svante Janson
+	Moderate deviations of subgraph counts in the Erd\H{o}s-R\'enyi random graphs $G(n,m)$ and $G(n,p)$	2019	Christina Goldschmidt Simon Griffiths Alex Scott
+ PDF Chat	How unproportional must a graph be?	2018	Humberto Naves Oleg Pikhurko Alex Scott
+	Central limit theorem for statistics of subcritical configuration models	2018	Siva Athreya D. Yogeshwaran
+	How unproportional must a graph be	2014	Humberto Naves Oleg Pikhurko Alex Scott
+	Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝)	2020	Christina Goldschmidt Simon Griffiths Alex Scott
+	Weighted dependency graphs	2018	Valentin Féray
+ PDF Chat	On the variable bandwidth kernel estimation of conditional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e3468" altimg="si14.svg"><mml:mi>U</mml:mi></mml:math>-statistics at optimal rates in sup-norm	2023	Salim Bouzebda Nourelhouda Taachouche

Works Cited by This (5)

Action	Title	Year	Authors
+ PDF Chat	The asymptotic distributions of generalized U-statistics with applications to random graphs	1991	Svante Janson Krzysztof Nowicki
+	A central limit theorem for decomposable random variables with applications to random graphs	1989	A. D. Barbour Michał Karoński Andrzej Ruciński
+ PDF Chat	When are small subgraphs of a random graph normally distributed?	1988	Andrzej Ruciński
+ PDF Chat	Convergence of Probability Measures	1999	Patrick Billingsley
+	Convergence of Probability Measures	1969	J. F. C. Kingmán P. Billingsley