ISTA Publications
metadata only
Majority dynamics and internal partitions of random regular graphs: Experimental results
This paper focuses on Majority Dynamics in sparse graphs, in particular, as a tool to study internal cuts. It is known that, in Majority Dynamics on a finite graph, each vertex eventually either comes to a fixed state, or oscillates with period two. The empirical evidence acquired by simulations sug
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
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
- Explosive appearance of cores and bootstrap percolation on lattices#1079639
- Majority dynamics on sparse random graphs#1084861
- Percolation on Finite Graphs#1076208
- When are random regular triangle-free graphs bipartite?#1011670
Record · ID 1358956
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