4,233 research outputs found

    Zero forcing in iterated line digraphs

    Full text link
    Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line digraphs are frequently used as models. Zero forcing is also related to power domination, a propagation process that models the monitoring of electrical power networks. In this paper we study zero forcing in iterated line digraphs and provide a relationship between zero forcing and power domination in line digraphs. In particular, for regular iterated line digraphs we determine the minimum rank/maximum nullity, zero forcing number and power domination number, and provide constructions to attain them. We conclude that regular iterated line digraphs present optimal minimum rank/maximum nullity, zero forcing number and power domination number, and apply our results to determine those parameters on some families of digraphs often used in applications

    Dichotomy for tree-structured trigraph list homomorphism problems

    Get PDF
    Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP-complete. Thus while digraph list homomorphism problems enjoy dichotomy (each problem is NP-complete or polynomial time solvable), such dichotomy is not necessarily expected for trigraph list homomorphism problems. However, in this paper, we identify a large class of trigraphs for which list homomorphism problems do exhibit a dichotomy. They consist of trigraphs with a tree-like structure, and, in particular, include all trigraphs whose underlying graphs are trees. In fact, we show that for these tree-like trigraphs, the trigraph list homomorphism problem is polynomially equivalent to a related digraph list homomorphism problem. We also describe a few examples illustrating that our conditions defining tree-like trigraphs are not unnatural, as relaxing them may lead to harder problems

    On the number of outer automorphisms of the automorphism group of a right-angled Artin group

    Full text link
    We show that there is no uniform upper bound on |Out(Aut(A))| when A ranges over all right-angled Artin groups. This is in contrast with the cases where A is free or free abelian: for all n, Dyer-Formanek and Bridson-Vogtmann showed that Out(Aut(F_n)) = 1, while Hua-Reiner showed |Out(Aut(Z^n)| = |Out(GL(n,Z))| < 5. We also prove the analogous theorem for Out(Out(A)). We establish our results by giving explicit examples; one useful tool is a new class of graphs called austere graphs

    Online Learning with Feedback Graphs: Beyond Bandits

    Get PDF
    We study a general class of online learning problems where the feedback is specified by a graph. This class includes online prediction with expert advice and the multi-armed bandit problem, but also several learning problems where the online player does not necessarily observe his own loss. We analyze how the structure of the feedback graph controls the inherent difficulty of the induced TT-round learning problem. Specifically, we show that any feedback graph belongs to one of three classes: strongly observable graphs, weakly observable graphs, and unobservable graphs. We prove that the first class induces learning problems with Θ~(α1/2T1/2)\widetilde\Theta(\alpha^{1/2} T^{1/2}) minimax regret, where α\alpha is the independence number of the underlying graph; the second class induces problems with Θ~(δ1/3T2/3)\widetilde\Theta(\delta^{1/3}T^{2/3}) minimax regret, where δ\delta is the domination number of a certain portion of the graph; and the third class induces problems with linear minimax regret. Our results subsume much of the previous work on learning with feedback graphs and reveal new connections to partial monitoring games. We also show how the regret is affected if the graphs are allowed to vary with time
    • …
    corecore