Binomial distribution with dependent trials?

Click For Summary
SUMMARY

The discussion centers on calculating the mean and variance of error-free sliding windows in a string of length n, given a probability p of error for each character. Specifically, for n = 5 and k = 2, the sliding windows are defined as positions 12, 23, 34, and 45. The main challenge is determining the number of windows without errors, which involves defining a discrete random variable. The number of sliding windows is established as n-k+1, which is 4 in this case.

PREREQUISITES
  • Understanding of discrete random variables
  • Familiarity with probability theory
  • Knowledge of generating functions
  • Basic concepts of statistical mean and variance
NEXT STEPS
  • Research the properties of discrete random variables in probability theory
  • Learn about generating functions and their applications in combinatorics
  • Study the calculation of mean and variance for binomial distributions
  • Explore the concept of sliding windows in data analysis and its statistical implications
USEFUL FOR

Mathematicians, statisticians, data analysts, and computer scientists interested in probability theory and statistical analysis of error rates in data sequences.

Reynolds
Messages
1
Reaction score
0
Hi to you all!
I need your help with following problem:

String with n characters is given. For each character in string there is probability p that it is wrong. Now you take a sliding window of length k, k<= n, that slides over that string. For the given parameters p,k and n one must must determine the mean and variance of the number of the moving windows without any error.

For n = 5 and k = 2 we have sliding windows that contain letters of sting on positions 12, 23, 34 and 45.

I was thinking that I may define discrete random variable that counts how many windows are there without any error, but very soon it becomes quite difficult to count. I was also trying to define some sort of generating function, but i did not get far. Thank you in advance!
 
Physics news on Phys.org
Your question is confusing. The number of windows is n-k+1. What are you trying to do?
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
6K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
9K
  • · Replies 4 ·
Replies
4
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
7K