Tangled Paths: A Random Graph Model from Mallows Permutations.

We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with real parameter $0

Keywords:

• Vertex (geometry)
• Mathematics
• Permutation
• Treewidth
• Graph (abstract data type)
• Combinatorics
• Random graph
• Path (graph theory)

• Correction
• Source
• Cite
• Save
• Machine Reading By IdeaReader