Mohammed Abdullah

activity

20112016

most citedThe Cover Time of Random Walks on Graphs

9 citations · 12 across the 5 of their papers we have counts for

collaborators

Showing math.PRShow all

3 papers · 1 filter

math.PR2015★ 1 cited

Local majority dynamics on preferential attachment graphs

Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis

Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ 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…

math.PR2011★ 1 cited

Viral processes by random walks on random regular graphs

Mohammed Abdullah, Colin Cooper, Moez Draief

We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k \leq n^{ε}$ , where $n$ is the num…