A phase transition phenomenon in a random directed acyclic graph.
Boris G. PittelR. TungolPublished in: Random Struct. Algorithms (2001)
Keyphrases
- directed acyclic graph
- phase transition
- random instances
- random constraint satisfaction problems
- randomly generated
- constraint satisfaction
- easy hard easy pattern
- equivalence class
- satisfiability problem
- directed graph
- conditional independence
- random sat
- hard problems
- average degree
- random variables
- combinatorial problems
- structural learning
- equivalence classes
- np complete problems
- graph coloring
- sat problem
- np complete
- random graphs
- sat instances
- small world networks
- cellular automata
- social networks
- connected subgraphs
- lower bound
- reinforcement learning