Markov Chains Based on Random Generalized 1-Flipper Operations for Connected Regular Multi-digraphs

O157; The properties of generalized flip Markov chains on connected regular digraphs are discussed.The 1-Flipper operation on Markov chains for undirected graphs is generalized to that for multi-digraphs.The generalized 1-Flipper operation preserves the regularity and weak connectivity of multi-digr...

Full description

Saved in:
Bibliographic Details
Published in东华大学学报（英文版） Vol. 40; no. 1; pp. 110 - 115
Main Authors DENG Aiping, WU Chenchen, WANG Fengjie, HU Yuting
Format Journal Article
LanguageEnglish
Published College of Science,Donghua University,Shanghai 201620,China 2023
Subjects
random graph transformation
Markov chain
triangle reverse
1-Flipper
regular multi-digraph
Online AccessGet full text

Cover

More Information
Summary:O157; The properties of generalized flip Markov chains on connected regular digraphs are discussed.The 1-Flipper operation on Markov chains for undirected graphs is generalized to that for multi-digraphs.The generalized 1-Flipper operation preserves the regularity and weak connectivity of multi-digraphs.The generalized 1-Flipper operation is proved to be symmetric.Moreover,it is presented that a series of random generalized 1-Flipper operations eventually lead to a uniform probability distribution over all connected d-regular multi-digraphs without loops.
ISSN:1672-5220
DOI:10.19884/j.1672-5220.202108003