ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T>0T>0, let j≥2j\geq 2, and let c∈(0,1)c\in(0,1). The event that, at some time t∈[0,T]t\in[0,T], some servers have queues of length jj while the remaining servers have queues of length 11 is

{X1n(t)=1, X2n(t)=⋯=Xjn(t)=c, Xj+1n(t)=0 for some t∈[0,T]}.\left\{X_1^n(t)=1,\ X_2^n(t)=\cdots=X_j^n(t)=c,\ X_{j+1}^n(t)=0\ \text{for some }t\in[0,T]\right\}.

This corresponds to ncnc queues of length jj and n(1−c)n(1-c) queues of length 11. Piecewise-linear optimal-trajectory conjecture. The optimal trajectory governing the decay rate of this event's probability is piecewise linear. The source describes the conjecture as analogous to the first event, except that the shorter queues decrease to one rather than zero. A rigorous analysis of the probability asymptotics remains open; establishing this trajectory would identify the path-space minimizer whose cost gives the decay rate.

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.