{"id":"https://openalex.org/W2058600246","doi":"https://doi.org/10.1109/icdm.2013.77","title":"Tree-Like Structure in Large Social and Information Networks","display_name":"Tree-Like Structure in Large Social and Information Networks","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2058600246","doi":"https://doi.org/10.1109/icdm.2013.77","mag":"2058600246"},"language":"en","primary_location":{"id":"doi:10.1109/icdm.2013.77","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2013.77","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 13th International Conference on Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038119134","display_name":"Aaron Adcock","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aaron B. Adcock","raw_affiliation_strings":["Department of Electrical Engineering, Stanford University, Stanford, CA","[Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA]","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089650657","display_name":"Blair D. Sullivan","orcid":"https://orcid.org/0000-0001-7720-6208"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Blair D. Sullivan","raw_affiliation_strings":["Department of Computer Science, North Carolina State University, Raleigh, NC","Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, North Carolina State University, Raleigh, NC","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA#TAB#","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033006662","display_name":"Michael W. Mahoney","orcid":"https://orcid.org/0000-0001-7920-4652"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael W. Mahoney","raw_affiliation_strings":["Department of Mathematics, Stanford University, Stanford, CA","Dept. of Math., Stanford Univ., Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Dept. of Math., Stanford Univ., Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038119134"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":5.7395,"has_fulltext":false,"cited_by_count":140,"citation_normalized_percentile":{"value":0.96299921,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9887999892234802,"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/computer-science","display_name":"Computer science","score":0.6624242067337036},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6430646777153015},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5772347450256348},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.5742371678352356},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4818940758705139},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.45022130012512207},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.44552600383758545},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4164056181907654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3842133581638336},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.37913140654563904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33440178632736206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2629850506782532},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24907907843589783},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14811167120933533},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10320132970809937},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08615529537200928}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6624242067337036},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6430646777153015},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5772347450256348},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.5742371678352356},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4818940758705139},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.45022130012512207},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.44552600383758545},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4164056181907654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3842133581638336},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.37913140654563904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33440178632736206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2629850506782532},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24907907843589783},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14811167120933533},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10320132970809937},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08615529537200928},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icdm.2013.77","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2013.77","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 13th International Conference on Data Mining","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.715.6961","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.715.6961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stat.berkeley.edu/%7Emmahoney/pubs/treelike-icdm13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W184935651","https://openalex.org/W200045149","https://openalex.org/W638149299","https://openalex.org/W1502432690","https://openalex.org/W1511986666","https://openalex.org/W1676999057","https://openalex.org/W1728984519","https://openalex.org/W1965650021","https://openalex.org/W1971215074","https://openalex.org/W1973972417","https://openalex.org/W1991755800","https://openalex.org/W2019137761","https://openalex.org/W2029448190","https://openalex.org/W2042949485","https://openalex.org/W2044465429","https://openalex.org/W2059372025","https://openalex.org/W2070232376","https://openalex.org/W2074093855","https://openalex.org/W2084668738","https://openalex.org/W2087830284","https://openalex.org/W2090129250","https://openalex.org/W2112090702","https://openalex.org/W2118136127","https://openalex.org/W2123498553","https://openalex.org/W2133131640","https://openalex.org/W2134086356","https://openalex.org/W2137541800","https://openalex.org/W2138482845","https://openalex.org/W2141063223","https://openalex.org/W2146591355","https://openalex.org/W2152284345","https://openalex.org/W2152948207","https://openalex.org/W2168891622","https://openalex.org/W2596230329","https://openalex.org/W2798588639","https://openalex.org/W2964295174","https://openalex.org/W3125564681","https://openalex.org/W3143219376","https://openalex.org/W3214957292","https://openalex.org/W4229484577","https://openalex.org/W4235484205","https://openalex.org/W6608138059","https://openalex.org/W6630163099","https://openalex.org/W6637459119","https://openalex.org/W6679928186","https://openalex.org/W6750258011","https://openalex.org/W6793127252","https://openalex.org/W6891801955"],"related_works":["https://openalex.org/W4244673516","https://openalex.org/W2107381954","https://openalex.org/W22108090","https://openalex.org/W2227684440","https://openalex.org/W2359095153","https://openalex.org/W2083751087","https://openalex.org/W1521720839","https://openalex.org/W4206608951","https://openalex.org/W2343659340","https://openalex.org/W2156833871"],"abstract_inverted_index":{"Although":[0,87],"large":[1,193],"social":[2],"and":[3,66,105,196,202],"information":[4],"networks":[5],"are":[6],"often":[7,91],"thought":[8],"of":[9,28,32,41,62,83,112,141,147,160,186,192],"as":[10],"having":[11],"hierarchical":[12],"or":[13,114,143],"tree-like":[14,30,56,77,96,127,165,182,212],"structure,":[15,65],"this":[16,181,211],"assumption":[17],"is":[18,46,59,80],"rarely":[19],"tested.":[20],"We":[21,151,179],"have":[22,94,125],"performed":[23],"a":[24,47,57,78,138,144],"detailed":[25],"empirical":[26],"analysis":[27,146],"the":[29,103,110,115,148,187,200],"properties":[31],"realistic":[33,88,170],"informatics":[34,89,171,194],"graphs":[35,90,123,172],"using":[36],"two":[37,157],"very":[38,163],"different":[39,164],"notions":[40,159],"tree-likeness:":[42],"Gromov's":[43],"d-hyperbolicity,":[44],"which":[45,74],"notion":[48,140],"from":[49,70],"geometric":[50],"group":[51],"theory":[52,73],"that":[53,120,199],"measures":[54],"how":[55,76],"graph":[58,72,79],"in":[60,81,167,184],"terms":[61,82,185],"its":[63,84],"metric":[64],"tree":[67,116,149],"decompositions,":[68],"tools":[69],"structural":[71],"measure":[75],"cut":[85],"structure.":[86,178,213],"do":[92,124],"not":[93],"meaningful":[95,126],"structure":[97,128,183],"when":[98,129],"viewed":[99,130],"with":[100,131],"respect":[101,132],"to":[102,133,209],"simplest":[104],"most":[106],"popular":[107],"metrics,":[108,136],"e.g.,":[109,137],"value":[111],"d":[113,142],"width,":[117],"we":[118,197],"conclude":[119],"many":[121],"such":[122],"more":[134],"refined":[135],"size-resolved":[139],"closer":[145],"decompositions.":[150],"also":[152],"show":[153,198],"that,":[154],"although":[155],"these":[156],"rigorous":[158],"tree-likeness":[161],"capture":[162],"structures":[166],"worst-case,":[168],"for":[169],"they":[173],"empirically":[174],"identify":[175,210],"surprisingly":[176],"similar":[177],"interpret":[180],"recently-characterized":[188],"\"nested":[189],"core-periphery\"":[190],"property":[191],"graphs,":[195],"fast":[201],"scalable":[203],"k-core":[204],"heuristic":[205],"can":[206],"be":[207],"used":[208]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}