Editing Open Problems:99

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 5: Line 5:
 
The graph query model where one gets to query vertices uniformly at random may seem unrealistic in some cases. Thus, one may advocate alternative models, especially in the context of graph property testing, akin to the &ldquo;distribution-free&rdquo; model of property testing (for functions) and the PAC model (for learning). In this ''Vertex-Distribution-Free'' (VDF) model of testing suggested in a recent paper {{Cite|Goldreich-19a}}<ref>This model was also briefly discussed in Section 10.1 of {{Cite|GoldreichGR-98}}.</ref>, one gets i.i.d. vertices sampled from an arbitrary distribution $\mathcal{D}$ over the vertex set, and the goal is to test w.r.t. to the (pseudo) distance induced by $\mathcal{D}$.
 
The graph query model where one gets to query vertices uniformly at random may seem unrealistic in some cases. Thus, one may advocate alternative models, especially in the context of graph property testing, akin to the &ldquo;distribution-free&rdquo; model of property testing (for functions) and the PAC model (for learning). In this ''Vertex-Distribution-Free'' (VDF) model of testing suggested in a recent paper {{Cite|Goldreich-19a}}<ref>This model was also briefly discussed in Section 10.1 of {{Cite|GoldreichGR-98}}.</ref>, one gets i.i.d. vertices sampled from an arbitrary distribution $\mathcal{D}$ over the vertex set, and the goal is to test w.r.t. to the (pseudo) distance induced by $\mathcal{D}$.
  
βˆ’
'''Question:''' Perform a systematic study of property testing, both in the bounded-degree and dense graph models, in this VDF setting.
+
'''Question:'''Perform a systematic study of property testing, both in the bounded-degree and dense graph models, in this VDF setting.
  
 
'''Question:''' ''(Suggested by C. Seshadhri)'' Can one define, motivate, and prove non-trivial results in an ''Edge''-Distribution-Free model, analogous to the VDF one but with regard to sampling random edges?<ref>This type of variant was also briefly evoked in Section 10.1.4 of {{Cite|GoldreichGR-98}}, where it was shown that Bipartiteness is not testable in such an EDF model.</ref>
 
'''Question:''' ''(Suggested by C. Seshadhri)'' Can one define, motivate, and prove non-trivial results in an ''Edge''-Distribution-Free model, analogous to the VDF one but with regard to sampling random edges?<ref>This type of variant was also briefly evoked in Section 10.1.4 of {{Cite|GoldreichGR-98}}, where it was shown that Bipartiteness is not testable in such an EDF model.</ref>

Please note that all contributions to Open Problems in Sublinear Algorithms may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Open Problems in Sublinear Algorithms:Copyrights for details). Do not submit copyrighted work without permission!

To edit this page, please answer the question that appears below (more info):

Cancel Editing help (opens in new window)