Statistical mechanics of complex networks, Rev. Modern Phys, vol.74, issue.1, pp.47-97, 2002. ,
Reversible markov chains and random walks on graphs, 2002. ,
Expanders via local edge flips, 2015. ,
, Stochastic Simulation: Algorithms and Analysis. Applications of Mathematics, 2007.
Skip graphs, ACM Trans. Algorithms, vol.3, issue.4, 2007. ,
Mixing times of markov chains: Techniques and examples, Alea-Latin American Journal of Probability and Mathematical Statistics, 2016. ,
Mixing time of exponential random graphs, The Annals of Applied Probability, vol.21, issue.6, pp.2146-2170, 2011. ,
Modern Graph Theory, 1998. ,
Negative dependence and the geometry of polynomials, Journal of the American Mathematical Society, vol.22, issue.2, pp.521-567, 2009. ,
The flip markov chain and a randomising p2p protocol, Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC '09, pp.141-150, 2009. ,
A randomized algorithm for the joining protocol in dynamic distributed networks, INRIA, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00070627
Temps de mélange de processus de markov distribués sur des graphes réguliers. Master's thesis, École Polytechnique, 2014. ,
Balls and bins: a study in negative dependence, Basic Research in Computer Science, pp.96-121, 1996. ,
On Markov chains for independent sets, J. Algorithms, vol.35, issue.1, pp.17-49, 2000. ,
Network information theory, 2011. ,
On the evolution of random graphs, Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp.17-61, 1960. ,
A local switch markov chain on given degree graphs with application in connectivity of peer-to-peer networks, Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS '06, pp.69-76, 2006. ,
On the second eigenvalue of random regular graphs, Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, STOC '89, pp.587-598, 1989. ,
Slow mixing of glauber dynamics for the hard-core model on regular bipartite graphs, Random Struct. Algorithms, vol.28, issue.4, pp.427-443, 2006. ,
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images, IEEE Trans. Pattern Anal. Mach. Intell, vol.6, issue.6, pp.721-741, 1984. ,
Tight bounds for rumor spreading in graphs of a given conductance, Symposium on Theoretical Aspects of Computer Science (STACS2011), vol.9, pp.57-68, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00573638
Tight bounds for rumor spreading with vertex expansion, Proceedings of the Twenty-fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '14, pp.801-815, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01097140
Transient solutions in markovian queueing systems, Computers & Operations Research, vol.4, issue.1, pp.47-53, 1977. ,
, Finite Markov chains and algorithmic applications, 2002.
Monte carlo sampling methods using markov chains and their applications, Biometrika, vol.57, issue.1, pp.97-109, 1970. ,
Transitivity in structural models of small groups, Comparative Group Studies, vol.2, issue.2, pp.107-124, 1971. ,
Expander graphs and their applications, Bull. Amer. Math. Soc. (N.S.), vol.43, issue.4, pp.439-561, 2006. ,
Perfect sampling using bounding chains, Ann. Appl. Probab, vol.14, issue.2, pp.734-753, 2004. ,
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs, Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC '09, pp.131-140, 2009. ,
Approximating the permanent, SIAM J. Comput, vol.18, issue.6, pp.1149-1178, 1989. ,
How to Optimally Allocate Your Budget of Attention in Social Networks, IEEE INFO-COM 2013 -IEEE Conference on Computer Communications, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00839599
Fast mixing of parallel glauber dynamics and low-delay CSMA scheduling, IEEE Transactions on Information Theory, vol.58, issue.10, pp.6541-6555, 2012. ,
Mixing times for the interchange process, Alea-Latin American Journal of Probability and Mathematical Statistics, vol.9, issue.2, pp.667-683, 2012. ,
Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded markov chain, Ann. Math. Statist, vol.24, issue.3, p.1953 ,
Nonlinear Systems, 2002. ,
Markov chains and mixing times. Providence, R.I, 2009. ,
Negative correlations and particle systems, Markov Processes and Related Fields, pp.547-564, 2002. ,
Peer-to-peer networks based on random transformations of connected regular undirected graphs, SPAA, 2005. ,
Distributed random digraph transformations for peer-to-peer networks, SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp.308-317, 2006. ,
Extension of the law of large numbers to dependent quantities, Izv. Fiz.-Matem. Obsch. Kazan Univ, vol.15, pp.135-156, 1906. ,
Network awareness and failure resilience in self-organizing overlay networks, 22nd International Symposium on Reliable Distributed Systems, 2003. ,
Peer counting and sampling in overlay networks: Random walk methods, Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, PODC '06, pp.123-132, 2006. ,
Equation of state calculations by fast computing machines, J. Chem. Phys, vol.21, p.1087, 1953. ,
Acceleration of perfect sampling by skipping events, Proceedings of the 5th International Conference on Performance Evaluation Methodologies and Tools (Valuetools), 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00788799
Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures & Algorithms, vol.9, issue.1-2, pp.223-252, 1996. ,
Tight bounds for randomized load balancing on arbitrary network topologies, Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, FOCS '12, pp.341-350, 2012. ,
An o(n2) bound for the relaxation time of a markov chain on cladograms. Random Struct, Algorithms, vol.20, issue.1, pp.59-70, 2002. ,
Randomized scheduling algorithm for queueing networks, Ann. Appl. Probab, vol.22, issue.1, pp.128-171, 2012. ,
Collective dynamics of "smallworld" networks, Nature, vol.393, issue.6684, pp.440-442, 1998. ,