607 research outputs found
Pseudorandom Generators for Width-3 Branching Programs
We construct pseudorandom generators of seed length that -fool ordered read-once branching programs
(ROBPs) of width and length . For unordered ROBPs, we construct
pseudorandom generators with seed length . This is the first improvement for pseudorandom
generators fooling width ROBPs since the work of Nisan [Combinatorica,
1992].
Our constructions are based on the `iterated milder restrictions' approach of
Gopalan et al. [FOCS, 2012] (which further extends the Ajtai-Wigderson
framework [FOCS, 1985]), combined with the INW-generator [STOC, 1994] at the
last step (as analyzed by Braverman et al. [SICOMP, 2014]). For the unordered
case, we combine iterated milder restrictions with the generator of
Chattopadhyay et al. [CCC, 2018].
Two conceptual ideas that play an important role in our analysis are: (1) A
relabeling technique allowing us to analyze a relabeled version of the given
branching program, which turns out to be much easier. (2) Treating the number
of colliding layers in a branching program as a progress measure and showing
that it reduces significantly under pseudorandom restrictions.
In addition, we achieve nearly optimal seed-length
for the classes of: (1) read-once polynomials on
variables, (2) locally-monotone ROBPs of length and width
(generalizing read-once CNFs and DNFs), and (3) constant-width ROBPs of length
having a layer of width in every consecutive
layers.Comment: 51 page
Quicksort with unreliable comparisons: a probabilistic analysis
We provide a probabilistic analysis of the output of Quicksort when
comparisons can err.Comment: 29 pages, 3 figure
Area Decay Law Implementation for Quark String Fragmentation
We apply the Area Decay Law (ADL) straightforwardly to simulate a quark
string hadronization and compare the results with the explicit analytic
calculations. We show that the usual "inclusive" Monte--Carlo simulations do
not correspond to the ADL because of two mistakes: not proper simulation of
two--dimensional probability density and lack of an important combinatorial
factor in a binary tree simulation. We also show how to simulate area decay law
"inclusively" avoiding the above--mentioned mistakes.Comment: 5 pages (REVTEX) + 3 figures (available in ps format from
G.G.Leptoukh , IPGAS-HE/93-3, to be
published in Phys. Rev.
Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
We report on some recent developments in the search for optimal network
topologies. First we review some basic concepts on spectral graph theory,
including adjacency and Laplacian matrices, and paying special attention to the
topological implications of having large spectral gaps. We also introduce
related concepts as ``expanders'', Ramanujan, and Cage graphs. Afterwards, we
discuss two different dynamical feautures of networks: synchronizability and
flow of random walkers and so that they are optimized if the corresponding
Laplacian matrix have a large spectral gap. From this, we show, by developing a
numerical optimization algorithm that maximum synchronizability and fast random
walk spreading are obtained for a particular type of extremely homogeneous
regular networks, with long loops and poor modular structure, that we call
entangled networks. These turn out to be related to Ramanujan and Cage graphs.
We argue also that these graphs are very good finite-size approximations to
Bethe lattices, and provide almost or almost optimal solutions to many other
problems as, for instance, searchability in the presence of congestion or
performance of neural networks. Finally, we study how these results are
modified when studying dynamical processes controlled by a normalized (weighted
and directed) dynamics; much more heterogeneous graphs are optimal in this
case. Finally, a critical discussion of the limitations and possible extensions
of this work is presented.Comment: 17 pages. 11 figures. Small corrections and a new reference. Accepted
for pub. in JSTA
A Match in Time Saves Nine: Deterministic Online Matching With Delays
We consider the problem of online Min-cost Perfect Matching with Delays
(MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number
of requests appear in a metric space at different times and the goal of an
online algorithm is to match them in pairs. In contrast to traditional online
matching problems, in MPMD all requests appear online and an algorithm can
match any pair of requests, but such decision may be delayed (e.g., to find a
better match). The cost is the sum of matching distances and the introduced
delays.
We present the first deterministic online algorithm for this problem. Its
competitive ratio is , where is the
number of requests. This is polynomial in the number of metric space points if
all requests are given at different points. In particular, the bound does not
depend on other parameters of the metric, such as its aspect ratio. Unlike
previous (randomized) solutions for the MPMD problem, our algorithm does not
need to know the metric space in advance
Active bacterial core surveillance of the emerging infections program network.
Active Bacterial Core surveillance (ABCs) is a collaboration between the Centers for Disease Control and Prevention and several state health departments and universities participating in the Emerging Infections Program Network. ABCs conducts population-based active surveillance, collects isolates, and performs studies of invasive disease caused by Streptococcus pneumoniae, group A and group B Streptococcus, Neisseria meningitidis, and Haemophilus influenzae for a population of 17 to 30 million. These pathogens caused an estimated 97,000 invasive cases, resulting in 10,000 deaths in the United States in 1998. Incidence rates of these pathogens are described. During 1998, 25% of invasive pneumococcal infections in ABCs areas were not susceptible to penicillin, and 13.3% were not susceptible to three classes of antibiotics. In 1998, early-onset group B streptococcal disease had declined by 65% over the previous 6 years. More information on ABCs is available at www.cdc.gov/ncidod/dbmd/abcs. ABCs specimens will soon be available to researchers through an archive
Nonlinear spectral calculus and super-expanders
Nonlinear spectral gaps with respect to uniformly convex normed spaces are
shown to satisfy a spectral calculus inequality that establishes their decay
along Cesaro averages. Nonlinear spectral gaps of graphs are also shown to
behave sub-multiplicatively under zigzag products. These results yield a
combinatorial construction of super-expanders, i.e., a sequence of 3-regular
graphs that does not admit a coarse embedding into any uniformly convex normed
space.Comment: Typos fixed based on referee comments. Some of the results of this
paper were announced in arXiv:0910.2041. The corresponding parts of
arXiv:0910.2041 are subsumed by the current pape
- âŠ