bifurcations in time-delay fully-connected networks with symmetry

Clicks: 120
ID: 135591
2014
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
In this work a brief method for finding steady-state and Hopf bifurcations in a (R + 1)-th order N-node time-delay fully-connected network with symmetry is explored. A self-sustained Phase-Locked Loop is used as node. The irreducible representations found due to the network symmetry are used to find regions of time-delay independent stability/instability in the parameter space. Symmetry-preserving and symmetry-breaking bifurcations can be computed numerically using the Sn map proposed in [1]. The analytic results show the existence of symmetry-breaking bifurcations with multiplicity N − 1. A second-order N-node network is used as application example. This work is a generalization of some results presented in [2].
Reference Key
paolo2014matecbifurcations Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Ferruzzo Correa Diego Paolo;Castilho Piqueira José Roberto
Journal acta botânica brasílica
Year 2014
DOI 10.1051/matecconf/20141605005
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.