Analytic Approach to Guasirandomness

          @misc{ scivideos_22588,
            doi = {},
            url = {https://old.simons.berkeley.edu/node/22588},
            author = {},
            keywords = {},
            language = {en},
            title = {Analytic Approach to Guasirandomness},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2022},
            month = {sep},
            note = {22588 see, \url{https://scivideos.org/index.php/simons-institute/22588}}
          }
          

Abstract

Abstract A combinatorial structure is said to be quasirandom if it resembles a random structure in a certain robust sense. The notion of quasirandom graphs, developed in the work of Rödl, Thomason, Chung, Graham and Wilson in 1980s, is particularly robust as several different properties of truly random graphs, e.g., subgraph density, edge distribution and spectral properties, are satisfied by a large graph if and only if one of them is. We will discuss recent results on quasirandomness of various kinds of combinatorial structures (in particular, directed graphs, permutations and Latin squares) obtained using analytic tools provided by the theory of combinatorial limits.