Reputation
1,618
Next privilege 2,000 Rep.
Edit questions and answers
Badges
1 15 31
Newest
 Investor
Impact
~77k people reached

Dec
8
accepted Recommendation of Book about Linear Programming and Linear Algebra?
Dec
8
asked Recommendation of Book about Linear Programming and Linear Algebra?
Nov
27
accepted Expected value of smallest value
Nov
26
asked Expected value of smallest value
Nov
25
accepted If a graph has no cycles of odd length, then it is bipartite: is my proof correct?
Nov
22
accepted Can we say a Markov Chain with only isolated states is time reversible?
Nov
21
comment Can we say a Markov Chain with only isolated states is time reversible?
That depends on the precise definition of Markov chain. As far as I can see, it's still one chain, just one with special transition probability.
Nov
21
revised Can we say a Markov Chain with only isolated states is time reversible?
added 360 characters in body
Nov
21
asked Can we say a Markov Chain with only isolated states is time reversible?
Oct
23
comment A confusing contradiction in Menger's theorem
But then, how can you apply a theorem about number of disjoint path on number of independent path?
Oct
23
accepted A confusing contradiction in Menger's theorem
Oct
23
comment A confusing contradiction in Menger's theorem
You are right : "Two or more paths are independent if none of them contains an inner vertex of another." I should read the introduction part more carefully!
Oct
23
revised A confusing contradiction in Menger's theorem
added 5 characters in body
Oct
23
revised A confusing contradiction in Menger's theorem
added 472 characters in body
Oct
23
asked A confusing contradiction in Menger's theorem
Oct
13
accepted Is there any easier way to get the asymptotic value of this sum?
Oct
13
asked Is there any easier way to get the asymptotic value of this sum?
Oct
12
comment What's the asymptotic lower bound of the sum $\frac 3 2 + \sum_{k=3}^{n} \frac{n!}{k(n-k)!n^k}$?
I did computer simulation and $S(n)$ indeed goes to $1/2 log(n)$. But I am afraid your proof is a difficult for me to understand. Is there any other simpler proofs?
Oct
10
accepted Does this sum go to 0?
Oct
10
accepted Given a random graph $G_{n,p}$, how to get the expectation of number of components with $k$ vertices and $k$ edges?