{"id":"https://openalex.org/W2240273152","doi":null,"title":"A general framework for aggregation/disaggregation methods for large Markov chains","display_name":"A general framework for aggregation/disaggregation methods for large Markov chains","alternate_titles":[],"publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2240273152","mag":"2240273152"},"language":"en","primary_location":{"id":"mag:2240273152","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=144984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2240273152"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5028453987","display_name":"Halim Daoud Kafeety","orcid":null,"observed_orcids":[]},"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":true,"contributor_roles":[],"raw_author_name":"Halim Daoud Kafeety","raw_affiliation_strings":["North Carolina State Univ., Raleigh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"North Carolina State Univ., Raleigh","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028453987"],"corresponding_institution_ids":["https://openalex.org/I137902535"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.8476999998092651,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.8476999998092651,"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.05510000139474869,"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/T13500","display_name":"Probability and Statistical Research","score":0.03519999980926514,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chains","display_name":"Markov chains","score":0.8709999918937683},{"id":"https://openalex.org/keywords/stationary-distribution","display_name":"stationary distribution","score":0.9240000247955322},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.5389999747276306},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.5899999737739563},{"id":"https://openalex.org/keywords/general-framework","display_name":"general framework","score":0.4950000047683716}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.8048083782196045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6781327724456787},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5438963770866394},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5425629615783691},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5006930828094482},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4951392710208893},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.43983781337738037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4266509711742401},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.23752275109291077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23404264450073242},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20141670107841492},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08875331282615662}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2240273152","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=144984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7096804269","https://openalex.org/W2033031224","https://openalex.org/W1608119595","https://openalex.org/W1575467827","https://openalex.org/W2079805156","https://openalex.org/W2202962894","https://openalex.org/W2033548598","https://openalex.org/W2050653429","https://openalex.org/W2070219174","https://openalex.org/W2079267753"],"abstract_inverted_index":{"Aggregation/disaggregation":[0],"methods":[1,52],"are":[2,24,53,129],"an":[3],"important":[4,119],"class":[5],"of":[6,16,46,78,117,138],"algorithm":[7,64],"which":[8,23,35,49,96],"is":[9,58,81],"used":[10,99],"to":[11,43,61,72,82,100,133],"compute":[12],"the":[13,44,110,118,135],"stationary":[14],"probabilities":[15],"large-scale":[17],"Markov":[18,21],"chains.":[19],"For":[20],"chains":[22],"nearly":[25],"uncoupled,":[26],"iterative":[27,50,93],"aggregation/disaggregation":[28,51,94],"techniques":[29],"can":[30,69,97],"often":[31],"result":[32],"in":[33,48,65,131],"sequences":[34],"converge":[36],"at":[37],"surprisingly":[38],"rapid":[39],"rates.":[40],"But":[41],"due":[42],"variety":[45],"ways":[47],"designed":[54],"and":[55,67,75,102,105],"implemented,":[56],"it":[57,68],"generally":[59],"necessary":[60],"analyze":[62,101],"each":[63],"isolation,":[66],"be":[70,98],"difficult":[71],"compare":[73,103,134],"similarities":[74],"differences.\r\nThe":[76],"purpose":[77],"this":[79,85,124],"study":[80],"help":[83],"overcome":[84],"situation":[86],"by":[87],"presenting":[88],"a":[89],"general":[90,107,125],"framework":[91],"for":[92],"algorithms":[95,108,121],"different":[104],"rather":[106],"from":[109],"class.":[111],"We":[112],"will":[113],"demonstrate":[114],"how":[115],"several":[116],"well-known":[120],"fit":[122],"within":[123],"framework.":[126],"Several":[127],"examples":[128],"given":[130],"order":[132],"relative":[136],"effectiveness":[137],"these":[139],"algorithms.":[140]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2240273152","counts_by_year":[],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}
