معرفی
Istvan Miklos is a Professor in the Department of Stochastics at the Hungarian Academy of Sciences' Rényi Institute. He teaches Combinatorics CO1 at Budapest Semesters in Mathematics and Stochastic models in bioinformatics at the Technical University of Budapest. His academic journey began with biology and chemistry studies at Eötvös Loránd University in 1992 before switching to mathematics in 1993, where he graduated in 1998 and completed his PhD on Statistical Sequence Alignment.
His research spans computational complexity, bioinformatics, and combinatorial mathematics, with particular focus on counting and sampling problems, Markov chain mixing, and applications to biological systems including genome rearrangement and network analysis. His work bridges theoretical computer science with practical biological applications, exploring the intersection of #P-complete and FPRAS complexity classes.
Analysis of his recent publications (2019-2025) reveals consistent work in graph theory, hypergraph construction, degree sequence realization, and Markov chain Monte Carlo methods. His research demonstrates strong interdisciplinary connections between theoretical computer science, discrete mathematics, and biological applications, with particular emphasis on developing efficient sampling algorithms for complex combinatorial structures.
He has supervised numerous graduate students including PhD candidates Imelda Somodi and Adrienn Szabó, and has mentored over a dozen undergraduate research students at Budapest Semesters in Mathematics who have published peer-reviewed papers with him since 2012.
Miklos maintains active research collaborations, as evidenced by his extensive publication record with co-authors including P.L. Erdős, T.R. Mezei, and L. Soukup. His work combines deep theoretical insights with practical applications in bioinformatics and computational biology.
