Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let m_1,m_2,m_3∈N, and let (X_1,X_2,X_3) be a centered Gaussian random vector. Three-dimensional Gaussian product inequality conjecture. E[X_1^2m_1X_2^2m_2X_3^2m_3]≥ E[X_1^2m_1]E[X_2^2m_2]E[X_3^2m_3]. The equality sign is asserted to hold…
For systems of infinitely many interacting particles at positive density, what is the precise localization regime and is it stable under interactions?
Let d=4, and let P be any i.i.d. environment law satisfying P(0<ω_b≤ 1)=1. Write cmss P_ω^2n(0,0) for the quenched return probability at time 2n in the environment ω. Four-dimensional subdiffusive heat-kernel decay conjecture. For every…
Under the stated Prekopa--Leindler assumptions on centered probability densities f and g and an admissible function m, does the stability inequality integral m >= 1 + gamma times lambda times delta_1(f,g)^2 hold, where delta_1 is the…
Q: In a von Neumann algebra M with a faithful normal trace-state τ let X = X∗ ∈ M and let 1 ∈ B ⊂ M be an infinite-dimensional von Neumann subalgebra so that B and X are free in the algebraic sense and M = W ∗(X, B ). Assume that ∂X:B is…
What mathematical or market-microstructural mechanisms explain the apparently universal roughness of financial volatility, typically modeled by fractional Brownian motion with a small Hurst parameter?
For multidimensional stochastic differential equations arising in applications whose coefficients do not satisfy global monotonicity assumptions, prove L^{2}-convergence rates for suitable numerical approximations.
Let an aggregation of a Markov chain have approximated transient distribution tildep_k and transient distribution p_k, where k ∈ N, and let n be the number of coordinates. The inequality referred to in the source as $$ compares the…
Q: Extend the model exp( −nT r (P (A1,..., A m) + 1 2 ∑mi=1 A2 i )) dA 1... dA m of Guionnet and Maurel-Segala to non-selfadjoint P (i.e.polynomials with com-plex coefficients).
For two-dimensional critical percolation, do probabilities of j monochromatic arms to distance n obey power laws n^(−alpha'_j+o(1)); if so, how are the monochromatic exponents alpha'_j related to the polychromatic arm exponents?
Assume k=j=2, so the hider caches two nuts and the searcher aims to find both. A hiding strategy is represented by pairs (y_1,y_2) of depths, with the hole placements randomized as described in the source. Pair-distribution conjecture. For…
Let G=(V,E) be a graph, let x=x_e:e otin E be positive edgeweights, and let the random cluster model on G have parameter q. For distinct edges e,f otin E, write J_e and J_f for the events that the corresponding edges are open.…
For a finite graph G, determine the density of its maximum cut, or estimate it to prescribed accuracy from a uniformly random induced subgraph of fixed size.
Let G be a bounded-degree expander and suppose some vertex v satisfies P_1/2 (diam(K_v)>tfrac12diam(G))>tfrac12, where K_v is its percolation cluster. Prove that 1/2-percolation on G contains a giant component with high probability.
Let K(n) be the distribution of the renewal increments, and let β_c be the critical value separating weak disorder from strong disorder. Assume that the environment is unbounded from above. Entropy criterion conjecture. The weak-disorder…
On the three-branch hierarchical graph G_n described in Section 9.3, launch external-DLA particles from the sink until a particle settles at the sink, and let P_n be the number launched. Determine lim_n→∞frac1nlogE[P_n].
Can we find the MST probability maximizer (with iid random weights) in, say, an 8 × 8 grid graph? Can we approximately optimize this numerically?
For the dilute ferromagnet and sparse spin-glass models, is the theoretical-physics conjecture corresponding to the particular GREM-associated trial order parameter correct in the variational formula for the pressure? Further open…
For the hierarchical first-passage distances D_n satisfying D_nstackrel d=D_n-1+min(D'_n-1,D''_n-1), determine concentration around the mean and the lower-order asymptotic terms, analogous to the minimal position in branching random walk.
Construct the locally finite connected rooted random graph G^• from the partially labeled rooted random tree T^• as described in the source: even-generation vertices have offspring distribution Poi(λ), odd-generation vertices carry…