|
|||||
 |
|
|
|
|
|
|
|
The number of
fixed points of AND-OR networks with chain topology
Alan Veliz-Cuba and Lauren Geiser
Vol. 12 (2019), No. 6, 1051–1068
|
Abstract |
|
AND-OR networks are Boolean networks where each coordinate function is either the AND or OR logical operator. We study the number of fixed points of these Boolean networks in the case that they have a wiring diagram with chain topology. We find closed formulas for subclasses of these networks and recursive formulas in the general case. Our results allow for an effective computation of the number of fixed points in the case that the topology of the Boolean network is an open chain (finite or infinite) or a closed chain. We further explore how our approach could be used in “fractal” chains. |
PDF Access Denied
We have not been able to recognize your IP address
13.58.150.59
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
Boolean networks, steady states, fixed points,
discrete-time systems, AND-OR networks
|
Mathematical Subject Classification 2010
Primary: 94C10, 06E30, 05C99
|
Milestones
Received: 3 January 2019
Accepted: 21 April 2019
Published: 3 August 2019
Communicated by Kenneth S. Berenhaut
|
Authors |
| Alan Veliz-Cuba | |
| Department of Mathematics University of Dayton Dayton, OH United States |
|
| Lauren Geiser | |
| University of Dayton Dayton, OH United States |
|
