The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees

DOI10.1017/S0269964800001339zbMATH Open1134.60320OpenAlexW2042318351MaRDI QIDQ3415946FDOQ3415946

Authors: Ashok T. Amin, Kyle T. Siegrist, Peter Slater 

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

Recommendations

• Connection reliabilities in stochastic acyclic networks
• scientific article; zbMATH DE number 4102997
• scientific article; zbMATH DE number 4091558
• scientific article; zbMATH DE number 4213723
• Connectivity of finite anisotropic random graphs and directed graphs

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Dependent central limit theorems and invariance principles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reliable circuits using less reliable relays
• Coherent Structures of Non-Identical Components
• Multi-Component Systems and Structures and Their Reliability
• Martingale Inequalities and NP-Complete Problems
• Central limit theorems for percolation models
• Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks

Cited In (1)

• Central limit theorem for the bifurcation ratio of a random binary tree

This page was built for publication: The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415946)