Using Markov chains to determine expected propagation time for probabilistic zero forcing (Q3299342): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Using Markov chains to determine expected propagation time for probabilistic zero forcing
Property / author
 
Property / author: Jesse T. Geneson / rank
Normal rank
 
Property / author
 
Property / author: Leslie Hogben / rank
Normal rank
 
Property / author
 
Property / author: Jesse T. Geneson / rank
 
Normal rank
Property / author
 
Property / author: Leslie Hogben / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1906.11083 / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5374237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration Index of a Zero Forcing Set in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for zero forcing on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Zero Forcing in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite propagation time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:23, 23 July 2024

scientific article
Language Label Description Also known as
English
Using Markov chains to determine expected propagation time for probabilistic zero forcing
scientific article

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 2020
    0 references
    probabilistic zero forcing
    0 references
    expected propagation time
    0 references
    Markov chain
    0 references
    math.CO
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references