Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
9
Newest
 Excavator
Impact
~441 people reached

Mar
14
comment Expected value of Stock Price, Poisson Process
Why do you have that $E[S_{t}^{2}] = E[S_{0}^{2}(\sigma^{2} + \mu^{2})^{N(t)}$ and not $E[S_{t}^{2}] = E[(S_{0}\mu^{N(t)})^{2}] = E[(S_{0}^{2}\mu^{2N(t)})]$?
Mar
14
awarded  Excavator
Mar
14
revised Expected value of Stock Price, Poisson Process
Fixed latex error
Mar
14
suggested approved edit on Expected value of Stock Price, Poisson Process
Feb
8
comment Proof of the existence of a reversible stationary distribution
@Did What exactly are you trying to say with the above equality?
Jan
29
accepted Prove the following simple exponentiation equality.
Jan
29
comment Prove the following simple exponentiation equality.
^ Makes sense. Thanks Chaz
Jan
29
comment Prove the following simple exponentiation equality.
You mean the taylor series representation for the log?
Jan
29
asked Prove the following simple exponentiation equality.
Oct
24
accepted Jordan normal form and invertible matrix of generalized eigenvectors proof
Oct
24
comment Jordan normal form and invertible matrix of generalized eigenvectors proof
Thanks for covering both cases. Just as a note, the Jordan normal form I meant in the problem was case 2, sorry I didn't specify. Either way, again, thank you!
Oct
24
asked Jordan normal form and invertible matrix of generalized eigenvectors proof
Nov
3
awarded  Critic
Nov
3
awarded  Citizen Patrol
Sep
27
comment Taking the log of both sides to determine big Theta/Omega/O
Oh okay, so when showing that $2^{n^2} \notin O(2^n)$ through contradiction, we can't do something like: $2^{n^2} \leq c \times 2^n$ and take the log of both sides to get $n^2 \leq \log(c) + n$ and so forth...
Sep
27
accepted Taking the log of both sides to determine big Theta/Omega/O
Sep
27
comment Taking the log of both sides to determine big Theta/Omega/O
So $\log(f(n)) \leq c\log(g(n)) \rightarrow f(n) \in O(g(n)^c)$?
Sep
27
comment Taking the log of both sides to determine big Theta/Omega/O
How can $\log(f(n)) \in O(\log(g(n)) \rightarrow f(n) \in O(g(cn))$? It's false that $\log(n^2) \in O(\log(n)) \rightarrow n^2 \in O(cn)$ Thanks for helping
Sep
27
revised Taking the log of both sides to determine big Theta/Omega/O
added 5 characters in body
Sep
27
asked Taking the log of both sides to determine big Theta/Omega/O