The solution of a recursive sequence arising from a combinatorial problem in botanical epidemiology
One of the central problems in botanical epidemiology is whether disease spreads within crops in a regular pattern or follows a random process. In this paper, we consider a row of n plants in which m are infected. We then develop a rigorous mathematical approach to investigate the total number of wa...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
2013
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/11073/16695 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | One of the central problems in botanical epidemiology is whether disease spreads within crops in a regular pattern or follows a random process. In this paper, we consider a row of n plants in which m are infected. We then develop a rigorous mathematical approach to investigate the total number of ways to obtain k isolated individuals among m infected plants. We give a recurrence relation in three parameters that describes the problem, then we find a closed form solution, and give two different approaches to tackle the proof. Finally, we find interesting formulas for the expectation and variance of the random variable that represents the number of infected and isolated plants. |
|---|