IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v361y2019icp874-888.html
   My bibliography  Save this article

Dynamical attraction in parallel network models

Author

Listed:
  • Aledo, Juan A.
  • Diaz, Luis G.
  • Martinez, Silvia
  • Valverde, Jose C.

Abstract

In this work, we give a characterization of attractors in parallel deterministic network models, which evolve by means of maxterm and minterm Boolean functions and provide a method to obtain their basins of attraction. In order to do that, we distinguish the two possible cases: attractive fixed points and attractive 2-periodic orbits. Furthermore, we state necessary and sufficient conditions to know when a fixed point or a 2-periodic orbit is globally attractive. This makes possible to obtain a detailed description of their phase diagrams. Besides, we provide optimal upper bounds for the transient in such models, i.e., for the maximum number of iterations required to reach one of the periodic orbits. Moreover, we establish patterns that allow us to obtain a PDS on a maxterm or minterm Boolean function for which any given optimal upper bound for the transient is reached.

Suggested Citation

  • Aledo, Juan A. & Diaz, Luis G. & Martinez, Silvia & Valverde, Jose C., 2019. "Dynamical attraction in parallel network models," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 874-888.
    • Handle: RePEc:eee:apmaco:v:361:y:2019:i:c:p:874-888
    DOI: 10.1016/j.amc.2019.05.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319304503
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.05.048?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Barrett, Chris L & Chen, William Y.C & Zheng, Michelle J, 2004. "Discrete dynamical systems on graphs and Boolean functions," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 66(6), pages 487-497.
    2. Chiaselotti, G. & Gentile, T. & Oliverio, P.A., 2014. "Parallel and sequential dynamics of two discrete models of signed integer partitions," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 1249-1261.
    3. Andrew Wuensche, 1998. "Discrete Dynamical Networks and Their Attractor Basins," Working Papers 98-11-101, Santa Fe Institute.
    4. Juan A. Aledo & Silvia Martinez & Jose C. Valverde, 2015. "Parallel Dynamical Systems over Graphs and Related Topics: A Survey," Journal of Applied Mathematics, Hindawi, vol. 2015, pages 1-14, March.
    5. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2017. "On the Periods of Parallel Dynamical Systems," Complexity, Hindawi, vol. 2017, pages 1-6, January.
    6. Toroczkai, Zoltán & Guclu, Hasan, 2007. "Proximity networks and epidemics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(1), pages 68-75.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Giacopelli, G. & Migliore, M. & Tegolo, D., 2020. "Graph-theoretical derivation of brain structural connectivity," Applied Mathematics and Computation, Elsevier, vol. 377(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2019. "Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems," Complexity, Hindawi, vol. 2019, pages 1-10, March.
    2. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2020. "Coexistence of Periods in Parallel and Sequential Boolean Graph Dynamical Systems over Directed Graphs," Mathematics, MDPI, vol. 8(10), pages 1-14, October.
    3. Aledo, Juan A. & Diaz, Luis G. & Martinez, Silvia & Valverde, Jose C., 2019. "Solution to the predecessors and Gardens-of-Eden problems for synchronous systems over directed graphs," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 22-28.
    4. Juan A. Aledo & Ali Barzanouni & Ghazaleh Malekbala & Leila Sharifan & Jose C. Valverde, 2020. "On the Periodic Structure of Parallel Dynamical Systems on Generalized Independent Boolean Functions," Mathematics, MDPI, vol. 8(7), pages 1-14, July.
    5. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2017. "On the Periods of Parallel Dynamical Systems," Complexity, Hindawi, vol. 2017, pages 1-6, January.
    6. Mauro Mezzini & Fernando L. Pelayo, 2020. "An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph," Mathematics, MDPI, vol. 8(9), pages 1-9, September.
    7. Sanahuja, Silvia M., 2016. "New rough approximations for n-cycles and n-paths," Applied Mathematics and Computation, Elsevier, vol. 276(C), pages 96-108.
    8. Christensen, Claire & Albert, István & Grenfell, Bryan & Albert, Réka, 2010. "Disease dynamics in a dynamic social network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(13), pages 2663-2674.
    9. Sascha Holzhauer & Friedrich Krebs & Andreas Ernst, 2013. "Considering baseline homophily when generating spatial social networks for agent-based modelling," Computational and Mathematical Organization Theory, Springer, vol. 19(2), pages 128-150, June.
    10. Xie He & Amir Ghasemian & Eun Lee & Aaron Clauset & Peter J. Mucha, 2024. "Sequential stacking link prediction algorithms for temporal networks," Nature Communications, Nature, vol. 15(1), pages 1-15, December.
    11. Chiaselotti, G. & Gentile, T. & Infusino, F. & Oliverio, P.A., 2018. "Dependency and accuracy measures for directed graphs," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 781-794.
    12. Sara D. Cardell & Amparo Fúster-Sabater, 2019. "Binomial Representation of Cryptographic Binary Sequences and Its Relation to Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-13, March.
    13. Xiaoyan Zhang & Chao Wang, 2019. "Solutions to All-Colors Problem on Graph Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-11, June.
    14. Hegemann, Rachel A. & Smith, Laura M. & Barbaro, Alethea B.T. & Bertozzi, Andrea L. & Reid, Shannon E. & Tita, George E., 2011. "Geographical influences of an emerging network of gang rivalries," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(21), pages 3894-3914.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:361:y:2019:i:c:p:874-888. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.