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

推荐订阅源

G
Google Developers Blog
D
Docker
Stack Overflow Blog
Stack Overflow Blog
GbyAI
GbyAI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Google DeepMind News
Google DeepMind News
M
MIT News - Artificial intelligence
H
Help Net Security
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
L
LangChain Blog
MongoDB | Blog
MongoDB | Blog
腾讯CDC
H
Hackread – Cybersecurity News, Data Breaches, AI and More
S
SegmentFault 最新的问题
博客园 - 司徒正美
C
Check Point Blog
B
Blog
Y
Y Combinator Blog
Microsoft Azure Blog
Microsoft Azure Blog
P
Proofpoint News Feed
F
Fortinet All Blogs
美团技术团队
D
DataBreaches.Net

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}}$
A rigorous formulation of and partial results on Lorenz's...
Edvin Wedin · 2021-07-26 · via math.CO updates on arXiv.org

In a 2006 paper, Jan Lorenz observed a curious behaviour in numerical simulations of the Hegselmann-Krause model: Under some circumstances, making agents more closed-minded can produce a consensus from a dense configuration of opinions which otherwise leads to fragmentation. Suppose one considers initial opinions equally spaced on an interval of length $L$. As first observed by Lorenz, simulations suggest that there are three intervals $[0, L_1)$, $(L_1, L_2)$ and $(L_2, L_3)$, with $L_1 \approx 5.23$, $L_2 \approx 5.67$ and $L_3 \approx 6.84$ such that, when the number of agents is sufficiently large, consensus occurs in the first and third intervals, whereas for the second interval the system fragments into three clusters. In this paper, we prove consensus for $L \leq 5.2$ and for $L$ sufficiently close to 6. These proofs include large computations and in principle the set of $L$ for which consensus can be proven using our approach may be extended with the use of more computing power. We also prove that the set of $L$ for which consensus occurs is open. Moreover, we prove that, when consensus is assured for the equally spaced systems, this in turn implies asymptotic almost sure consensus for the same values of $L$ when initial opinions are drawn independently and uniformly at random. We thus conjecture a pair of phase transitions, making precise the formulation of Lorenz's "consensus strikes back" hypothesis. Our approach makes use of the continuous agent model introduced by Blondel, Hendrickx and Tsitsiklis. Indeed, one contribution of the paper is to provide a presentation of the relationships between the three different models with equally spaced, uniformly random and continuous agents, respectively, which is more rigorous than what can be found in the existing literature.