Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Stochastic analysis Consider the multi-layer extension of the stochastic heat equation introduced by O'Connell and Warren. It is defined via chaos series -- show that it can also be defined by spatially smoothing white-noise and then…
In the same paper [11], Lovett proposed to study the size of all-zero rectangles in low-rank sparse real matrices, stating the following conjecture. Conjecture 5 ([11]). Let M be an n \times n real matrix with rank(M ) = r such that at…
Two approaches to generalize Stein's method to non-Gaussian distributions are the following: \begin{itemize} \item[(i)] Stein coefficients: for a random variable Y, the \emph{Stein coefficient} T(Y) satisfies [\mathbb{E}(Y f(Y)) =…
Let d≥ 1, let E_d be the set of unoriented nearest-neighbor edges of Z^d, and let ω=(ω_e)_e∈ E_d∈(0,∞)^E_d be a translation-invariant ergodic random environment. Assume E[ω_e]<∞ and E[ω_e^-1]<∞ for a representative edge e. For the…
A natural question is if the obtained surfaces make sense when taking L to infinity. Figure 2. Random surfaces generated by the transformation (2) with different truncation levels L. (a) \alpha = 1/2 (b) \alpha = 1 (c) \alpha = 3/2 (d)…
Let h_Bin,K,d(x)=x^d+a_d-1x^d-1+…+a_1x+a_0 be a random monic polynomial whose coefficients a_0,…,a_d-1 are independently chosen from [0,K] according to the Bin(K,1/K) distribution. Binomial reducibility conjecture. The probability that…
Kac's random walk Consider the Kac's random walk on the n-sphere defined as follows: for a vector v∈ S^n, pick two coordinates uniformly at random, and an angle uniformly at random on [0,2π). Then rotate in the circle generated by the two…
For the Abelian sandpile model, determine the tail of \nu[|\operatorname{Av}|>t] on \mathbb Z^d for d\ge2; determine whether the centered height-zero field h_\varepsilon converges to the generalized field :|\nabla h|^2: in a suitable…
Prove that every graph G with isoperimetric dimension greater than 1 has self-avoiding-walk connective constant μ(G)>1.
Let X be a strongly Rayleigh process on [n], with kernel g_X, and let λ_1,…,λ_n be the roots of overlineg_X. Write λ=(λ_1,…,λ_n), and for A⊆[n] set λ^A=∏_i∈ Aλ_i and (1-λ)^A^c=∏_i∈ A^c(1-λ_i). Majorization conjecture for strongly Rayleigh…
Does this remain true for a random quotient of a free product of at least 3 factors in the free product density model at density d > 1/3? The report passage is retained verbatim as the relevant context for this extracted problem.
What tropical objects (varieties) characterize all tropical RBMs?
For a uniform Eulerian circuit on the bidirected Hamming cube 0,1^d, determine the asymptotic behavior or distribution of the shortest excursion length L_d^(d).
Compute multi-time distribution for KPZ. What is the distribution F'_t_1, t_2(ξ_1, ξ_2) such that P(A_t_1(x)≤ξ_1, A_t_2(x)≤ξ_2)=F'_t_1, t_2(ξ_1,ξ_2)?
We will formulate a specific open question. Corollary 3. If X is connected, the almost sure spectrum Σ1 is given by a finite union of non-degenerate compact intervals. Question 4. Let H be the Fibonacci Hamiltonian (the discrete…
Let a_1,a_2,b_1,b_2,c_1,c_2 be the six-vertex weights, let Δ be the associated interaction parameter, and consider the six-vertex model with domain wall boundary conditions. The preceding theorems concern limiting fluctuation results for…
For the null-recurrent renewal process of Problem 1.1, is there a non-decreasing function φ such that D_t/φ(t) converges in distribution to a non-degenerate random variable D_φ as t→∞? In particular, does this hold for φ(t)=E[minX_1,t]?
Let T^2=R^2/Z^2 be the flat unit torus, let X_1,…,X_n and Y_1,…,Y_n be independent samples of n independent points uniformly distributed on T^2, and let d_T^2 denote the torus distance. For every finite q≥ 1, determine the exact leading…
Random walks on Dyck's paths Consider the Markov chain on the set of Dyck's paths, which moves by choosing uniformly at random two coordinates and exchanging their value (+ or -1) provided the resulting path remains a Dyck's path. What is…
Star graphs are not splittable, paths are. What other structures of trees make it splittable or not splittable? What determines whether a graph is splittable or not splittable? Is there a metric on a tree or a graph that quantifies this?