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

推荐订阅源

Y
Y Combinator Blog
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG
Engineering at Meta
Engineering at Meta
Google DeepMind News
Google DeepMind News
aimingoo的专栏
aimingoo的专栏
Recent Announcements
Recent Announcements
A
About on SuperTechFans
U
Unit 42
MyScale Blog
MyScale Blog
J
Java Code Geeks
博客园_首页
Blog — PlanetScale
Blog — PlanetScale
D
Docker
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 司徒正美
量子位
月光博客
月光博客
G
Google Developers Blog
V
V2EX
博客园 - 聂微东
宝玉的分享
宝玉的分享
IT之家
IT之家
Vercel News
Vercel News

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Kuramoto model with frequency-degree correlations on comp...
B. C. Coutinho, A. V. Goltsev, S. N. Dorogovtsev, J. F. F. Mende · 2012-11-25 · via math.ST updates on arXiv.org

We study the Kuramoto model on complex networks, in which natural frequencies of phase oscillators and the vertex degrees are correlated. Using the annealed network approximation and numerical simulations we explore a special case in which the natural frequencies of the oscillators and the vertex degrees are linearly coupled. We find that in uncorrelated scale-free networks with the degree distribution exponent $2 < γ< 3$, the model undergoes a first-order phase transition, while the transition becomes of the second order at $γ>3$. If $γ=3$, the phase synchronization emerges as a result of a hybrid phase transition that combines an abrupt emergence of synchronization, as in first-order phase transitions, and a critical singularity, as in second-order phase transitions. The critical fluctuations manifest themselves as avalanches in synchronization process. Comparing our analytical calculations with numerical simulations for Erdős--Rényi and scale-free networks, we demonstrate that the annealed network approach is accurate if the the mean degree and size of the network are sufficiently large. We also study analytically and numerically the Kuramoto model on star graphs and find that if the natural frequency of the central oscillator is sufficiently large in comparison to the average frequency of its neighbors, then synchronization emerges as a result of a first-order phase transition. This shows that oscillators sitting at hubs in a network may generate a discontinuous synchronization transition.