Tangled paths: a random graph model from Mallows permutations (extended abstract)

DOI10.5817/CZ.MUNI.EUROCOMB23-057MaRDI QIDQ7000317zbMATH OpenFDO

Authors Jessica Enright, Kitty Meeks, William Pettersson, John Sylvester

Publication date 8 April 2025

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-057

zbMATH Keywords

cutwidthrandom graph modeltreewidthvertex isoperimetric number

Mathematics Subject Classification ID

Paths and cycles (05C38) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• A Separator Theorem for Planar Graphs
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general \(p\)-shifted distributions
• Every monotone graph property has a sharp threshold
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Lengths of monotone subsequences in a Mallows permutation
• Mallows permutations and finite dependence
• NON-NULL RANKING MODELS. I
• On the cycle structure of Mallows permutations
• On the ordered conjecture
• Parameterized algorithms
• Permutations avoiding a pattern of length three under Mallows distributions
• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
• Rank-width of random graphs
• Sparsity. Graphs, structures, and algorithms
• Treewidth. Computations and approximations

Cited in

(1)

• Tangled paths: a random graph model from Mallows permutations

This page was built for publication: Tangled paths: a random graph model from Mallows permutations (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000317)