Mohammed Amin Abdullah

Cover time of a random graph with given degree sequence

In this paper we establish the cover time of a random graph

Typical distances in a geometric model for complex networks

G(\textbf{d})

The cover time of cartesian product graphs

chosen uniformly at random from the set of graphs with vertex set

A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs

[n]

Speeding Up Cover Time of Sparse Graphs Using Local Knowledge

and degree sequence

Robust online matrix completion on graphs

\textbf{d}

Majority Consensus on Random Graphs of a Given Degree Sequence

. We show that under certain restrictions on

Consensus on the Initial Global Majority by Local Majority Polling for a Class of Sparse Graphs

\textbf{d}

Viral processes by random walks on random regular graphs

, the cover time of

The Cover Time of Random Walks on Graphs

G(\textbf{d})