跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 05:24 — 2026-11-19 05:24(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v4arXiv:1601.04794

Concentration Inequalities for Branching Random Walks with Applications to Phase Transitions in CSPs

Changqing Liu, Bo Zhang

原文摘要

A new framework is developed for studying phase transitions in random CSPs, from which a range of new results follows. Motivated by phase transition problems in CSPs, a more general concentration inequality is proved that retains classical sub-Gaussian tails under a mild global linear-growth condition $|S_n| < Cn$, relaxing the bounded-increment assumption to finite exponential moments and requiring neither independence nor the martingale property. We further extend the concentration inequality to branching random walks (BRW), obtaining the first concentration inequality for BRW. As applications, we derive partial differential equations (PDEs) for the $K$-SAT and $q$-COL backbones, yielding new results, including \textbf{(a)} a resolution of the long-standing open question of where $(2+p)$-SAT transition changes from second to first order; \textbf{(b)} rigorous results for $α_d$ in $K$-SAT, which give new lower bounds on the phase transition for 3-SAT (4.0029 vs. 3.51) and 4-SAT (8.360 vs. 7.91); and \textbf{(c)} the prefactor of the 2-SAT critical window.

cs.CC