Probability of Bob Being Infected with Spread of Disease

  • Thread starter Thread starter mac11
  • Start date Start date
  • Tags Tags
    Disease
AI Thread Summary
The discussion focuses on modeling the probability of Bob becoming infected in a population where one individual starts as infected and interactions occur in rounds. Each round, individuals pair off randomly, and if an infected person interacts with an uninfected person, the latter has a probability, p, of becoming infected. The probability of Bob being infected after n rounds is influenced by the random nature of interactions and the exponential spread of the disease, which is theoretically limited by the presence of multiple infected individuals. The conversation highlights the need for clarity in defining parameters, such as whether interactions are consistent or random. Ultimately, the disease's spread is expected to be exponential initially, but this rate may slow down as more individuals become infected.
mac11
Messages
2
Reaction score
0
Assume there is a population of a given (even) size. One person is ‘infected’ in the beginning. During every ‘round’, everybody in the population pairs off and ‘interacts’ with her partner. If an infected person interacts with an uninfected person, the uninfected person is then infected. If two infected people interact, there is no change. Let’s say my favorite guy in this population is Bob. After n rounds, what is the probability Bob is infected?
Further, if an infected person interacts with an uninfected person, assume there is a known probability, p, that the uninfected person will get infected. What is the new probability Bob will be infected?
You can probably guess what this problem is attempting to model. I’m guessing the answer is recursive, so do your best.
 
Mathematics news on Phys.org
Do they always interact with the same partner? If so, the odds of Bob being infected are quite low, because he's either going to get infected in the first round, or never
 
mac11 said:
Assume there is a population of a given (even) size. One person is ‘infected’ in the beginning. During every ‘round’, everybody in the population pairs off and ‘interacts’ with her partner. If an infected person interacts with an uninfected person, the uninfected person is then infected. If two infected people interact, there is no change. Let’s say my favorite guy in this population is Bob. After n rounds, what is the probability Bob is infected?
Further, if an infected person interacts with an uninfected person, assume there is a known probability, p, that the uninfected person will get infected. What is the new probability Bob will be infected?
You can probably guess what this problem is attempting to model. I’m guessing the answer is recursive, so do your best.

The problem is not defined. At least, you need to add the topology.
 
Office_Shredder said:
Do they always interact with the same partner? If so, the odds of Bob being infected are quite low, because he's either going to get infected in the first round, or never

No, the partner is chosen randomely each round.

I think I explained the problem pretty well, not sure what you mean by 'adding a topology'.

But again, this happens in discrete 'rounds'. Obviously, the population will (theoretically) propogate at a rate of 2^n (doubling every round), but this is unlikely to happen because two infected people will meet and 'slow down' this rate. If the population is extremely large, however, you can expect the disease to spread exponentially at least initially.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top