HAL (France)
open access
Fixed points of Boolean networks with sparse connections
We study fixed points (FPs) of cellular automata with N sites on random sparse graphs. In the large N limit such models are known to exhibit phase transitions, from a 'frozen' phase, where at most a finite number of sites fluctuate at long times, to a 'fluctuating' phase where a finite fraction of s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Phase transitions for percolation of words in one dimension#972061
- No noise, no party! On Shannon, Aesthetics and one reason for the love of random in digital art practices#204310
- Point process convergence of large inradii of Poisson-Laguerre tessellations#1034546
- Extracting and Representing Qualitative Behaviors of Complex Systems in Phase Spaces#242068
- Stochastic processes on complex networks: techniques and explorations#648864
Record · ID 983880
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive