The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees
From MaRDI portal
Publication:3415946
DOI10.1017/S0269964800001339zbMath1134.60320OpenAlexW2042318351MaRDI QIDQ3415946
Ashok T. Amin, Peter J. Slater, Kyle T. Siegrist
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964800001339
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Central limit theorems for percolation models
- Dependent central limit theorems and invariance principles
- Multi-Component Systems and Structures and Their Reliability
- Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
- Coherent Structures of Non-Identical Components
- Reliable circuits using less reliable relays
- Martingale Inequalities and NP-Complete Problems
This page was built for publication: The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees