2,459 research outputs found
Cover Time and Broadcast Time
We introduce a new technique for bounding the cover time of random walks by relating it to the runtime of randomized broadcast. In particular, we strongly confirm for dense graphs the intuition of Chandra et al. (1997) that ``the cover time of the graph is an appropriate metric for the performance of certain kinds of randomized broadcast algorithms\u27\u27. In more detail, our results are as follows:
begin{itemize}
item For any graph of size and minimum degree , we have , where denotes the quotient of the cover time and broadcast time. This bound is tight for binary trees and tight up to logarithmic factors for many graphs including hypercubes, expanders and lollipop graphs.
item For any -regular (or almost -regular) graph it holds that . Together with our upper bound on , this lower bound strongly confirms the intuition of Chandra et al.~for graphs with minimum degree , since then the cover time equals the broadcast time multiplied by (neglecting logarithmic factors).
item Conversely, for any we construct almost -regular graphs that satisfy . Since any regular expander satisfies , the strong relationship given above does not hold if is polynomially smaller than .
end{itemize}
Our bounds also demonstrate that the relationship between cover time and broadcast time is much stronger than the known relationships between any of them and the mixing time (or the closely related spectral gap)
The coalescing-branching random walk on expanders and the dual epidemic process
Information propagation on graphs is a fundamental topic in distributed
computing. One of the simplest models of information propagation is the push
protocol in which at each round each agent independently pushes the current
knowledge to a random neighbour. In this paper we study the so-called
coalescing-branching random walk (COBRA), in which each vertex pushes the
information to randomly selected neighbours and then stops passing
information until it receives the information again. The aim of COBRA is to
propagate information fast but with a limited number of transmissions per
vertex per step. In this paper we study the cover time of the COBRA process
defined as the minimum time until each vertex has received the information at
least once. Our main result says that if is an -vertex -regular graph
whose transition matrix has second eigenvalue , then the COBRA cover
time of is , if is greater than a positive
constant, and , if . These bounds are independent of and hold for . They improve the previous bound of for expander graphs.
Our main tool in analysing the COBRA process is a novel duality relation
between this process and a discrete epidemic process, which we call a biased
infection with persistent source (BIPS). A fixed vertex is the source of an
infection and remains permanently infected. At each step each vertex other
than selects neighbours, independently and uniformly, and is
infected in this step if and only if at least one of the selected neighbours
has been infected in the previous step. We show the duality between COBRA and
BIPS which says that the time to infect the whole graph in the BIPS process is
of the same order as the cover time of the COBRA proces
Towards Resistance Sparsifiers
We study resistance sparsification of graphs, in which the goal is to find a
sparse subgraph (with reweighted edges) that approximately preserves the
effective resistances between every pair of nodes. We show that every dense
regular expander admits a -resistance sparsifier of size , and conjecture this bound holds for all graphs on nodes. In
comparison, spectral sparsification is a strictly stronger notion and requires
edges even on the complete graph.
Our approach leads to the following structural question on graphs: Does every
dense regular expander contain a sparse regular expander as a subgraph? Our
main technical contribution, which may of independent interest, is a positive
answer to this question in a certain setting of parameters. Combining this with
a recent result of von Luxburg, Radl, and Hein~(JMLR, 2014) leads to the
aforementioned resistance sparsifiers
Linear-time list recovery of high-rate expander codes
We show that expander codes, when properly instantiated, are high-rate list
recoverable codes with linear-time list recovery algorithms. List recoverable
codes have been useful recently in constructing efficiently list-decodable
codes, as well as explicit constructions of matrices for compressive sensing
and group testing. Previous list recoverable codes with linear-time decoding
algorithms have all had rate at most 1/2; in contrast, our codes can have rate
for any . We can plug our high-rate codes into a
construction of Meir (2014) to obtain linear-time list recoverable codes of
arbitrary rates, which approach the optimal trade-off between the number of
non-trivial lists provided and the rate of the code. While list-recovery is
interesting on its own, our primary motivation is applications to
list-decoding. A slight strengthening of our result would implies linear-time
and optimally list-decodable codes for all rates, and our work is a step in the
direction of solving this important problem
Towards a better approximation for sparsest cut?
We give a new -approximation for sparsest cut problem on graphs
where small sets expand significantly more than the sparsest cut (sets of size
expand by a factor bigger, for some small ; this
condition holds for many natural graph families). We give two different
algorithms. One involves Guruswami-Sinop rounding on the level- Lasserre
relaxation. The other is combinatorial and involves a new notion called {\em
Small Set Expander Flows} (inspired by the {\em expander flows} of ARV) which
we show exists in the input graph. Both algorithms run in time . We also show similar approximation algorithms in graphs with
genus with an analogous local expansion condition. This is the first
algorithm we know of that achieves -approximation on such general
family of graphs
Derandomization and Group Testing
The rapid development of derandomization theory, which is a fundamental area
in theoretical computer science, has recently led to many surprising
applications outside its initial intention. We will review some recent such
developments related to combinatorial group testing. In its most basic setting,
the aim of group testing is to identify a set of "positive" individuals in a
population of items by taking groups of items and asking whether there is a
positive in each group.
In particular, we will discuss explicit constructions of optimal or
nearly-optimal group testing schemes using "randomness-conducting" functions.
Among such developments are constructions of error-correcting group testing
schemes using randomness extractors and condensers, as well as threshold group
testing schemes from lossless condensers.Comment: Invited Paper in Proceedings of 48th Annual Allerton Conference on
Communication, Control, and Computing, 201
On Fortification of Projection Games
A recent result of Moshkovitz \cite{Moshkovitz14} presented an ingenious
method to provide a completely elementary proof of the Parallel Repetition
Theorem for certain projection games via a construction called fortification.
However, the construction used in \cite{Moshkovitz14} to fortify arbitrary
label cover instances using an arbitrary extractor is insufficient to prove
parallel repetition. In this paper, we provide a fix by using a stronger graph
that we call fortifiers. Fortifiers are graphs that have both and
guarantees on induced distributions from large subsets. We then show
that an expander with sufficient spectral gap, or a bi-regular extractor with
stronger parameters (the latter is also the construction used in an independent
update \cite{Moshkovitz15} of \cite{Moshkovitz14} with an alternate argument),
is a good fortifier. We also show that using a fortifier (in particular
guarantees) is necessary for obtaining the robustness required for
fortification.Comment: 19 page
- …