Undirected ST-connectivity in log-space

Reingold, Omer

doi:10.1145/1060590.1060647

Cited by 226 publications

(183 citation statements)

References 49 publications

Supporting

Mentioning

181

Contrasting

Unclassified

Order By: Relevance

“…This has, indeed, been tried often (see [Rei05] for background). A key to the success of Reingold's approach was an ingenious application of the zig-zag product.…”

Section: Introduction As In Earlier Sections We Consider An (N D)-gmentioning

confidence: 99%

See 1 more Smart Citation

Expander graphs and their applications

Hoory

Linial

2006

Bull. Amer. Math. Soc.

1,509

1,355

View full text Add to dashboard Cite

A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up in numerous and often surprising contexts in both fields.But, perhaps, we should start with a few words about graphs in general. They are, of course, one of the prime objects of study in Discrete Mathematics. However, graphs are among the most ubiquitous models of both natural and human-made structures. In the natural and social sciences they model relations among species, societies, companies, etc. In computer science, they represent networks of communication, data organization, computational devices as well as the flow of computation, and more. In mathematics, Cayley graphs are useful in Group Theory. Graphs carry a natural metric and are therefore useful in Geometry, and though they are "just" one-dimensional complexes, they are useful in certain parts of Topology, e.g. Knot Theory. In statistical physics, graphs can represent local connections between interacting parts of a system, as well as the dynamics of a physical process on such systems.The study of these models calls, then, for the comprehension of the significant structural properties of the relevant graphs. But are there nontrivial structural properties which are universally important? Expansion of a graph requires that it is simultaneously sparse and highly connected. Expander graphs were first defined by Bassalygo and Pinsker, and their existence first proved by Pinsker in the early '70s. The property of being an expander seems significant in many of these mathematical, computational and physical contexts. It is not surprising that expanders are useful in the design and analysis of communication networks. What is less obvious is that expanders have surprising utility in other computational settings such as in the theory of error correcting codes and the theory of pseudorandomness. In mathematics, we will encounter e.g. their role in the study of metric embeddings, and in particular in work around the Baum-Connes Conjecture. Expansion is closely related to the convergence rates of Markov Chains, and so they play a key role in the study of Monte-Carlo algorithms in statistical mechanics and in a host of practical computational applications. The list of such interesting and fruitful connections goes on and on with so many applications we will not even be able to mention. This universality of expanders is becoming more evident as more connections are discovered. It transpires that expansion is a fundamental mathematical concept, well deserving to be thoroughly investigated on its own.In hindsight, one reason that expanders are so ubiquitous is that their very definition can be given in at least three languages: combinatorial/geometric, probabilistic and algebraic. Combinatorially, expanders are graphs which are highly connected; to disconnect a large part of the graph, one has to sever many edges. Equivalently, using the geometric notion of isoperimetry, every s...

show abstract

“…This has, indeed, been tried often (see [Rei05] for background). A key to the success of Reingold's approach was an ingenious application of the zig-zag product.…”

Section: Introduction As In Earlier Sections We Consider An (N D)-gmentioning

confidence: 99%

“…This requires a clever construction of an appropriate data structure. We skip the proof of this claim and refer the reader to Reingold's paper [Rei05].…”

Section: Introduction As In Earlier Sections We Consider An (N D)-gmentioning

confidence: 99%

Expander graphs and their applications

Hoory

Linial

2006

Bull. Amer. Math. Soc.

1,509

1,355

View full text Add to dashboard Cite

show abstract

“…It is well known that REACH is complete for NL, and REACH d and REACH u are complete for L [10,19]. A simpler way to express deterministic transitive closure is to syntactically require that the out-degree of our graph is at most one by using a function symbol: denote the child of v as f (v), with f (v) = v if v has no outgoing edges.…”

Section: Transitive Closure Operatorsmentioning

confidence: 99%

“…We do some minimal processing on this code, disambiguating names and turning function symbols into relations. The user's input for directed-graph reachability, listed in Equation (8), is translated into the input query block of lines [19][20][21][22]. Similarly, the output query is translated into lines 25-28.…”

Section: The Searching Processmentioning

confidence: 99%

Finding Reductions Automatically

Crouch

Immerman

Moss

2010

Fields of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…This fact was exploited for example in [1], [5] and [13], in the study of space efficient algorithms for S − T connectivity in undirected graphs. Another well known example is the conservation of random bits in the amplification of randomized algorithms (we will elaborate on this point later on).…”

Section: Background and Definitionsmentioning

confidence: 99%

Poisson approximation for non-backtracking random walks

Alon

Lubetzky

2009

Isr. J. Math.

View full text Add to dashboard Cite

Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method of sampling the vertices of a graph. The authors of [2] studied non-backtracking random walks on regular graphs, and showed that their mixing rate may be up to twice as fast as that of the simple random walk. As an application, they showed that the maximal number of visits to a vertex, made by a non-backtracking random walk of length n on a high-girth n-vertex regular expander, is typically (1 + o(1)) log n log log n , as in the case of the balls and bins experiment. They further asked whether one can establish the precise distribution of the visits such a walk makes.In this work, we answer the above question by combining a generalized form of Brun's sieve with some extensions of the ideas in [2]. Let N t denote the number of vertices visited precisely t times by a non-backtracking random walk of length n on a regular n-vertex expander of fixed degree and girth g. We prove that if g = ω(1), then for any fixed t, N t /n is typically 1 et! + o(1). Furthermore, if g = Ω(log log n), then N t /n is typically 1+o (1) et! uniformly on all t ≤ (1 − o(1)) log n log log n and 0 for all t ≥ (1 + o(1)) log n log log n . In particular, we obtain the above result on the typical maximal number of visits to a single vertex, with an improved threshold window. The essence of the proof lies in showing that variables counting the number of visits to a set of sufficiently distant vertices are asymptotically independent Poisson variables.

show abstract

Undirected ST-connectivity in log-space

Cited by 226 publications

References 49 publications

Expander graphs and their applications

Expander graphs and their applications

Finding Reductions Automatically

Poisson approximation for non-backtracking random walks

Contact Info

Product

Resources

About