Uniform sampling ofk-hypertournaments
From MaRDI portal
Publication:4908164
DOI10.1080/03081087.2012.664771zbMath1259.05071OpenAlexW2074279874MaRDI QIDQ4908164
Koko K. Kayibi, Muhammad A. Khan, Shariefuddin Pirzada
Publication date: 4 March 2013
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2012.664771
random walkmixing timeergodic Markov chainswitchinghypertournamentscore sequence\(k\)-hypertournament matrixlosing score sequenceswitchable configuration
Monte Carlo methods (65C05) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Regular Hypertournaments and Arc-Pancyclicity ⋮ On the scores and degrees in hypertournaments ⋮ On scores in tournaments ⋮ Miscellaneous Digraph Classes ⋮ Symmetry in domination for hypergraphs with choice ⋮ On scores, losing scores and total scores in hypertournaments ⋮ On imbalances in multipartite multidigraphs
Cites Work
- Unnamed Item
- Matrices of zeros and ones with fixed row and column sum vectors
- Tournament matrices with extremal spectral properties
- On \(k\)-hypertournament matrices
- On score sequences of \(k\)-hypertournaments
- Asymptotic enumeration of tournaments with a given score sequence
- The structure matrix and a generalization of Ryser's maximum term rank formula
- Markov Chain Algorithms for Planar Lattice Structures
- Tournament matrices and their generalizations, I.
- Approximating the Permanent
- Hypertournament matrices, score vectors and eigenvalues
- Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph
- On Generalized Tournament Matrices
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Uniform sampling ofk-hypertournaments
