The expected genus of a random chord diagram

DOI10.1007/s00454-010-9276-xzbMath1209.05066arXiv0904.4361OpenAlexW2164894487MaRDI QIDQ629824

Nathan Linial, Tahl Nowik

Publication date: 10 March 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.4361

zbMATH Keywords

genusrandom graphcurves in surfacesoriented surfaceGauss codeoriented chord diagram

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Another proof of the Harer-Zagier formula ⋮ Formation of a giant component in the intersection graph of a random chord diagram ⋮ On a uniformly random chord diagram and its intersection graph ⋮ Random surfaces with boundary ⋮ A lower bound on the average genus of a 2-bridge knot ⋮ Random colorings in manifolds ⋮ On a surface formed by randomly gluing together polygonal discs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homological connectivity of random 2-complexes
• Finite covers of random 3-manifolds
• Classification of knot projections
• The cycle structure of random permutations
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• The Euler characteristic of the moduli space of curves
• Curves on surfaces, charts, and words
• The fundamental group of random 2-complexes
• Homological connectivity of random k -dimensional complexes
• Classifying Immersed Curves
• THE PLANARITY PROBLEM FOR SIGNED GAUSS WORDS
• THE PLANARITY PROBLEM II
• A proof of Vassiliev's conjecture on the planarity of singular links
• Topological characteristics of random triangulated surfaces

This page was built for publication: The expected genus of a random chord diagram