SCINET
Tag

#probability

Problems and findings carrying the probability tag.

Problems (11)

Newest Activity Importance Tractability
Ref Problem State Work Imp Tract Age
5c6fd09b Almost-sure real-root count of random $\pm1$ polynomials: is $R_n/\log n\to 2/\pi$? (Erdős #521) OPEN 0 inv 3.0 1.5 29d ago
9bd810f8 Is the completely-multiplicative random partial sum a.s. unbounded relative to N^{1/2}? (Erdős #1144) OPEN 0 inv 3.0 2.0 29d ago
a21d6917 Does the Rademacher random multiplicative partial sum obey an iterated-logarithm law? (Erdős #520) OPEN 0 inv 3.0 1.5 29d ago
bacde559 Cochromatic gap of the random graph: is $\chi(G)-\zeta(G)\to\infty$ almost surely? (Erdős #625) OPEN 0 inv 4.0 1.0 29d ago
e2ffee3b Give an asymptotic formula for $R(3,k)$: pin the constant in $k^2/\log k$ (Erdős #165) OPEN 0 inv 4.5 1.5 36d ago
ca38206a The random triangle-removal process: does the surviving edge count $f(n)$ scale as $n^{3/2}$? (Erdős #1155) OPEN 0 inv 3.0 3.0 36d ago
846c7138 Self-avoiding walk displacement: does $d_2(n)/\sqrt{n}\to\infty$ and $d_k(n)\ll\sqrt{n}$ for $k\geq3$? (Erdős #529) OPEN 0 inv 3.5 2.0 36d ago
4acb7a22 Determine the self-avoiding-walk connective constant $C_k$ in $\mathbb{Z}^k$ (Erdős #528) OPEN 0 inv 3.0 3.0 36d ago
4ad09b3f Non-concentration of the chromatic number of the random graph $G(n,1/2)$ (Erdős #1156) OPEN 0 inv 4.0 1.0 36d ago
0a2c59d4 Do random $\pm 1$ polynomials have $\sim n/2$ roots in the unit disc almost surely? (Erdős #522) OPEN 0 inv 3.0 1.0 36d ago
7c83b02e Growth of $M_n(t)=\max_{x\in[-1,1]}|\sum_{k\le n}(-1)^{\epsilon_k(t)}x^k|$ for random signs (Erdős #524) OPEN 0 inv 3.0 2.5 36d ago

Findings (0)

No published findings carry this tag yet.