{"id":"https://openalex.org/W2047941103","doi":"https://doi.org/10.1145/1148109.1148162","title":"Distributed random digraph transformations for peer-to-peer networks","display_name":"Distributed random digraph transformations for peer-to-peer networks","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2047941103","doi":"https://doi.org/10.1145/1148109.1148162","mag":"2047941103"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148162","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","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/A5051251615","display_name":"Peter Mahlmann","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Mahlmann","raw_affiliation_strings":["University of Paderborn, Germany","[University of Paderborn., Germany]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"[University of Paderborn., Germany]","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068757827","display_name":"Christian Schindelhauer","orcid":"https://orcid.org/0000-0002-8320-8581"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schindelhauer","raw_affiliation_strings":["University of Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1752,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.77376939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"308","last_page":"317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9322999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/digraph","display_name":"Digraph","score":0.8163590431213379},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.7177677154541016},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.6410313844680786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.500086784362793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47428685426712036},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4631274342536926},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4620819091796875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40305712819099426},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3936659097671509},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3856548070907593}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8163590431213379},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.7177677154541016},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.6410313844680786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.500086784362793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47428685426712036},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4631274342536926},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4620819091796875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40305712819099426},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3936659097671509},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3856548070907593},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1148109.1148162","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1523214132","https://openalex.org/W1592213313","https://openalex.org/W1936696226","https://openalex.org/W1981535405","https://openalex.org/W2007219304","https://openalex.org/W2021503576","https://openalex.org/W2046441507","https://openalex.org/W2059732232","https://openalex.org/W2107082801","https://openalex.org/W2138972795","https://openalex.org/W2139506608","https://openalex.org/W2158049821","https://openalex.org/W2159164612","https://openalex.org/W2165222121","https://openalex.org/W2170362389","https://openalex.org/W4243132303","https://openalex.org/W6635493487","https://openalex.org/W6640463833","https://openalex.org/W6684734423"],"related_works":["https://openalex.org/W2033567934","https://openalex.org/W2782194400","https://openalex.org/W2365236566","https://openalex.org/W4206573252","https://openalex.org/W2023776467","https://openalex.org/W2011214451","https://openalex.org/W2230758337","https://openalex.org/W4212827260","https://openalex.org/W1548208024","https://openalex.org/W2361839934"],"abstract_inverted_index":{"We":[0,181],"present":[1],"a":[2,38,89,98,184],"local":[3],"random":[4,92],"graph":[5,18],"transformation":[6],"for":[7,37],"weakly":[8,104,127,137,178,197,220],"connected":[9,46,105,128,138,179,198,221],"multi-digraphs":[10,130,143],"with":[11,19],"regular":[12],"out-degree":[13],"which":[14,73],"produces":[15],"every":[16,196],"such":[17],"equal":[20],"probability.":[21],"This":[22],"operation,":[23],"called":[24],"Pointer-Push&Pull,":[25],"changes":[26],"only":[27,70,192],"two":[28,71,77],"neighboring":[29],"edges.":[30],"Such":[31],"an":[32,151],"operation":[33,57,68,115,172,186,214],"is":[34],"highly":[35],"desirable":[36],"peerto-peer":[39],"network":[40,53],"to":[41,75,97,122,132],"establish":[42],"and":[43,51,66],"maintain":[44],"well":[45],"expander":[47],"graphs":[48],"as":[49],"reliable":[50],"robust":[52],"backbone.":[54],"The":[55,200],"Pointer-Push&Pull":[56,93,171,185,213],"can":[58,194],"be":[59],"used":[60,112],"in":[61,113],"parallel":[62],"without":[63],"central":[64],"coordination":[65],"each":[67,79,154],"involves":[69],"peers":[72],"have":[74],"exchange":[76],"messages,":[78],"carrying":[80],"the":[81,110,114,123,133,157,166,170,174,205,208,212,216],"information":[82],"of":[83,91,125,135,160,176,207,218],"one":[84],"edge":[85],"only.We":[86],"show":[87,182],"that":[88,183],"series":[90],"operations":[94],"eventually":[95],"leads":[96],"uniform":[99,117],"probability":[100,118],"distribution":[101,119],"over":[102,173,215],"all":[103,126,136,177,219],"out-regular":[106,129,139,152,222],"multi-digraphs.":[107,180,223],"Depending":[108],"on":[109],"probabilities":[111],"this":[116],"either":[120],"refers":[121],"set":[124,134,175,217],"or":[131,146],"edge-labeled":[140],"multidigraphs.":[141],"In":[142,150],"multiple":[144],"edges":[145],"self-loops":[147],"may":[148],"occur.":[149],"digraph":[153],"node":[155],"has":[156],"same":[158],"number":[159],"outgoing":[161],"edges.For":[162],"this,":[163],"we":[164],"investigate":[165],"Markov-Process":[167,209],"defined":[168],"by":[169,211],"--":[187,193],"although":[188],"preserving":[189],"weak":[190],"connectivity":[191],"reach":[195],"multi-digraph.":[199],"main":[201],"argument":[202],"follows":[203],"from":[204],"symmetry":[206],"described":[210]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}