全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Sensitivity of Mixing Times of the Eulerian Functional Digraphs of the Full Transformation Semigroup Tn

DOI: 10.4236/ojdm.2026.163003, PP. 19-36

Keywords: Full Transformation Semigroup, Functional Digraph, Eulerian Digraph, Lazy Random Walk, Mixing Time, Sensitivity, Spectral Profile, Exploration Time, Three-Distance Theorem

Full-Text   Cite this paper   Add to My Lib

Abstract:

Let X n ={ 1,2,?,n } and let T n denote the full transformation semigroup of all n n maps α: X n → X n . Each α∈ T n induces a functional digraph Γ α whose vertex set is X n and whose arc set is { ( x,α( x ) ):x∈ X n } . Because every vertex has out-degree exactly one, Γ α belongs to the class of functional (mapping) digraphs. The Eulerian members of this class are precisely the functional digraphs induced by permutations α∈ S n ? T n : there are n! Eulerian functional digraphs on X n , and their isomorphism classes are in bijection with the integer partitions of n . A functional

References

[1]  Mazorchuk, V. and Ganyushkin, O. (2009) Classical Finite Transformation Semigroups: An Introduction. Algebra and Applications, Vol. 9. Springer.
[2]  Ugbene, I.J., Bakare, G.N. and Ibrahim, G.R. (2019) Conjugacy Classes of the Order-Preserving and Order-Decreasing Partial One-to-One Transformation Semigroups. FUTMINA.
[3]  Ugbene, I.J. and Makanjuola, S.O. (2012) On the Number of Conjugacy Classes in the Injective Order-Preserving Transformation Semigroup. Icastor Journal of Mathematical Sciences, 6, No. 1.
[4]  Ugbene, I.J., Makanjuola, S.O. and Eze, E.O. (2013) On the Number of Conjugacy Classes in the Injective Order-Decreasing Transformation Semigroup. Pacific Journal of Science and Technology, 14, 182-186.
[5]  Ugbene, I.J. and Mbah, M.A. (2015) On the Combinatorial Properties of Nilpotent and Idempotent Conjugacy Classes of the Injective Order-Decreasing Transformation Semigroup. FULafia Journal of Science and Technology, 1, 91-94.
[6]  Ugbene, I.J. (2025) On the Combinatorial Results of the Labelled Rooted Trees of Some Subsemigroups of the Full Contraction Transformations. Scientia Africana, 24, 61-68.
https://doi.org/10.4314/sa.v24i2.7
[7]  Ugbene, I.J. and Utoyo, T.O. (2025) Combinatorial Properties of the Labelled Rooted Trees of the Functional Digraph of the Identity Difference Full Transformation Semigroups. Scientia Africana, 24, 43-50.
https://doi.org/10.4314/sa.v24i2.5
[8]  Harris, B. (1960) Probability Distributions Related to Random Mappings. The Annals of Mathematical Statistics, 31, 1045-1062.
https://doi.org/10.1214/aoms/1177705677
[9]  Harary, F. (1959) The Number of Functional Digraphs. Mathematische Annalen, 138, 203-210.
https://doi.org/10.1007/bf01342903
[10]  Howie, J.M. (1966) The Subsemigroup Generated by the Idempotents of a Full Transformation Semigroup. Journal of the London Mathematical Society, 1, 707-716.
https://doi.org/10.1112/jlms/s1-41.1.707
[11]  Howie, J.M. (1978) Idempotent Generators in Finite Full Transformation Semigroups. Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 81, 317-323.
https://doi.org/10.1017/s0308210500010647
[12]  Jeff, U.I., Suraju, O.O. and Ugochukwu, N.R. (2022) Digraph of the Full Transformation Semigroup. Journal of Discrete Mathematical Sciences and Cryptography, 25, 2457-2465.
https://doi.org/10.1080/09720529.2020.1862955
[13]  East, J., Gadouleau, M. and Mitchell, J.D. (2019) Structural Aspects of Semigroups Based on Digraphs. Algebraic Combinatorics, 2, 711-733.
https://doi.org/10.5802/alco.56
[14]  Yang, X. and Yang, H. (2006) Maximal Regular Subsemibands of Singn. Semigroup Forum, 72, 75-93.
https://doi.org/10.1007/s00233-005-0103-2
[15]  Yang, X. and Yang, H. (2009) Isomorphisms of Transformation Semigroups Associated with Simple Digraphs. Asian-European Journal of Mathematics, 2, 727-737.
https://doi.org/10.1142/s1793557109000601
[16]  Wright, S.E. (2007) Lengths of Paths and Cycles in Zero-Divisor Graphs and Digraphs of Semigroups. Communications in Algebra, 35, 1987-1991.
https://doi.org/10.1080/00927870701247146
[17]  Aldous, D. and Fill, J. (2002) Reversible Markov Chains and Random Walks on Graphs. Monograph in Preparation.
http://www.stat.berkeley.edu/~aldous/RWG/book.html
[18]  Chartrand, G. and Lesniak, L. (2016) Graphs and Digraphs. 6th Edition, Wadsworth and Brooks/Cole.
[19]  Kahn, J.D., Linial, N., Nisan, N. and Saks, M.E. (1989) On the Cover Time of Random Walks on Graphs. Journal of Theoretical Probability, 2, 121-128.
https://doi.org/10.1007/bf01048274
[20]  Katz, L. (1955) Probability of Indecomposability of a Random Mapping Function. The Annals of Mathematical Statistics, 26, 512-517.
https://doi.org/10.1214/aoms/1177728496
[21]  Kuipers, L. and Niederreiter, H. (1974) Uniform Distribution of Sequences. Pure and Applied Mathematics. Wiley.
[22]  Petrov, V.V. (1975) Sums of Independent Random Variables. Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 82. Springer.
[23]  Boczkowski, L., Peres, Y. and Sousi, P. (2018) Sensitivity of Mixing Times in Eulerian Digraphs. SIAM Journal on Discrete Mathematics, 32, 624-655.
https://doi.org/10.1137/16m1073376
[24]  Montenegro, R. and Tetali, P. (2006) Mathematical Aspects of Mixing Times in Markov Chains. Foundations and Trends? in Theoretical Computer Science, 1, 237-354.
https://doi.org/10.1561/0400000003
[25]  Barnes, G. and Feige, U. (1993) Short Random Walks on Graphs. Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, 16-18 May 1993, 728-737.
https://doi.org/10.1145/167088.167275
[26]  Peres, Y. and Sousi, P. (2015) Mixing Times Are Hitting Times of Large Sets. Journal of Theoretical Probability, 28, 488-519.
https://doi.org/10.1007/s10959-013-0497-9
[27]  Shang, Y. (2013) Lower Bounds for the Estrada Index Using Mixing Time and Laplacian Spectrum. Rocky Mountain Journal of Mathematics, 43, 2009-2016.
https://doi.org/10.1216/rmj-2013-43-6-2009
[28]  Ganie, H.A., Ingole, A., Deshmukh, U. and Shang, Y. (2024) On the Skew Characteristics Polynomial/Eigenvalues of Operations on Bipartite Oriented Graphs and Applications. Research in Mathematics, 11, Article ID: 2313343.
https://doi.org/10.1080/27684830.2024.2313343
[29]  Levin, D.A. and Peres, Y. (2017). Markov Chains and Mixing Times. 2nd Edition, American Mathematical Society.
https://doi.org/10.1090/mbk/107
[30]  Goel, S., Montenegro, R. and Tetali, P. (2006) Mixing Time Bounds via the Spectral Profile. Electronic Journal of Probability, 11, 1-26.
https://doi.org/10.1214/ejp.v11-300
[31]  Lawler, G.F. and Limic, V. (2010). Random Walk: A Modern Introduction. Cambridge Studies in Advanced Mathematics, Vol. 123. Cambridge University Press.
https://doi.org/10.1017/cbo9780511750854

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133