My intuition tells me that it's effectiveness would fall off as the complexity of the in/out relationship scales. Is this true? Or can sufficient sample density overcome arbitrary levels of that type of complexity?
My intuition tells me that it's effectiveness would fall off as the complexity of the in/out relationship scales. Is this true? Or can sufficient sample density overcome arbitrary levels of that type of complexity?
Yes, this is exactly why I like it. At AWS, we've used Monte Carlo simulations quite extensively to model the behavior of complex distributed systems and distributed databases. These are typically systems with complex interactions between many components, each linked by a network with complex behavior of its own. Latency and response time distributions are typically multi-modal, and hard to deal with analytically.
One direction I'm particularly excited by in this niche is converging simulation tools and model checking tools. For example, we could have a tool like P use the same specification for exhaustive model checking, fuzzing invariants, and doing MC (and MCMC) to produce statistical models of things like latency and availability.