===affil2:
Department of Informatics and Telecommunications, University of Athens
===firstname:
Nikolaos, N  M
===firstname4:

===firstname3:

===lastname2:
Dimitrakopoulou
===lastname:
Missirlis
===firstname5:

===affil6:

===lastname3:

===email:
nmis@di.uoa.gr
===lastname6:

===affil5:

===otherauths:

===lastname4:

===affil4:

===lastname7:

===affil7:

===firstname7:

===postal:
Department of Informatics and Telecommunications
University of Athens
Panepistimiopolis 15784
Ilisia, Athens
Greece
===firstname6:

===ABSTRACT:



  The convergence analysis of the Extrapolated Diffusion  (EDF) was developed in \cite{Kara04} and \cite{MarkoMiss10}
 for the weighted torus and mesh graphs, respectively using the  set $\mathcal{N}_1(i)$ of nearest neighbors of a node i in the graph. In the present work we propose a Diffusion scheme which employs the set $\mathcal{N} _1(i)\cup \mathcal{N}_2(i)$, where $\mathcal{N}_2(i)$ denotes the four neighbors of node i with path length two (see Figure \ref{fig1})
in order to increase the convergence rate. We study the convergence analysis of the new Diffusion scheme with nine neighbors (NEDF) for weighted torus graphs. In particular, we find closed form formulae for the optimum values of the edge weights and the extrapolation parameter. A 60\% increase in the convergence rate of NEDF compared to the conventional EDF method is shown analytically and numerically.

===affil3:

===lastname5:

===affilother:

===title:
The nine neighbor Extrapolated Diffusion method
===firstname2:
Aikaterini