发表机构
AI Innovation Institute; Department of Electrical and Computer Engineering, Stony Brook University（AI创新研究院; 石溪大学电气与计算机工程系）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
研究快速与慢速双流通信在共享资源下的架构，提出互补性边际准则及单交叉定理，揭示传输耦合对截止时间约束下分配策略的影响。
AI 中文摘要
通信系统可以通过快速物理流传输紧急信息，并通过较慢的物质流传输更具体的信息。然而，在若干生物和工程场景中，快速过程也会改变慢速过程的传输规律。我们在共享资源约束下研究这种架构，其中快速信道容量-成本函数严格递增且凹，慢速分子信道具有截止时间约束。我们首先刻画了在分离消息路由和消息无关工作点调度下的容量区域，并确定了流之间互补而非竞争关系的边际准则。对于一维漂移扩散，我们证明了截止时间前到达概率在Péclet数上是严格对数凹的。对于可区分令牌的截止时间擦除信道，任何递增凹的传输驱动规律都产生精确的单交叉定理：当且仅当初始传输辅助弹性超过1时存在互补性，该转变在存在时是唯一的，并且递减分配分支在凸化后仍是帕累托边界。对于正基线漂移和足够强的耦合，一个唯一的临界归一化截止时间决定了互补性何时消失。短和长截止时间极限阐明了相关的时间机制。有限帧LTI-泊松慢速信道的数值示例展示了具有计数噪声和符号间干扰的类似分配行为。
英文摘要
A communication system may convey urgent information through a fast physical stream and more specific information through a slower material stream. In several biological and engineered settings, however, the fast process also changes the transport law of the slow one. We study this architecture under a shared resource constraint, with a strictly increasing concave fast-channel capacity--cost function and a deadline-constrained slow molecular channel. We first characterize the capacity region under separated message routing and message-independent operating-point schedules, and identify the marginal criterion for complementarity rather than competition between the streams. For one-dimensional drift diffusion, we prove that arrival probability before a deadline is strictly log-concave in Péclet number. For a distinguishable-token deadline-erasure channel, any increasing concave transport-actuation law then yields an exact single-crossing theorem: complementarity exists if and only if an initial transport-assistance elasticity exceeds one, the transition is unique when it exists, and the decreasing allocation branch remains the Pareto boundary after convexification. For positive baseline drift and sufficiently strong coupling, a unique critical normalized deadline determines when complementarity disappears. Short- and long-deadline limits clarify the associated temporal regimes. Numerical examples for a finite-frame LTI-Poisson slow channel exhibit analogous allocation behavior with counting noise and intersymbol interference.
