Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  define a distance of two graphs that reflects the closeness of both local and global properties.  also define convergence of a sequence of graphs, and show that a graph sequence is convergent if and only if it is Cauchy in this distance. Every convergent graph sequence has a limit in the form of a symmetric measurable function in two variables.  use these notions of distance and graph limits to give a general theory for parameter testing. As examples,  provide short proofs of the testability of MaxCut and the recent result of Alon and Shapira about the testability of hereditary graph properties.
['Christian Borgs', 'Jennifer T. Chayes', 'László Lovász', 'Vera T. Sós', 'Balázs Szegedy', 'Katalin Vesztergombi']
I am writing a research paper on a idea Graph limits and parameter testing
[{"from": "human", "value": "I am writing a research paper on a idea Graph limits and parameter testing"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  define a distance of two graphs that reflects the closeness of both local and global properties.  also define convergence of a sequence of graphs, and show that a graph sequence is convergent if and only if it is Cauchy in this distance. Every convergent graph sequence has a limit in the form of a symmetric measurable function in two variables.  use these notions of distance and graph limits to give a general theory for parameter testing. As examples,  provide short proofs of the testability of MaxCut and the recent result of Alon and Shapira about the testability of hereditary graph properties."}]