{"id":"https://openalex.org/W2156952423","doi":"https://doi.org/10.1109/cec.2008.4630989","title":"Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links","display_name":"Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2156952423","doi":"https://doi.org/10.1109/cec.2008.4630989","mag":"2156952423"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2008.4630989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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/A5070320638","display_name":"Boris Mitavskiy","orcid":null},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Boris Mitavskiy","raw_affiliation_strings":["School of Medicine, University of Sheffield, Sheffield, UK"],"affiliations":[{"raw_affiliation_string":"School of Medicine, University of Sheffield, Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112196936","display_name":"Jonathan E. Rowe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonathan Rowe","raw_affiliation_strings":["School of Computer Science, University of Binningham, Birmingham, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Binningham, Birmingham, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113644735","display_name":"C. Cannings","orcid":null},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Chris Cannings","raw_affiliation_strings":["School of Medicine, University of Sheffield, Sheffield, UK"],"affiliations":[{"raw_affiliation_string":"School of Medicine, University of Sheffield, Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070320638"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.18266409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":null,"first_page":"1484","last_page":"1491"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994000196456909,"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.9994000196456909,"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/T11031","display_name":"Game Theory and Applications","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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.7126613855361938},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6071293950080872},{"id":"https://openalex.org/keywords/ergodicity","display_name":"Ergodicity","score":0.598092794418335},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5482136607170105},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.507459819316864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.490342378616333},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4791381061077118},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4748254716396332},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4615028500556946},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4232533872127533},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.41980960965156555},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35413575172424316},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.206211656332016},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17068150639533997}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7126613855361938},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6071293950080872},{"id":"https://openalex.org/C201779956","wikidata":"https://www.wikidata.org/wiki/Q5426803","display_name":"Ergodicity","level":2,"score":0.598092794418335},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5482136607170105},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.507459819316864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.490342378616333},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4791381061077118},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4748254716396332},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4615028500556946},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4232533872127533},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.41980960965156555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35413575172424316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.206211656332016},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17068150639533997},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2008.4630989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/df30b226-1edd-495f-b740-6a75de3d95d8","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/preliminary-theoretical-analysis-of-a-local-search-algorithm-to-optimize-network-communication-subject-to-preserving-the-total-number-of-links(df30b226-1edd-495f-b740-6a75de3d95d8).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mitavskiy, B, Rowe, J & Cannings, C 2008, 'Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links', Paper presented at 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), 6/06/08 pp. 1484-1491. https://doi.org/10.1109/CEC.2008.4630989","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W116143187","https://openalex.org/W2011039300","https://openalex.org/W2047517090","https://openalex.org/W2085428562","https://openalex.org/W2115049345","https://openalex.org/W2135597924","https://openalex.org/W2316753634","https://openalex.org/W2476096155","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W4283765137","https://openalex.org/W4317496694","https://openalex.org/W3174749984","https://openalex.org/W2887485518","https://openalex.org/W2143668930","https://openalex.org/W1655912143","https://openalex.org/W2560221187","https://openalex.org/W4287021660"],"abstract_inverted_index":{"A":[0],"variety":[1],"of":[2,18,55,91,97],"phenomena":[3],"such":[4],"as":[5,21],"world":[6],"wide":[7],"web,":[8],"social":[9],"or":[10,25],"business":[11],"interactions":[12],"are":[13],"modeled":[14],"by":[15],"various":[16,48],"kinds":[17],"networks":[19],"(such":[20],"the":[22,32,40,44,47,53,59,63,87,95,98,102,124],"scale":[23,125],"free":[24,126],"preferential":[26],"attachment":[27],"networks).":[28],"However,":[29],"due":[30],"to":[31,38,42,81],"model-specific":[33],"requirements":[34],"one":[35],"may":[36],"want":[37],"rewire":[39],"network":[41],"optimize":[43],"communication":[45],"among":[46],"nodes":[49],"while":[50],"not":[51],"overloading":[52],"number":[54,60],"channels":[56],"(i.e.":[57,100],"preserving":[58],"edges).":[61],"In":[62],"current":[64],"paper":[65],"we":[66,115],"present":[67,117],"a":[68,75,108,118],"formal":[69],"framework":[70],"for":[71,123],"this":[72],"problem":[73],"and":[74,114],"simple":[76],"heuristic":[77],"local":[78,109],"search":[79],"algorithm":[80,99,103],"cope":[82],"with":[83,111],"it.":[84],"We":[85],"estimate":[86],"expected":[88],"single-step":[89],"improvement":[90],"our":[92],"algorithm,":[93],"establish":[94],"ergodicity":[96],"that":[101],"never":[104],"gets":[105],"stuck":[106],"at":[107],"optima)":[110],"probability":[112],"1)":[113],"also":[116],"few":[119],"initial":[120],"empirical":[121],"results":[122],"networks.":[127]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}