9 citations · 12 across the 5 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DC2012
Global Majority Consensus by Local Majority Polling on Graphs of a Given Degree Sequence
Mohammed Amin Abdullah, Moez Draief
Suppose in a graph vertices can be either red or blue. Let be odd. At each time step, each vertex in polls random neighbours and takes the majority colour. If i…
math.PR2012★ 9 cited
The Cover Time of Random Walks on Graphs
Mohammed Abdullah
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the…