The random connection model on the torus.
Luc Devroye and Nicolas Fraiman.
(Submitted).
Connectivity of inhomogeneous random graphs.
Luc Devroye and Nicolas Fraiman.
(To appear in Random Structures and Algorithms).
A De Bruijn-Erdos theorem for chordal graphs.
Laurent Beaudou, Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vašek Chvátal, Nicolas Fraiman and Yori Zwols.
(Submitted).
Laurent Beaudou, Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vašek Chvátal, Nicolas Fraiman and Yori Zwols.
(To appear in Combinatorica).
Connectivity threshold for Bluetooth graphs.
Nicolas Broutin, Luc Devroye, Nicolas Fraiman and Gabor Lugosi.
(To appear in Random Structures and Algorithms).
Depth properties of scaled attachment random recursive trees.
Luc Devroye, Omar Fawzi and Nicolas Fraiman.
Random Structures and Algorithms, 41:66-98 (2012).
The height of scaled attachment random recursive trees.
Luc Devroye, Omar Fawzi and Nicolas Fraiman.
Discrete Mathematics and Theoretical Computer Science (proceedings of AofA'10), 129-142 (2010).
Model selection techniques & sparse Markov chains
My master's thesis (2008), on model selection techniques and BIC type estimation of sparse Markov chains, under the supervision of Gonzalo Perera (in spanish).
Percolation theory: the number of infinite clusters
My bachelor's thesis (2005), on uniqueness and non-uniqueness of infinite clusters in percolation models, under the supervision of Gustavo Guerberoff (in spanish).