We plan to investigate the asymptotics of discrete structures that are generated by sequential algorithms with random input. Further, we aim at extending the range of the probabilistic method in the field of Discrete Mathematics, specifically the use of Markov chains in the structural analysis of combinatorial families. Probabilistic compactifications and boundaries provide the common denominator and the main tool.
DFG Programme
Research Grants
