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

推荐订阅源

J
Java Code Geeks
量子位
MongoDB | Blog
MongoDB | Blog
N
Netflix TechBlog - Medium
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
B
Blog
A
About on SuperTechFans
腾讯CDC
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG
雷峰网
雷峰网
Last Week in AI
Last Week in AI
H
Help Net Security
WordPress大学
WordPress大学
博客园 - 司徒正美
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
H
Hackread – Cybersecurity News, Data Breaches, AI and More
T
Tailwind CSS Blog
博客园 - 【当耐特】
S
SegmentFault 最新的问题
美团技术团队
M
MIT News - Artificial intelligence
L
LangChain Blog
博客园 - 聂微东

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Feedback control of the Kuramoto model defined on uniform...
[Submitted on 4 May 2025 (v1), last revised 2 Jun 2026 (this ver · 2026-06-03 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study feedback control of the Kuramoto model with uniformly spaced natural frequencies defined on uniform graphs which may be complete, random dense or random sparse. The control objective is to drive all nodes to the same constant rotational motion. For the case of node number $n\ge 3$, we establish the existence of exactly $2^n$ synchronized solutions in the controlled Kuramoto model (CKM) and their saddle-node and pitchfork bifurcations, and determine their stability. In particular, we show that only a solution converging to the desired motion in the limit of infinite feedback gain is stable and the others are unstable. Based on the previous results, it is shown that (i) the solution to which the stable synchronized solution in the CKM converge as $n\to\infty$ is always asymptotically stable in the continuous limit (CL) if it exists, and (ii) the asymptotically stable solution of the CL captures the asymptotic behavior of the CKM when the node number is sufficiently large, even if the graphs are random dense or sparse. We demonstrate the theoretical results by numerical simulations for the CKM on complete simple, and uniform random dense and sparse graphs.

Submission history

From: Kazuyuki Yagasaki [view email]
[v1] Sun, 4 May 2025 17:32:41 UTC (271 KB)
[v2] Tue, 27 Jan 2026 10:03:41 UTC (273 KB)
[v3] Sat, 2 May 2026 02:45:37 UTC (273 KB)
[v4] Tue, 2 Jun 2026 03:57:36 UTC (276 KB)