Use this URL to cite or link to this record in EThOS:
Title: Limit structures and property testing
Author: Klimošová, Tereza
ISNI:       0000 0004 5923 7504
Awarding Body: University of Warwick
Current Institution: University of Warwick
Date of Award: 2015
Availability of Full Text:
Access from EThOS:
Access from Institution:
In the thesis, we study properties of large combinatorial objects. We analyze these objects from two different points of view. The first aspect is analytic - we study properties of limit objects of combinatorial structures. We investigate when graphons (limits of graphs) and permutons (limits of permutations) are finitely forcible, i.e., when they are uniquely determined by finitely many densities of their substructures. We give examples of families of permutons that are finitely forcible but the associated graphons are not and we disprove a conjecture of Lovasz and Szegedy on the dimension of the space of typical vertices of a finitely forcible graphon. In particular, we show that there exists a finitely forcible graphon W such that the topological spaces T(W) and T(W) have infinite Lebesgue covering dimension. We also study the dependence between densities of substructures. We prove a permutation analogue of the classical theorem of Erdos, Lovasz and Spencer on the densities of connected subgraphs in large graphs. The second aspect of large combinatorial objects we concentrate on is algorithmic|we study property testing and parameter testing. We show that there exists a bounded testable permutation parameter that is not finitely forcible and that every hereditary permutation property is testable (in constant time) with respect to the Kendall's tau distance, resolving a conjecture of Kohayakawa.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA Mathematics