Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-28T13:27:31.690Z Has data issue: false hasContentIssue false
  • English
  • Français

Inflation of strongly connected networks

Published online by Cambridge University Press:  12 January 2011

NIKITA AGARWAL
NIKITA AGARWAL*
Affiliation:
Department of Mathematics, University of Houston, Houston, TX, 77204-3008, U.S.A. e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

A coupled cell network is an inflation of if the dynamics of is embedded in as a quotient network. We give necessary and sufficient conditions for the existence of a strongly connected inflation of a strongly connected network. We provide a simple algorithm for the construction of a strongly connected inflation as a sequence of simple inflations.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 150 , Issue 2 , March 2011 , pp. 367 - 384
Copyright
Copyright © Cambridge Philosophical Society 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Agarwal, N. and Field, M.Dynamical equivalence of networks of coupled dynamical systems. Nonlinearity 23 (2010), 1245–1268.Google Scholar
[2]Agarwal, N. and Field, M.Dynamical equivalence of networks of coupled dynamical systems: symmetric inputs. Nonlinearity 23 (2010), 1269–1290.Google Scholar
[3]Aguiar, M., Dias, A. P. S., Ashwin, P. and Field, M. Dynamics of coupled cell networks: synchrony, heteroclinic cycles and inflation. J. Nonlinear Sci. submitted.Google Scholar
[4]Aguiar, M., Dias, A. P. S., Golubitsky, M. and Leite, M. C. A.Bifurcations from regular quotient networks: A first insight. Physica D 238 (2009), 137–155.Google Scholar
[5]Bollobas, B.Modern Graph Theory (Springer, 1998).Google Scholar
[6]Dias, A. P. S. and Stewart, I.Linear equivalence and ODE-equivalence for coupled cell networks. Nonlinearity 18 (2005), 1003–1020.CrossRefGoogle Scholar
[7]Field, M. J.Combinatorial Dynamics. Dynamical Systems 19 (2004), 217–243.CrossRefGoogle Scholar
[8]Fleischner, H. and Jackson, B.A note concerning some conjectures on cyclically 4-edge connected 3-regular graphs. Ann. of Disc. Math. 14 (1989), 171–178.Google Scholar
[9]Golubitsky, M. and Stewart, I.Nonlinear dynamics of networks: the groupoid formalism. Graphs Combin. 19 (2003), 137–144.Google Scholar
[10]Golubitsky, M., Stewart, I. and Török, A.Patterns of synchrony in coupled cell networks with multiple arrows. SIAM J. Appl. Dyn. Syst. 4 (2005), 78–100.CrossRefGoogle Scholar
[11]Prowse, A. and Woodall, D. R.Choosability of powers of circuits. Ann. of Disc. Math. 14 (1989), 171–178.Google Scholar
[12]Stewart, I., Golubitsky, M. and Pivato, M.Symmetry groupoids and patterns of synchrony in coupled cell networks. SIAM J. Appl. Dyn. Syst. 2 (2003), 609–646.Google Scholar
[13]Timme, M.Does dynamics reflect topology in directed networks? Europhysics Letters 76 (2006), 367–373.Google Scholar
[14]Wu, C. W.On Rayleigh Ritz ratios of a generalized Laplacian matrix of directed graphs. Linear Algebra Appl. 402 (2005), 207–227.Google Scholar