Do Young Eun

TL;DR: It is rigorously proved that a finite domain, on which most of the current mobility models are defined, plays an important role in creating the exponential tail of the inter-meeting time and the relationship between the size of the boundary and the relevant time scale of the network scenario under consideration is discussed.

TL;DR: This paper proposes non-backtracking random walk with re-weighting (NBRW-rw) and MH algorithm with delayed acceptance (MHDA) which are theoretically guaranteed to achieve, at almost no additional cost, not only unbiased graph sampling but also higher efficiency (smaller asymptotic variance of the resulting unbiased estimators) than the SRw-rw and the MH algorithm, respectively.

TL;DR: It is proved that IPF and MPF achieve proportional fairness among groups and among all users in a group inside a cell respectively and that these algorithms achieve good balance between throughput and fairness among users and groups.

TL;DR: It is rigorously proved that a finite domain, on which most of the current mobility models are defined, plays an important role in creating the exponential tail of the intermeeting time and that by simply removing the boundary in a simple two-dimensional isotropic random walk model, one is able to obtain the empirically observed power-law decay of the IntermeetingTime.

TL;DR: In this paper, the authors proposed non-backtracking random walk with re-weighting (NBRW-rw) and MH algorithm with delayed acceptance (MHDA) which are theoretically guaranteed to achieve, at almost no additional cost, not only unbiased graph sampling but also higher efficiency (smaller asymptotic variance of the resulting unbiased estimators).