20,494 research outputs found
Sampling of graph signals via randomized local aggregations
Sampling of signals defined over the nodes of a graph is one of the crucial
problems in graph signal processing. While in classical signal processing
sampling is a well defined operation, when we consider a graph signal many new
challenges arise and defining an efficient sampling strategy is not
straightforward. Recently, several works have addressed this problem. The most
common techniques select a subset of nodes to reconstruct the entire signal.
However, such methods often require the knowledge of the signal support and the
computation of the sparsity basis before sampling. Instead, in this paper we
propose a new approach to this issue. We introduce a novel technique that
combines localized sampling with compressed sensing. We first choose a subset
of nodes and then, for each node of the subset, we compute random linear
combinations of signal coefficients localized at the node itself and its
neighborhood. The proposed method provides theoretical guarantees in terms of
reconstruction and stability to noise for any graph and any orthonormal basis,
even when the support is not known.Comment: IEEE Transactions on Signal and Information Processing over Networks,
201
On Derandomizing Local Distributed Algorithms
The gap between the known randomized and deterministic local distributed
algorithms underlies arguably the most fundamental and central open question in
distributed graph algorithms. In this paper, we develop a generic and clean
recipe for derandomizing LOCAL algorithms. We also exhibit how this simple
recipe leads to significant improvements on a number of problem. Two main
results are:
- An improved distributed hypergraph maximal matching algorithm, improving on
Fischer, Ghaffari, and Kuhn [FOCS'17], and giving improved algorithms for
edge-coloring, maximum matching approximation, and low out-degree edge
orientation. The first gives an improved algorithm for Open Problem 11.4 of the
book of Barenboim and Elkin, and the last gives the first positive resolution
of their Open Problem 11.10.
- An improved distributed algorithm for the Lov\'{a}sz Local Lemma, which
gets closer to a conjecture of Chang and Pettie [FOCS'17], and moreover leads
to improved distributed algorithms for problems such as defective coloring and
-SAT.Comment: 37 page
Control of complex networks requires both structure and dynamics
The study of network structure has uncovered signatures of the organization
of complex systems. However, there is also a need to understand how to control
them; for example, identifying strategies to revert a diseased cell to a
healthy state, or a mature cell to a pluripotent state. Two recent
methodologies suggest that the controllability of complex systems can be
predicted solely from the graph of interactions between variables, without
considering their dynamics: structural controllability and minimum dominating
sets. We demonstrate that such structure-only methods fail to characterize
controllability when dynamics are introduced. We study Boolean network
ensembles of network motifs as well as three models of biochemical regulation:
the segment polarity network in Drosophila melanogaster, the cell cycle of
budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in
Arabidopsis thaliana. We demonstrate that structure-only methods both
undershoot and overshoot the number and which sets of critical variables best
control the dynamics of these models, highlighting the importance of the actual
system dynamics in determining control. Our analysis further shows that the
logic of automata transition functions, namely how canalizing they are, plays
an important role in the extent to which structure predicts dynamics.Comment: 15 pages, 6 figure
- …