ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gn,δG_{n,\delta} be an Erdős–Rényi random graph, and construct a temporal instance I(Gn,δ){\cal I}(G_{n,\delta}) by assigning labels to the edges of Gn,δG_{n,\delta} independently and uniformly at random in [0,δ][0,\delta], and assigning labels to all other edges independently and uniformly at random in [δ,1][\delta,1]. For a vertex set QQ, define its label interval by

Δ(Q)=[min⁡(λ(e):e∈Q),max⁡(λ(e):e∈Q)].\Delta(Q)=\left[\min(\lambda(e):e\in Q),\max(\lambda(e):e\in Q)\right].

Let Q∗Q^* be the δ\delta-clique constructed by algorithm ASRT{\cal A}_{SRT} on instance I(Gn,δ){\cal I}(G_{n,\delta}). Uniform-distribution conjecture. Then Δ(Q∗)\Delta(Q^*) is distributed almost uniformly at random within [0,1][0,1]. This conjecture concerns the distribution of the interval containing the labels of an algorithmically found temporal clique and is proposed as a possible route toward proving the reduction from temporal-clique approximation to maximum-clique approximation in Erdős–Rényi graphs; no proof or resolution is given.

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.