9 citations · 12 across the 5 of their papers we have counts for
6 papers
Robust On-line Matrix Completion on Graphs
Symeon Chouvardas, Mohammed Amin Abdullah, Lucas Claude +1
We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying…
Local majority dynamics on preferential attachment graphs
Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis
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…
Typical distances in a geometric model for complex networks
Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis
We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, vertices are d…
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…
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…
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 particles making independent random walks on a random regular graph. Here we assume , where is the num…