惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

PCI Perspectives
PCI Perspectives
博
博客园 - Franky
M
MIT News - Artificial intelligence
B
Blog
P
Privacy International News Feed
T
The Exploit Database - CXSecurity.com
F
Full Disclosure
The Register - Security
The Register - Security
P
Proofpoint News Feed
T
Threat Research - Cisco Blogs
腾
腾讯CDC
Project Zero
Project Zero
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
T
Threatpost
人人都是产品经理
人人都是产品经理
Last Week in AI
Last Week in AI
Hugging Face - Blog
Hugging Face - Blog
Simon Willison's Weblog
Simon Willison's Weblog
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
Know Your Adversary
Know Your Adversary
Vercel News
Vercel News
C
CXSECURITY Database RSS Feed - CXSecurity.com
P
Privacy & Cybersecurity Law Blog
Cyberwarzone
Cyberwarzone
罗
罗磊的独立博客
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
S
Schneier on Security
月光博客
月光博客
酷 壳 – CoolShell
酷 壳 – CoolShell
B
Blog RSS Feed
IT之家
IT之家
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
V
V2EX
T
The Blog of Author Tim Ferriss
P
Palo Alto Networks Blog
Google DeepMind News
Google DeepMind News
Apple Machine Learning Research
Apple Machine Learning Research
Scott Helme
Scott Helme
Recorded Future
Recorded Future
A
About on SuperTechFans
博
博客园 - 【当耐特】
H
Help Net Security
宝玉的分享
宝玉的分享
C
CERT Recently Published Vulnerability Notes
D
DataBreaches.Net
美
美团技术团队
T
Tenable Blog
C
Cybersecurity and Infrastructure Security Agency CISA
雷峰网
雷峰网
V
Vulnerabilities – Threatpost

cs.DS updates on arXiv.org

Learning with Simulators: No Regret in a Computationally Bounded World Temporal Conductance and Bounds on the Voter Model for Dynamic Networks Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds A unified complexity bound for logconcave sampling Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity On finding exact solutions of linear programs in the oracle model A Fast Gaussian Mechanism under Continual Observation, with Applications Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions The Power of Test-Time Training for Approximate Sampling Fixed-Parameter Tractability of Private Synthetic Data Generation Express Language Modeling The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard Kikuchi Graphs of Random Hypergraphs are Approximately Johnson Complexity and Algorithms for Unary Translocation Distance From Estimates to Schedules: Learning-Augmented Restricted Assignment Optimal Online Equitable Allocation with Indivisible Resources Minimum Complete MR Subsets under Semantic-Mutation Fault Models: A Support-Set Domination Boundary Revisiting Diameter in Directed Graphs Differentially Private Range Subgraph Counting A note on rounding fractional matchings with constant-factor strong negative correlation Towards Tight Bounds for Streaming Attention Quantum enhanced rare event discovery and sampling Sharp Low-Degree Thresholds for Planted-vs-Planted Testing A General Framework for Dynamic Consistent Submodular Maximization The Preisach Extremum Stack is a Shannon-Minimal Sufficient Statistic for Rate-Independent Functionals HRNN: A Hybrid Graph Index for Approximate Reverse k-Nearest Neighbor Search on High-Dimensional Vectors Parallel Metric Skip Lists and Nearest Neighbor Search From Non-Convex to Strongly Convex: Curvature-Adaptive FTPL for Online Optimization On the gap of quiver representations Online K-d tree for approximate neighborhood search in data streams Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs Scalable Concurrent Queues for GPU Towards Optimal Robustness in Learning-Augmented Paging Adversarial Configurations for the ReCom Transition Function On Thin Perfect Matchings up to Polylogarithmic Factors Multiagent Matroid Upgrading: Greedy is Fair and Efficient The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme Dynamic Breadth First Search with Predictions The World's Fastest Matching Engine Algorithm Repeated Descent: A Framework for Online Budget-Feasible Auctions Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs Easy, robust approximate message passing for planted spike models High-Dimensional Expanders, the Sparsest Cut Problem, and Steurer's Conjecture Inner Product Aware Quantization: Provably Fast, Accurate, and Adaptive Algorithms An Upper Bound on Grothendieck's Constant Neuro-symbolic Syntactic Parsing: Shaping a Neural Network with the CYK Algorithm Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent Retriever Portfolios: A Principled Approach to Adaptive RAG Tree Containment Parameterized by Scanwidth Incremental BPE Tokenization Listing Even Cycles Faster than the Submodular-Width Barrier Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks On Language Generation in the Limit with Bounded Memory Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion Low-degree estimation thresholds in planted hypergraphs and tensor PCA Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems TC-MIS: Maximal Independent Set on Tensor-cores Sampling Directed Eulerian Tours in $\widetilde O(m^{3/2})$ Time Explaining Rankings with Hidden Group Bonuses Distributed Gaussian Mean Testing under Communication Constraints: messages, samples, and coins An Improved Greedy Approximation for (Metric) $k$-Means Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes Optimal Rates for Differentially Private Hypothesis Testing with E-values A Fresh Look at Lamarckian Evolution and the Baldwin Effect Disjunctive Sum of Squares A Deterministic Separation Lemma Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs Quantum principal component analysis without eigenvector recovery Privately Estimating Monotone Statistics in Polynomial Time Smoothed Score Queries and the Complexity of Sampling Proper Agnostic Learning of Functions of Halfspaces under Gaussian Marginals Tree Search With Predictions On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions Parsimonious Learning-Augmented Online Metric Matching Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing Low Soundness Linearity Testing on the Half-Slice On the Complexity of Bilevel Independent Set Problem Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64 Approximation algorithms for the prize-collecting rural postman problem A computational phase transition for learning-to-sample from Ising models Covering vertices by sequential stars Fermi-Dirac machines as quantizations of neurons A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation A Tight Bound on Localization of Electrical Flows Optimal Dimension-Free Sampling for Regularized Classification Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs Beyond the Half-Approximation: Fair and Efficient Online Class Matching Efficient Uniform Sampling of Surjections via their Profiles Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking Learning-Augmented Online Scheduling with Parsimonious Preemption Entropy Equivalence Testing Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees
A Combinatorial Characterization of Constant Mixing Time
Lap Chi Lau, Raymond Liu · 2025-11-27 · via cs.DS updates on arXiv.org

Classical spectral graph theory characterizes graphs with logarithmic mixing time. In this work, we present a combinatorial characterization of graphs with constant mixing time. The combinatorial characterization is based on the small-set bipartite density condition, which is weaker than having near-optimal spectral radius and is stronger than having near-optimal small-set vertex expansion.

此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。