4 citations · 5 across the 2 of their papers we have counts for
3 papers
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…
Good edge-labelings and graphs with girth at least five
Michel Bode, Babak Farzad, Dirk Oliver Theis
A good edge-labeling of a graph [Araújo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there…