{"id":"https://openalex.org/W2006450313","doi":"https://doi.org/10.1137/120890946","title":"Every Property of Hyperfinite Graphs Is Testable","display_name":"Every Property of Hyperfinite Graphs Is Testable","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2006450313","doi":"https://doi.org/10.1137/120890946","mag":"2006450313"},"language":"en","primary_location":{"id":"doi:10.1137/120890946","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120890946","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17877/de290r-7805","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005870042","display_name":"Ilan Newman","orcid":"https://orcid.org/0000-0002-4845-4111"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ilan Newman","raw_affiliation_strings":["Department of Computer Science, University of Haifa, Haifa, Israel,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, Haifa, Israel,","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034247955","display_name":"Christian Sohler","orcid":"https://orcid.org/0000-0001-8990-3326"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christian Sohler","raw_affiliation_strings":["Department of Computer Science Technische Universit\u00e4t Dortmund,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Technische Universit\u00e4t Dortmund,","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034247955"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":3.329,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.91917115,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"42","issue":"3","first_page":"1095","last_page":"1112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.826701283454895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7965868711471558},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5507321953773499},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.5066031217575073},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47635650634765625},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.46471890807151794},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45305269956588745},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.442754864692688},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4302114248275757},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4255082607269287},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39887556433677673},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1967637836933136}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.826701283454895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7965868711471558},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5507321953773499},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.5066031217575073},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47635650634765625},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.46471890807151794},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45305269956588745},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.442754864692688},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4302114248275757},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4255082607269287},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39887556433677673},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1967637836933136},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/120890946","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120890946","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.8702","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.8702","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.haifa.ac.il/~ilan/online-papers/hyperfinite_sicomp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.9394","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.9394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.haifa.ac.il/~ilan/online-papers/testing_hyperfinite_stoc_11.pdf","raw_type":"text"},{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/34160","is_oa":false,"landing_page_url":"http://hdl.handle.net/2003/34160","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:Text"},{"id":"doi:10.17877/de290r-7805","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-7805","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.17877/de290r-7805","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-7805","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7786808558","display_name":null,"funder_award_id":"862/10","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1970630090","https://openalex.org/W1970795186","https://openalex.org/W1974672137","https://openalex.org/W1980816908","https://openalex.org/W1982180670","https://openalex.org/W2012887473","https://openalex.org/W2018925011","https://openalex.org/W2052194338","https://openalex.org/W2153624566","https://openalex.org/W3083068705"],"related_works":["https://openalex.org/W2045730620","https://openalex.org/W2395770054","https://openalex.org/W4317940434","https://openalex.org/W4383180681","https://openalex.org/W1976617626","https://openalex.org/W4245682093","https://openalex.org/W167435155","https://openalex.org/W2950539638","https://openalex.org/W1909289562","https://openalex.org/W4291309486"],"abstract_inverted_index":{"A":[0,102,219],"$k$-disc":[1],"around":[2],"a":[3,7,30,97,234],"vertex":[4],"$v$":[5],"of":[6,17,29,51,61,69,72,84,99,106,150,168,190,202,222,237,240,245],"graph":[8,32,91,183,195,208,216,223],"$G=(V,E)$":[9],"is":[10,42,67,109,129,185,197,210,225],"the":[11,27,46,59,70,73,122,126,156,161,166,176,213,238,243],"subgraph":[12],"induced":[13],"by":[14,58,80,140],"all":[15],"vertices":[16],"distance":[18],"at":[19,52],"most":[20,53],"$k$":[21],"from":[22],"$v$.":[23],"We":[24,75,158,179],"show":[25],"that":[26,66,93,110,115,139,181],"structure":[28],"planar":[31,78],"on":[33],"$n$":[34],"vertices,":[35],"and":[36],"with":[37],"constant":[38],"maximum":[39],"degree":[40,113,215],"$d$,":[41],"determined,":[43],"up":[44],"to":[45,133,155,175],"modification":[47],"(insertion":[48],"or":[49,142],"deletion)":[50],"$\\epsilon":[54],"d":[55],"n$":[56],"edges,":[57],"frequency":[60,118,127],"$k$-discs":[62],"for":[63,88,187,199,227],"certain":[64],"$k=k(\\epsilon,d)$":[65],"independent":[68],"size":[71],"graph.":[74],"can":[76],"replace":[77],"graphs":[79,114],"any":[81],"hyperfinite":[82,191,203,207,228],"class":[83,92,189,201,221],"graphs,":[85,192,204],"which":[86,171],"includes,":[87],"example,":[89],"every":[90,188,194,200,206],"does":[94],"not":[95,144],"contain":[96],"set":[98],"forbidden":[100],"minors.":[101],"pure":[103],"combinatorial":[104],"consequence":[105],"this":[107],"result":[108],"two":[111],"$d$-bounded":[112],"have":[116],"similar":[117],"vectors":[119,128],"(that":[120],"is,":[121],"$\\ell_1$":[123],"difference":[124],"between":[125],"small)":[130],"are":[131,172],"close":[132,136],"isomorphic":[134,154],"(where":[135],"here":[137],"means":[138],"inserting":[141],"deleting":[143],"too":[145],"many":[146],"edges":[147],"in":[148,165,212,242],"one":[149],"them,":[151],"it":[152],"becomes":[153],"other).":[157],"also":[159,232],"obtain":[160],"following":[162],"new":[163],"results":[164,231],"area":[167],"property":[169,196,209],"testing,":[170],"essentially":[173],"equivalent":[174],"above":[177],"statement.":[178],"prove":[180],"(a)":[182],"isomorphism":[184],"testable":[186,198,211],"(b)":[193],"(c)":[205],"bounded":[214],"model,":[217],"(d)":[218],"large":[220],"parameters":[224],"approximable":[226],"graphs.":[229],"Our":[230],"give":[233],"partial":[235],"explanation":[236],"success":[239],"motifs":[241],"analysis":[244],"complex":[246],"networks.":[247]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-19T08:26:33.389920","created_date":"2025-10-10T00:00:00"}