Probabilistic zero forcing with vertex reversion
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Random walks on graphs (05C81) Stochastic matrices (15B51) Combinatorial probability (60C05) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods in Markov chains (60J22)
Cites work
- Critical attractive spin systems
- Essentials of Stochastic Processes
- Fast-mixed searching and related problems on graphs
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 1161555 (Why is no real title available?)
- scientific article; zbMATH DE number 790938 (Why is no real title available?)
- Inverse Problems and Zero Forcing for Graphs
- Metastable densities for the contact process on power law random graphs
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Probabilistic zero forcing on random graphs
- Probalistic zero forcing in graphs
- Propagation time for probabilistic zero forcing
- The contact process with an asymptomatic state
- The critical contact process dies out
- Throttling for the game of cops and robbers on graphs
- Using Markov chains to determine expected propagation time for probabilistic zero forcing
- Zero forcing and power domination for graph products
- Zero forcing sets and the minimum rank of graphs
This page was built for publication: Probabilistic zero forcing with vertex reversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908467)
