Poisson convergence and random graphs

From MaRDI portal
Revision as of 00:09, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3963761

DOI10.1017/S0305004100059995zbMath0498.60016OpenAlexW2100038936WikidataQ104764264 ScholiaQ104764264MaRDI QIDQ3963761

Andrew David Barbour

Publication date: 1982

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100059995




Related Items (30)

On tree census and the giant component in sparse random graphsWhen are small subgraphs of a random graph normally distributed?Poisson convergence and Poisson processes with applications to random graphsOn the number of induced subgraphs of a random graphPOISSON APPROXIMATION FOR THE COUPON COLLECTOR’S PROBLEMTHE ESTIMATION OF ERROR ON POISSON APPROXIMATION FOR THE MÉNAGE PROBLEMThe random-cluster model on the complete graphAsymptotic Normality of the Vertex Degree in Random Subgraphs of the n‐CubeMaximal induces trees in sparse random graphsApproximating dependent rare eventsStein's method for conditional central limit theoremAsymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graphOn the probability of the occurrence of a copy of a fixed graph in a random distance graphFundamentals of Stein's methodConcentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplingsUnnamed ItemAsymptotic normality in random graphs with given vertex degreesRandom subgraphs of the \(n\)-cycle and the \(n\)-wheelCompound Poisson approximations of subgraph counts in random graphsAn Improvement of Poisson Approximation for Sums of Dependent Bernoulli Random VariablesCLT-related large deviation bounds based on Stein's methodNew non-uniform bounds on Poisson approximation for dependent Bernoulli trialsApproximation of the difference of two Poisson-like counts by SkellamThe lower tail: Poisson approximation revisitedAnti-concentration for subgraph counts in random graphsFixed point characterizations of continuous univariate probability distributions and their applicationsCompound Poisson approximation of subgraph counts in stochastic block models with multiple edgesA central limit theorem for decomposable random variables with applications to random graphsA Random Graph With a Subcritical Number of EdgesTree and forest weights and their application to nonuniform random graphs




Cites Work




This page was built for publication: Poisson convergence and random graphs