17,236 research outputs found

    Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs

    Full text link
    A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. We show that these graphs, which we call total domishold graphs, form a non-hereditary class of graphs properly containing the classes of threshold graphs and the complements of domishold graphs, and are closely related to threshold Boolean functions and threshold hypergraphs. We present a polynomial time recognition algorithm of total domishold graphs, and characterize graphs in which the above property holds in a hereditary sense. Our characterization is obtained by studying a new family of hypergraphs, defined similarly as the Sperner hypergraphs, which may be of independent interest.Comment: 19 pages, 1 figur

    An Empirical Study on Budget-Aware Online Kernel Algorithms for Streams of Graphs

    Full text link
    Kernel methods are considered an effective technique for on-line learning. Many approaches have been developed for compactly representing the dual solution of a kernel method when the problem imposes memory constraints. However, in literature no work is specifically tailored to streams of graphs. Motivated by the fact that the size of the feature space representation of many state-of-the-art graph kernels is relatively small and thus it is explicitly computable, we study whether executing kernel algorithms in the feature space can be more effective than the classical dual approach. We study three different algorithms and various strategies for managing the budget. Efficiency and efficacy of the proposed approaches are experimentally assessed on relatively large graph streams exhibiting concept drift. It turns out that, when strict memory budget constraints have to be enforced, working in feature space, given the current state of the art on graph kernels, is more than a viable alternative to dual approaches, both in terms of speed and classification performance.Comment: Author's version of the manuscript, to appear in Neurocomputing (ELSEVIER

    Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks

    Get PDF
    We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative. We compare our algorithms qualitatively and quantitatively with several previous approaches. In extensive simulations, we consider various models and scenarios. Although our algorithms use less information than most other approaches, they produce significantly better results. They are very robust against variations in node degree and do not rely on simplified assumptions of the communication model. Moreover, they are much easier to implement on real sensor nodes than most existing approaches.Comment: extended version of accepted submission to SEA 201

    CLIMATE POLICY WHEN THE DISTANT FUTURE MATTERS: CATASTROPHIC EVENTS WITH HYPERBOLIC DISCOUNTING

    Get PDF
    Low probability catastrophic climate change can have a signifcant influence on policy under hyperbolic discounting. We compare the set of Markov Perfect Equilibria (MPE) to the optimal policy under time-consistent commitment. For some initial levels of risk there are multiple MPE; these may involve either excessive or insufficient stabilization effort. These results imply that even if the free-rider problem amongst contemporaneous decision-makers were solved, there may remain a coordination problem amongst successive generations of decision-makers. A numerical example shows that under plausible conditions society should respond vigorously to the threat of climate change.abrupt climate change, event uncertainty, catastrophic risk, hyperbolic discounting, Markov Perfect Equilibria, Environmental Economics and Policy, C61, C73, D63, D99, Q54,
    corecore