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

推荐订阅源

U
Unit 42
博客园 - Franky
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
人人都是产品经理
人人都是产品经理
雷峰网
雷峰网
Hugging Face - Blog
Hugging Face - Blog
有赞技术团队
有赞技术团队
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
阮一峰的网络日志
阮一峰的网络日志
C
Check Point Blog
爱范儿
爱范儿
T
The Blog of Author Tim Ferriss
aimingoo的专栏
aimingoo的专栏
Stack Overflow Blog
Stack Overflow Blog
博客园 - 聂微东
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
L
LangChain Blog
云风的 BLOG
云风的 BLOG
MyScale Blog
MyScale Blog
Microsoft Security Blog
Microsoft Security Blog
The Cloudflare Blog
博客园 - 三生石上(FineUI控件)

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Maximally-stable Local Optima in Random Graphs and Spin G...
Yatin Dandi, David Gamarnik, Lenka Zdeborová · 2023-05-05 · via math.CO updates on arXiv.org

We consider $h$-stable local optima of Ising spin glass models, defined as spin configurations such that for nearly all of the spins, flipping their values results in increasing energy by at least a given amount $h$. Spins satisfying this condition are referred to as $h$-stable spins for that configuration. Similarly, we consider a very related notion of $h$-friendly partitions of a graph. These are defined as bi-partitionings such that for most nodes, the normalized number of neighbors within the node's partition exceed the normalized number of neighbors outside the partition by a certain amount $h$. For spin glasses as well as sparse and dense random graphs, while restricting to bisections, we prove the existence of a phase transition for the normalized energy level $h$ around a universal value $h^*$. For $h$ below the phase transition value $h^*$, bisections exist where the number of spins (nodes) which are not $h$-stable (not $h$-friendly) is sublinear. Above the phase transition level $h^*$ the smallest number of spins that are not $h$-stable (not $h$-friendly) is linear. This confirms a conjecture from Behrens et al. (2022). Our results also allow the characterization of possible energy values of stable local optima for varying $h$. In particular, for $h=0$, this rigorously proves seminal results in statistical physics regarding the so-called metastable states, such as in the work of Bray and Moore (1981). Our results extend a recent proof of the so-called Friendly Partition Conjecture in Ferber et al. (2022) from the case $h=0$ to the case when $h$ takes general values. Our proofs are obtained by analyzing the model on sparse random graphs and adopting Lindeberg's type universality method to lift the results from sparse to dense graphs and spin systems.