ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a strict graphic sequence of type ε\varepsilon. Let GD\mathbb{G}^{D} be the set of graphs with degree sequence DD, and let Gg(D)\mathcal{G}_{\mathbf{g}}(D) be uniformly distributed on GD\mathbb{G}^{D}. For a tree TT and an injective map ss, define

pg(s,T)=E[1s(T,Gg(D))].\mathbf{p_{g}}(s,T)=E\left[\mathbf{1}_{s}\left(T,\mathcal{G}_{\mathbf{g}}(D)\right)\right].

Define

Lg(k,D):=1M∑(s,T)∈Snk×Tk1ψ(s,T,D)∣pg(s,T)−p~(s,T)∣,L_{\mathbf{g}}(k,D):=\frac{1}{M}\sum_{(s,T)\in\mathbb{S}_{n}^{k}\times\mathbb{T}^{k}}\frac{1}{\psi(s,T,D)}\left|\mathbf{p_{g}}(s,T)-\mathbf{\widetilde{p}}(s,T)\right|,

where Tk\mathbb{T}^{k}, Snk\mathbb{S}_{n}^{k}, and ψ(s,T,D)\psi(s,T,D) are defined in the paper, and p~(s,T)\mathbf{\widetilde{p}}(s,T) is the corresponding independent-edge probability. Weighted tree-indicator approximation conjecture. Then

Lg(k,D)≤ck⋅nlog⁡(n)M.L_{\mathbf{g}}(k,D)\leq c_{k}\cdot\sqrt{\frac{n\log(n)}{M}}.

The claim is proposed as the analogue, for the uniform fixed-degree-sequence model, of the corresponding estimate for the independent-edge model. The surrounding discussion states that the paper proves this conjecture in several regimes, including very sparse, dense, and bipartite graphs, but the general assertion is presented as a conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.