Abstract
The authors perform a numerical test to check the existence of ultrametricity in the set of cycles of random Boolean automata networks. They find signs of it when the test is applied to networks with connectivity two and three. However, the system sizes are probably still to conclude whether it is trivial (only equilateral triangles) or not.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
