Random walks, bisections and gossiping in circulant graphs

DOI10.1007/S00453-013-9810-3MaRDI QIDQ486995zbMATH OpenOpenAlexFDO

Authors Bernard Mans, Igor E. Shparlinski

Publication date 19 January 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-013-9810-3

zbMATH Keywords

random walksrandom graphscirculant graphsgossipingbisection

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random walks on graphs (05C81)

Recommendations

• Random walks and bisections in random circulant graphs
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 1432346
• Layout of random circulant graphs
• Publication:3359735

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1759403 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• scientific article; zbMATH DE number 881165 (Why is no real title available?)
• Diameters of random circulant graphs
• Diskrepanz und Distanz von Maßen bezüglich konvexer und Jordanscher Mengen. (Discrepancy and distance of measures with respect to convex and Jordan sets)
• Efficient elections in chordal ring networks
• Gossiping in chordal rings under the line model
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Graphs with circulant adjacency matrices
• LATIN 2004: Theoretical Informatics
• Many Random Walks Are Faster Than One
• Node bisectors of Cayley graphs
• On small cuts separating an abelian Cayley graph into two equal parts
• On the diameter and bisector size of Cayley graphs
• On the spectral Ádám property for circulant graphs
• On Ádám's conjecture for circulant graphs
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• Optimal distributed algorithms in unlabeled tori and chordal rings
• Random walks and bisections in random circulant graphs
• Static frequency assignment in cellular networks
• The diameter of a random Cayley graph of \({\mathbb{Z}}_q\)
• The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
• Uniform multi-hop all-to-all optical routings in rings.

Cited in

(5)

• Layout of random circulant graphs
• LATIN 2004: Theoretical Informatics
• The relationship between gossiping in vertex-disjoint paths mode and bisection width
• On reducibility and spectral properties of circulant Markov processes
• Random walks and bisections in random circulant graphs

This page was built for publication: Random walks, bisections and gossiping in circulant graphs

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