Limits, Regularity and Removal for Relational and Weighted Structures

The Szemeredi Regularity Lemma states that any graph can be well-approximated by graphs that are almost random. A well-known application of the Szemeredi Regularity Lemma is in the proof of the Removal Lemma for graphs. There are several extensions of the Regularity Lemma to hypergraphs. Our work bu...

Full description

Bibliographic Details
Main Author: Aroskar, Ashwini
Format: Others
Published: Research Showcase @ CMU 2012
Subjects:
Online Access:http://repository.cmu.edu/dissertations/144
http://repository.cmu.edu/cgi/viewcontent.cgi?article=1144&context=dissertations
id ndltd-cmu.edu-oai-repository.cmu.edu-dissertations-1144
record_format oai_dc
spelling ndltd-cmu.edu-oai-repository.cmu.edu-dissertations-11442014-07-24T15:35:47Z Limits, Regularity and Removal for Relational and Weighted Structures Aroskar, Ashwini The Szemeredi Regularity Lemma states that any graph can be well-approximated by graphs that are almost random. A well-known application of the Szemeredi Regularity Lemma is in the proof of the Removal Lemma for graphs. There are several extensions of the Regularity Lemma to hypergraphs. Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence between ultraproduct spaces and Euclidean spaces. We show the existence of a limit object for sequences of relational structures and as a special case, we retrieve the known limits for graphs and digraphs. We also state and prove a Regularity Lemma, a Removal Lemma and a Strong Removal Lemma for relational structures. The Strong Removal Lemma deals with the removal of a family of relational structures and has applications in property testing. We have also extended the above correspondence to measurable functions on the ultraproduct and Euclidean spaces. This enabled us to find limit objects for sequences of weighted structures and these can be seen as generalizations of the limits we have obtained for relational structures. We also formulate and prove Regularity and Removal Lemmas for weighted structures. 2012-05-01T07:00:00Z text application/pdf http://repository.cmu.edu/dissertations/144 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1144&context=dissertations Dissertations Research Showcase @ CMU Mathematics
collection NDLTD
format Others
sources NDLTD
topic Mathematics
spellingShingle Mathematics
Aroskar, Ashwini
Limits, Regularity and Removal for Relational and Weighted Structures
description The Szemeredi Regularity Lemma states that any graph can be well-approximated by graphs that are almost random. A well-known application of the Szemeredi Regularity Lemma is in the proof of the Removal Lemma for graphs. There are several extensions of the Regularity Lemma to hypergraphs. Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence between ultraproduct spaces and Euclidean spaces. We show the existence of a limit object for sequences of relational structures and as a special case, we retrieve the known limits for graphs and digraphs. We also state and prove a Regularity Lemma, a Removal Lemma and a Strong Removal Lemma for relational structures. The Strong Removal Lemma deals with the removal of a family of relational structures and has applications in property testing. We have also extended the above correspondence to measurable functions on the ultraproduct and Euclidean spaces. This enabled us to find limit objects for sequences of weighted structures and these can be seen as generalizations of the limits we have obtained for relational structures. We also formulate and prove Regularity and Removal Lemmas for weighted structures.
author Aroskar, Ashwini
author_facet Aroskar, Ashwini
author_sort Aroskar, Ashwini
title Limits, Regularity and Removal for Relational and Weighted Structures
title_short Limits, Regularity and Removal for Relational and Weighted Structures
title_full Limits, Regularity and Removal for Relational and Weighted Structures
title_fullStr Limits, Regularity and Removal for Relational and Weighted Structures
title_full_unstemmed Limits, Regularity and Removal for Relational and Weighted Structures
title_sort limits, regularity and removal for relational and weighted structures
publisher Research Showcase @ CMU
publishDate 2012
url http://repository.cmu.edu/dissertations/144
http://repository.cmu.edu/cgi/viewcontent.cgi?article=1144&context=dissertations
work_keys_str_mv AT aroskarashwini limitsregularityandremovalforrelationalandweightedstructures
_version_ 1716709378038431744