Sign inSign in
ConceptMathematics

Non-backtracking walk

A walk on a graph in which no edge is immediately followed by its reverse edge.
as Jenya Sapir defines itUC BerkeleyThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Graph theory2Adjacency matrix1Hyperedge1Hypergraph1Vertex1Walk in a graph1

Lecturers

4

Each in their own terms, from the easiest level.

  • Yizhe Zhu

    UC Berkeley · Research

    A walk on a hypergraph that moves from a vertex to a hyperedge and then to a different vertex in that hyperedge, without immediately returning to the previous hyperedge.
    • 40:00Community detection with the Bethe-Hessian
  • Sebastian Cioaba

    UC Berkeley · Research

    A walk in a graph where no edge is immediately traversed back to the vertex it just came from.
    • 23:12Maximizing algebraic connectivity for graphs of given order and size.
  • Tobias Weich

    Paderborn University · Research

    A walk on a graph that does not allow immediate reversals of edges.
    • 40:00Resonances on Geometrically Finite Graphs and Buildings

Connections

7

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.