On the number of isolated vertices in a growing random graph

DOI10.1216/RMJ-2013-43-6-1941zbMath1288.60010MaRDI QIDQ2439538

Anatolii A. Puhalskii

Publication date: 14 March 2014

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.rmjm/1393336664

zbMATH Keywords

weak convergencestochastic processesrandom graphslarge deviationsisolated vertices

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Large deviations (60F10) Stochastic processes (60G99) Functional limit theorems; invariance principles (60F17)

Related Items (1)

Rare event asymptotics for exploration processes for random graphs

Cites Work

• A central limit theorem for decomposable random variables with applications to random graphs
• An inductive derivation of Stirling numbers of the second kind and their applications in statistics
• Some large deviation results for sparse random graphs
• On tree census and the giant component in sparse random graphs
• Le Cam's Inequality and Poisson Approximations
• Orthogonal decompositions and functional limit theorems for random graph statistics
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• Random Graphs
• Direct methods in the calculus of variations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of isolated vertices in a growing random graph