Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 181 for “"Zero-Forcing"”.

  1. Randomized Zero Forcing

    … each vertex can be colored blue or white, a zero forcing set on G describes a starting set of vertices to color blue, where every other vertex is colored white, such that by applying an iterative deterministic coloring rule, all vertices of G will be blue after a number of iterations. …

    rice Repository record for Randomized Zero Forcing (opens in a new tab)

  2. Zero Forcing Sets for Graphs

    … entry in position (i; j), for i x j, is non-zero if ij is an edge in G and zero otherwise. Also, the (positive semi-de nite) maximum nullity of G is de ned to be the largest possible nullity of a (positive semi-de nite) matrix in the above set of matrices. In this thesis we study two graph …

    regina Repository record for Zero Forcing Sets for Graphs (opens in a new tab) Download PDF for Zero Forcing Sets for Graphs (opens in a new tab)

  3. Zero Forcing in Graphs and Digraphs

    No abstract prepared.

    texas-state Repository record for Zero Forcing in Graphs and Digraphs (opens in a new tab)

  4. Properties of the Zero Forcing Number

    The zero forcing number is a graph parameter first introduced as a tool for solving the minimum rank problem, which is: Given a simple, undirected graph G, and a field F, let S(F,G) denote the set of all symmetric matrices A=[a_{ij}] with entries in F such that a_{ij} doess not equal 0 if and only …

    byu Repository record for Properties of the Zero Forcing Number (opens in a new tab) Download PDF for Properties of the Zero Forcing Number (opens in a new tab)

  5. Graph Coloring, Zero Forcing, and Related Problems

    … The second part of the thesis focuses on zero forcing - a dynamic graph coloring process whereby at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. Zero forcing has applications in linear algebra, quantum control, and power …

    rice Repository record for Graph Coloring, Zero Forcing, and Related Problems (opens in a new tab)

  6. Augmenting Wireless Security Using Zero-Forcing Beamforming

    … APs construct simultaneous data streams using Zero-Forcing Beamforming (ZFBF). Instead of using this technique for simultaneous data stream generation, STROBE utilizes ZFBF by allowing an AP to use one stream to communicate with an intended user and the remaining streams to orthogonally "blind" …

    rice Repository record for Augmenting Wireless Security Using Zero-Forcing Beamforming (opens in a new tab)

  7. Variations of zero forcing and power domination

    <p>Zero forcing is a propagation process on a graph that turns white vertices into blue vertices. In this process, an initial set of vertices in a graph $G$ are chosen to be blue and all others are colored white, then a color-change rule is iteratively applied until all of $G$ becomes blue. A large …

    iastate Repository record for Variations of zero forcing and power domination (opens in a new tab)

  8. Propagation processes: Full throttling and probabilistic zero forcing

    Zero forcing is a process that arose in many contexts, including mathematical physics under the name ``graph infection", in graph searching problems in computer science, and in linear algebra as an upper bound on the multiplicity of an eigenvalue of a matrix described by a graph. With standard zero …

    iastate Repository record for Propagation processes: Full throttling and probabilistic zero forcing (opens in a new tab)

  9. Probabilistic variations of zero forcing and power domination

    Zero forcing is a graph propagation process in which white vertices are colored blue by neighboring blue vertices. Probabilistic zero forcing is a generalization of zero forcing where a blue vertex $v$ colors a white neighbor blue with probability proportional to the number of blue neighbors of …

    iastate Repository record for Probabilistic variations of zero forcing and power domination (opens in a new tab)

  10. Positive semidefinite maximum nullity and zero forcing number

    <p>The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by a simple, undirected graph. We study the positive semidefinite zero forcing number and some of its properties. In addition, we compute the positive semidefinite maximum …

    iastate Repository record for Positive semidefinite maximum nullity and zero forcing number (opens in a new tab)

  11. A fractional approach to minimum rank and zero forcing

    … of graph parameters related to minimum rank and zero forcing. Projective rank, a graph parameter with applications to quantum information, is formally related to $r$-fold generalizations of orthogonal representations for graphs. Using similar techniques, fractional minimum positive semidefinite …

    iastate Repository record for A fractional approach to minimum rank and zero forcing (opens in a new tab)

  12. Connections to zero forcing: Tree covers and power domination

    <p>For a simple graph $G=(V,E),$ let $\mathcal{S}_+(G)$ denote the set of real positive semidefinite matrices $A=(a_{ij})$ such that $a_{ij}\neq 0$ if $\{i,j\}\in E$, $a_{ij}=0$ if $\{i,j\}\notin E$, and $a_{ii}$ is any real number. The maximum positive semidefinite nullity of $G$, denoted …

    iastate Repository record for Connections to zero forcing: Tree covers and power domination (opens in a new tab)

  13. Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems

    … location problems, the p-Median problem and the zero-forcing problem. For the p-median problem, I present a branch decomposition based method that finds the best p-median solution that is limited to some input support graph. The algorithm can be used to either find an integral solution from a …

    rice Repository record for Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems (opens in a new tab)

  14. Variants of zero forcing and their applications to the minimum rank problem

    … restrictions. These restrictions can be the zero-nonzero pattern, conditions on the inertia, or other properties of a matrix. Zero forcing is a powerful technique for controlling the nullity and plays a significant role in the minimum rank problem. This thesis introduces several zero forcing …

    iastate Repository record for Variants of zero forcing and their applications to the minimum rank problem (opens in a new tab)

  15. Zero forcing number: Results for computation and comparison with other graph parameters

    <p>The zero forcing number of a graph is the minimum size of a zero forcing set. This parameter is useful in the minimum rank/maximum nullity problem, as it gives an upper bound to the maximum nullity. Results for determining graphs with extreme zero forcing numbers, for determining the zero …

    iastate Repository record for Zero forcing number: Results for computation and comparison with other graph parameters (opens in a new tab)

  16. Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination

    … The next problem that is studied is the Zero Forcing Problem. Zero forcing is a graph coloring process based on the following color change rule: all vertices of a graph G are initially colored either blue or white; in each time-step, a white vertex turns blue if it is the only white …

    rice Repository record for Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination (opens in a new tab)

  17. Addressing the hidden terminal problem in MU-MIMO WLANs with relaxed zero-forcing approach

    … First, a) at the Physical (PHY) layer, the Zero-forcing (ZF) transmission strategy with fairness and throughput aware precoding is proposed, b) a hybrid scheduling scheme, combining the packet position-based First In First Out (FIFO) and channel quality-based scheme, namely the Best of the …

    uts Repository record for Addressing the hidden terminal problem in MU-MIMO WLANs with relaxed zero-forcing approach (opens in a new tab)

Page 1 of 10