ZBZachary Brennan

Zachary Brennan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zachary Brennan has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Probabilistic zero forcing with vertex reversion

    by Zachary Brennan

    Probabilistic zero forcing is a graph coloring process in which blue vertices "infect" (color blue) white vertices with a probability proportional to the number of neighboring blue vertices. This paper introduces reversion probabilistic zero forcing (RPZF), which shares the same infection dynamics but also allows for blue vertices to revert to being white in each round. A threshold number of blue vertices is produced such that the complete graph is entirely blue in the next round of RPZF with high probability. Utilizing Markov chain theory, a tool is formulated which, given a graph's RPZF Markov transition matrix, calculates the probability of whether the graph becomes all white or all blue as well as the time at which this is expected to occur.


  • Open Access

    Probabilistic Zero Forcing with Vertex Reversion

    by Zachary Brennan

    Probabilistic zero forcing is a graph coloring process in which blue vertices "infect" (color blue) white vertices with a probability proportional to the number of neighboring blue vertices. We introduce reversion probabilistic zero forcing (RPZF), which shares the same infection dynamics but also allows for blue vertices to revert to being white in each round. We establish a tool which, given a graph's RPZF Markov transition matrix, calculates the probability that the graph turns all white or all blue as well as the time at which this is expected to occur. For specific graph families we produce a threshold number of blue vertices for the graph to become entirely blue in the next round with high probability.

  • Open Access

    Power domination with random sensor failure

    by Beth Bjorkman, Zachary Brennan, Mary Flagg, Johnathan Koch

    The power domination problem seeks to determine the minimum number of phasor measurement units (PMUs) needed to monitor an electric power network. We introduce random sensor failure before the power domination process occurs and call this the fragile power domination process. For a given graph, PMU placement, and probability of PMU failure $q$, we study the expected number of observed vertices at the termination of the fragile power domination process. This expected value is a polynomial in $q$, which we relate to fault-tolerant and PMU-defect-robust power domination. We also study the probability of that the entire graph becomes observed and give results for some graph families.

  • Orthogonal realizations of random sign patterns and other applications of the SIPP

    by Zachary Brennan, Christopher Cox, Bryan Curtis, Enrique Gomez-Leos, Kimberly Hadaway, Leslie Hogben, Conor Thompson

    A sign pattern is an array with entries in $\{+,-,0\}$. A real matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A. Curtis and B.L. Shader, Sign patterns of orthogonal matrices and the strong inner product property, Linear Algebra Appl. 592: 228-259, 2020], is an important tool when determining whether a sign pattern allows row orthogonality because it guarantees there is a nearby matrix with the same property, allowing zero entries to be perturbed to nonzero entries, while preserving the sign of every nonzero entry. This paper uses the SIPP to initiate the study of conditions under which random sign patterns allow row orthogonality with high probability. Building on prior work, $5\times n$ nowhere zero sign patterns that minimally allow orthogonality are determined. Conditions on zero entries in a sign pattern are established that guarantee any row orthogonal matrix with such a sign pattern has the SIPP.


  • Open Access

    Orthogonal realizations of random sign patterns and other applications of the SIPP

    by Zachary Brennan, Christopher Cox, Bryan A. Curtis, Enrique Gomez-Leos, Kimberly P. Hadaway, Leslie Hogben, Conor Thompson

    A sign pattern is an array with entries in $\{+,-,0\}$. A matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~Shader, Sign patterns of orthogonal matrices and the strong inner product property, Linear Algebra Appl. 592: 228--259, 2020], is an important tool when determining whether a sign pattern allows row orthogonality because it guarantees there is a nearby matrix with the same property, allowing zero entries to be perturbed to nonzero entries, while preserving the sign of every nonzero entry. This paper uses the SIPP to initiate the study of conditions under which random sign patterns allow row orthogonality with high probability. Building on prior work, $5\times n$ nowhere zero sign patterns that minimally allow orthogonality are determined. Conditions on zero entries in a sign pattern are established that guarantee any row orthogonal matrix with such a sign pattern has the SIPP.