Maximal full subspaces in random projective spaces—thresholds and Poisson approximation

DOI10.1002/rsa.3240060216zbMath0821.60018OpenAlexW2111639128MaRDI QIDQ4697819

Wojciech Kordecki

Publication date: 30 May 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060216

zbMATH Keywords

Stein-Chen methodBernoulli random graphPoisson approximation theorems

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Strictly balanced submatroids in random subsets of projective geometries
• Threshold distribution functions for some random representable matroids
• Small cliques in random graphs
• Asymptotic properties of random subsets of projective spaces
• On random subsets of projective spaces
• Small Submatroids in Random Matroids

This page was built for publication: Maximal full subspaces in random projective spaces—thresholds and Poisson approximation