Thoth
Reputation
2,180
Next privilege 2,500 Rep.
Create tag synonyms
 May 26 revised Rigorous proof that $\int_{\Omega}X\;dP=\int_{-\infty}^{\infty}xf(x)\;dx$ added 14 characters in body May 26 asked Rigorous proof that $\int_{\Omega}X\;dP=\int_{-\infty}^{\infty}xf(x)\;dx$ May 25 accepted An alternate proof of Egorov's Theorem May 25 comment An alternate proof of Egorov's Theorem you're right Norbert it isn't. May 25 comment An alternate proof of Egorov's Theorem Ah yes I see what you mean. Yah I think you're right. So the lesson learned is that I don't want the size of my set to depend on epsilon. May 25 revised An alternate proof of Egorov's Theorem added 38 characters in body May 25 revised An alternate proof of Egorov's Theorem added 21 characters in body May 25 asked An alternate proof of Egorov's Theorem May 24 comment Help me solve the invariant measure of $Q$ @Did I only asked one other question related to this question, and that was about finding a way to solve the recurrence relation I derived from this $Q$ matrix, but the specific indications were useless and were essentially the method I had already considered (and explicitly mentioned). Look back at the question if you don't believe me. May 24 comment Understanding this Poisson Queueing Process How can $0\rightarrow 1$ depend on the repair rate? At $0$ there are no busses in service. May 24 revised Help me solve the invariant measure of $Q$ added 18 characters in body May 24 revised Help me solve the invariant measure of $Q$ added 18 characters in body May 24 asked Help me solve the invariant measure of $Q$ May 24 comment Help me solve this recurrence relation I don't think generating functions are going to work as for finite recurrences they just reduce to the polynomial trick. May 24 comment Understanding this Poisson Queueing Process I get what you're saying but I think this is backwards right? $n\rightarrow n-1$ means there is one less bus in service and thus that repair takes $\lambda$ amount of time. While $n\rightarrow n+1$ means there is one more bus in service which happens at a rate proportional to how many buses are currently not broken down, and should be given by $(N-n)\mu$, correct? May 24 comment Help me solve this recurrence relation It's for a class on stochastic processes, this is just one step in a larger problem, so who knows what's required to solve it. May 24 comment Help me solve this recurrence relation I haven't and unfortunately I'm a novice at combinatorics, is there a good site to learn this real quick? May 24 asked Help me solve this recurrence relation May 23 comment Why are call options necessary? Interesting I'll have to think on that some, thanks. May 23 comment Why are call options necessary? @Macavity, is it always theoretically possible though?