M. Agarwal, . Rishi-ranjan, S. Singh, S. Chaudhary, and . Iyengar, Betweenness Ordering Problem : An Efficient Non-Uniform Sampling Technique for Large Graphs, 2014.

D. A. Bader, S. Kintali, K. Madduri, and M. Mihail, Approximating betweenness centrality, WAW, pp.124-137, 2007.

C. H. Bennett, Efficient estimation of free energy differences from Monte-Carlo data, J. Comput. Phys, vol.22, p.245, 1976.

M. Borassi and E. Natale, KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, ESA, vol.20, p.18, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02002600

U. Brandes, A faster algorithm for betweenness centrality, Journal of Mathematical Sociology, vol.25, pp.163-177, 2001.

U. Brandes and C. Pich, Centrality estimation in large networks, Intl. Journal of Bifurcation and Chaos, vol.17, pp.303-318, 2007.

V. Ümit, K. Çatalyürek, and . Kaya, Shattering and Compressing Networks for Betweenness Centrality, Proceedings of the 13th SIAM International Conference on Data Mining, pp.686-694, 2013.

C. Mostafa-haghir, Effective co-betweenness centrality computation, Seventh ACM International Conference on Web Search and Data Mining, pp.423-432, 2014.

C. Mostafa-haghir, An Efficient Algorithm for Approximate Betweenness Centrality Computation, Comput. J, vol.57, pp.1371-1382, 2014.

T. Mostafa-haghir-chehreghani, A. Abdessalem, and . Bifet, Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks, 2017.

A. Mostafa-haghir-chehreghani, T. Bifet, and . Abdessalem, Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs, Advances in Knowledge Discovery and Data Mining, pp.752-764, 2018.

E. M. Daly and M. Haahr,

, Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs, IEEE Trans. Mob. Comput, vol.8, pp.606-621

M. Everett and S. Borgatti, The centrality of groups and classes, Journal of Mathematical Sociology, vol.23, pp.181-201, 1999.

L. C. Freeman, A set of measures of centrality based upon betweenness, Sociometry. Social Networks, vol.40, pp.35-41, 1977.

W. R. Gilks, S. Richardson, and D. J. Spiegelhalter, Markov Chain Monte Carlo in Practice, 1996.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Natl. Acad. Sci. USA, vol.99, pp.7821-7826, 2002.

K. ?atuszy?ski, B. Miasojedow, and W. Niemiro, Nonasymptotic Bounds on the Mean Square Error for MCMC Estimates via Renewal Techniques, pp.539-555, 2012.

K. L. Mengersen and R. L. Tweedie, Rates of convergence of the Hastings and Metropolis algorithms, Ann. Statist, vol.24, pp.101-121, 1996.

K. L. Mengersen and R. L. Tweedie, Rates of convergence of the Hastings and Metropolis algorithms, The Annals of Statistics, vol.24, pp.101-121, 1996.

S. P. Meyn and R. L. Tweedie, Markov chains and stochastic stability, 1993.

M. Riondato and E. M. Kornaropoulos, Fast approximation of betweenness centrality through sampling, Data Mining and Knowledge Discovery, vol.30, pp.438-475, 2016.

M. Riondato and E. Upfal, ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages, KDD, pp.1145-1154, 2016.

Y. Wang, Z. Di, and Y. Fan, Identifying and Characterizing Nodes Important to Community Structure Using the Spectrum of the Graph, PLoS ONE, vol.6, p.27418, 2011.