Searcharxiv⌕ Search

arXiv · cond-mat/0201453

Acceleration effect of coupled oscillator systems

Also available from

Abstract

We have developed a curved isochron clock (CIC) by modifying the radial isochron clock to provide a clean example of the acceleration (deceleration) effect. By analyzing a two-body system of coupled CICs, we determined that an unbalanced mutual interaction caused by curved isochron sets is the minimum mechanism needed for generating the acceleration (deceleration) effect in coupled oscillator systems. From this we can see that the Sakaguchi and Kuramoto (SK) model which is a class of non-frustrated mean feild model has an acceleration (deceleration) effect mechanism. To study frustrated coupled oscillator systems, we extended the SK model to two oscillator associative memory models, one with symmetric and one with asymmetric dilution of coupling, which also have the minimum mechanism of the acceleration (deceleration) effect. We theoretically found that the {\it Onsager reaction term} (ORT), which is unique to frustrated systems, plays an important role in the acceleration (de! celeration) effect. These two models are ideal for evaluating the effect of the ORT because, with the exception of the ORT, they have the same order parameter equations. We found that the two models have identical macroscopic properties, except for the acceleration effect caused by the ORT. By comparing the results of the two models, we can extract the effect of the ORT from only the rotation speeds of the oscillators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Toru Aonishi, Koji Kurata, Masato Okada. 2002-02-01. Acceleration effect of coupled oscillator systems. https://doi.org/10.1103/physreve.65.046223. https://searcharxiv.com/abs/cond-mat/0201453

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Motif enrichment as a driver of scale-free behavior in rewired random regular graphs

We study the statistics of rewired random regular graphs (RRGs) in a mixed ensemble, where the average number of triangles is controlled by the fugacity $λ$, while the number of vertices and the vertex degree are fixed. This model exhibits a phase transition at critical fugacity $λ_{cr}$ from a triangle-poor phase (TPP), in which the number of triangles is independent of the system size, to a triangle-rich phase (TRP), in which the number of triangles scales linearly with the system size. We estimate $λ_{cr}$ by comparing the entropy of TPP with the energy of TRP. Above $λ_{cr}$, the RRG becomes a two-phase system in which dense clusters are connected by a sparse scale-free sub-network characterized by a degree distribution, $P(d) \sim d^{-γ}$, with $γ\approx 2$, independent of the size of the whole graph and its degree. We attribute this behavior to an "emergent preferential attachment" induced by triangle motifs, describe the mechanism underlying its formation, and derive the exponent $γ$ within a mean-field approach. Numerically the clusters and the inter-cluster subnetwork are identified through the Ollivier-Ricci curvature of the edges: it is positive inside clusters and negative on the links that form the inter-cluster subnetwork. We find that most inter-cluster triangles are isosceles, with the base lying inside one cluster and the apex belonging to the inter-cluster network. It is conjectured that a spanning inter-cluster scale-free network is stabilized against complete defragmentation into a disconnected set of cliques, by a sparse, structurally rigid "gas" of such apex-shared isosceles triads.

cond-mat.dis-nn↗

Graph neural networks and the energetic cavity method for combinatorial optimization

We study the use of graph neural networks (GNNs) for finding approximate ground states of Ising models. Efficiently finding these ground states is of broad significance because many combinatorial optimization problems can be formulated as an Ising model with the appropriate choice of couplings and fields. Exactly solving these problems is hard but there are many good heuristic methods. A lineage of these heuristics build from mean-field approximations: one approach uses the leading eigenvector of an appropriately defined matrix, another is the min-sum algorithm, also known as the energetic cavity method. Without modification, GNNs perform worse than both of these methods. We consider small modifications to the GNN to incorporate these heuristics and find that this considerably improves performance. While the modified approach is much stronger than other deep learning approaches, we still find that simulated annealing is generally as good for the same computational cost.

cond-mat.dis-nn↗

Contact-number hyperuniformity at glass close packing in infinite dimensions

We investigate contact-number fluctuations of harmonic spheres near glass close packing (GCP), the amorphous jamming endpoint reached by compressing an ideal glass. Using replica theory, we show that the Gardner-unstable region shrinks toward jamming as the spatial dimension increases, allowing GCP to be approached along a stable one-step replica symmetry breaking branch in the high-dimensional limit. By coupling an external field to the local contact number, we derive the variance of the total contact number and the wave-number-dependent structure factor directly from the microscopic interactions. At GCP, the structure factor vanishes quadratically at small scaled wave numbers, demonstrating contact-number hyperuniformity. Upon weak compression above GCP, the structure factor develops a low-wave-number plateau whose height is proportional to the excess coordination. These results provide an analytical description of contact-number hyperuniformity and its breakdown upon compression.

cond-mat.dis-nn↗