Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

DOI10.1016/J.JPDC.2010.05.003MaRDI QIDQ666208zbMATH OpenOpenAlexFDO

Authors Keqin Li

Publication date 7 March 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2010.05.003

zbMATH Keywords

random walkconvergencedilationasymptotic optimalityloaddynamic tree evolutionregular network

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Taking random walks to grow trees in hypercubes
• Lower bounds for dynamic tree embedding in bipartite networks
• Analysis of randomized load distribution for reproduction trees in linear arrays and rings
• scientific article; zbMATH DE number 1953112
• scientific article; zbMATH DE number 1161316

Cites work

• scientific article; zbMATH DE number 432837 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1161316 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
• A proof of alon's second eigenvalue conjecture
• Analysis of randomized load distribution for reproduction trees in linear arrays and rings
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Dynamic Tree Embeddings in Butterflies and Hypercubes
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• Lower bounds for dynamic tree embedding in bipartite networks
• On the performance of randomized embedding of reproduction trees in static networks
• Performance analysis for dynamic tree embedding in k-partite networks by a random walk
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Taking random walks to grow trees in hypercubes

Cited in

(4)

• scientific article; zbMATH DE number 1953112 (Why is no real title available?)
• On the performance of randomized embedding of reproduction trees in static networks
• An evolutionary approach for finding optimal trees in undirected networks
• Taking random walks to grow trees in hypercubes

This page was built for publication: Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666208)