Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
A natural question is whether these pseudometrics are true metrics on some subclass of isomorphism classes of mm-spaces. We now describe a few of these results, coming from [6], and pose some related open questions. Can the curvature…
For a quasi-transitive graph G, characterize when Bernoulli percolation has a unique infinite cluster at p=p_u(G). In particular, give necessary and sufficient structural conditions for uniqueness at the threshold.
Consider intermediate scaling for polymer with β=n^-1/4c(n) where c(n) is any function which tends to infinity with n. Show universality of the F_GUE fluctuations with a fluctuation exponent which may depend on c(n).
Let P_d be the probability that a random 0/1-matrix of size (d+1)×(d+1) is singular; equivalently, in the associated ±1 model, let P_d denote the probability that a random ±1-matrix of size (d+1)×(d+1) is singular. Singularity-probability…
Let λ>0, and consider the λ^*-biased edge-reinforced random walk on Z, in which the transition probability at a node is weighted by the current edge weights with bias parameter λ. A walk on Z is transient if each node is visited only…
Let Q^β be the probability measure of the one-dimensional Edwards model on polymers of infinite length, and let X=(X_t)_t≥ 0 be its canonical process. The parameters a and σ below are universal positive constants. Infinite Edwards-model…
Construct a scale-invariant random spatial network whose law is mathematically natural, for example with an explicit formula for the distribution of span(z_1,…,z_k).
Let G be a graded graph with root ρ, levels V_0,…,V_N, and IID vertex labels with common distribution μ. For an event B of label sequences, let P(G;B) be the probability that some graded path in G has its label sequence in B. Let M be the…
Let S be the simplex on which a discrete quadratic stochastic operator (DQSO) V acts, and write its coefficients as P_ij,k. Suppose that there is a sequence j_n_n≥1⊂ N satisfying P_j_nj_m,k=0, ∀ k∉n,m. Necessity conjecture. If V is…
Construct a scale-invariant random spatial network that is visually realistic, in the sense of not looking very different from a real-world road network.
For d\ge2, does there exist a real morphism \phi:\mathbb{P}^1\to\mathbb{P}^1 of degree d with only real periodic points, and does the set of such real morphisms have full dimension, equivalently nonempty interior, in the space of all real…
Given a target measure, are there simple/computationally feasible tools to study the topology and metric properties of the space of graph partitions?
Let a_r,ℓ be the coefficients in the dyadic expansions of -3^-ℓ, let [x_1,…,x_k] be a Syracuse path with geometric measure G_1-μ^-1, and write x_[ℓ,k]=∑_i=ℓ^k x_i. Dyadic-coefficient zero-one sparsity conjecture. For μ>1, a suitable…
Let (X_n)_n∈Z be a centered strictly stationary sequence with E[X_0^2]<∞. For k≥1, define φ_X(k)=sup_msup|P(B| A)-P(B)|: A∈σ(X_j:j≤ m), P(A)>0, B∈σ(X_j:j≥ m+k), and assume φ_X(k)→0. If S_n=∑_j=1^n X_j and Var(S_n)→∞, prove that…
We conclude our talk with a list of future directions and open questions. (1) So far we have only rigorously derived the random modulus for the Brown- ian annulus. The report passage is retained verbatim as the relevant context for this…
Let n be a large integer, and let M_n be a random n by n matrix whose entries are independent Bernoulli random variables, each equal to 1 or -1 with probability 1/2. Define P_n:= P(det(M_n)=0). It is conjectured that Bernoulli matrix…
Is it possible to use the theory of overline∂-problems to analyze the normal matrix models?
Consider the two-type Richardson model on Z^d with d≥ 2, normalized so that type 1 has intensity 1 and type 2 has intensity λ. Let G be the event of infinite coexistence, and let P^1,λ denote the law of the process. Monotonicity…
For simple random walk (S_k)_k≥0 on Z^2, let F(n) be the set of sites having maximal local time by time n. For each r≥3, what is P(|F(n)|=r for infinitely many n)?
Determine the almost-sure asymptotic growth rate of the effective resistance from the root to graph-distance r in the uniform infinite planar triangulation.