Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
The diameter of a cycle plus a random matching
SIAM Journal on Discrete Mathematics
On read-once vs. multiple access to randomness in logspace
Theoretical Computer Science - Special issue on structure in complexity theory
Coloring random and semi-random k-colorable graphs
Journal of Algorithms
A tight upper bound on the cover time for random walks on graphs
Random Structures & Algorithms
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Algorithms for coloring semi-random graphs
Random Structures & Algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Finding and certifying a large hidden clique in a semirandom graph
Random Structures & Algorithms
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Heuristics for semirandom graph problems
Journal of Computer and System Sciences
How many random edges make a dense graph Hamiltonian?
Random Structures & Algorithms
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Combinatorics, Probability and Computing
Adding random edges to dense graphs
Random Structures & Algorithms
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On smoothed analysis in dense graphs and formulas
Random Structures & Algorithms
Decreasing the diameter of bounded degree graphs
Journal of Graph Theory
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
Communications of the ACM - A View of Parallel Computing
Smoothed Analysis of Balancing Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Complex contagion and the weakness of long ties in social networks: revisited
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
The central observation of this paper is that if εn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL-complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log-space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost-L then no heuristic can recognize similarly perturbed instances of (s,t)-connectivity. Property Testing: A digraph is called k-linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k-linked digraphs is NP-complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k-linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k-linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007