Nicolas Fraiman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nicolas Fraiman has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Luc Devroye
McGill University
5 shared publications - Gábor Lugosi
Department of Economics and Business Pompeu Fabra University Barcelona Spain
1 shared publication - Nicolas Broutin
Domaine de Voluceau Inria Paris-Rocquencourt 78153 Le Chesnay France
1 shared publication - Omar Fawzi
Inria, ENS de Lyon, UCBL, LIP, Lyon Cedex 07, France
1 shared publication
Latest Publications
- 9 July 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 23 (5) , 796-804
The Random Connection Model on the Torus
We study the diameter of a family of random graphs on the torus that can be used to model wireless networks. In the random connection model two pointsxandyare connected with probabilityg(y−x), wheregis a given function. We prove that the diameter of the graph is bounded by a constant, which depends only on ‖g‖1, with high probability as the number of vertices in the graph tends to infinity.
- 9 July 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 23 (5) , 796-804
The Random Connection Model on the Torus
We study the diameter of a family of random graphs on the torus that can be used to model wireless networks. In the random connection model two pointsxandyare connected with probabilityg(y−x), wheregis a given function. We prove that the diameter of the graph is bounded by a constant, which depends only on ‖g‖1, with high probability as the number of vertices in the graph tends to infinity.
- 26 February 2013
- Published by Wiley in Random Structures & Algorithms
- Vol. 45 (3) , 408-420
Connectivity of inhomogeneous random graphs
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when . We draw n independent points Xi from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i, j) is added with probability , where is a fixed kernel. We show that, under reasonably weak assumptions, the connectivity threshold of the model can be determined. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 45, 408‐420, 2014
- 26 February 2013
- Published by Wiley in Random Structures & Algorithms
- Vol. 45 (3) , 408-420
Connectivity of inhomogeneous random graphs
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when . We draw n independent points Xi from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i, j) is added with probability , where is a fixed kernel. We show that, under reasonably weak assumptions, the connectivity threshold of the model can be determined. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 45, 408‐420, 2014
- Open Access
Connectivity of inhomogeneous random graphs
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i,j) is added with probability min(1, \K(X_i,X_j) log n/n), where \K \ge 0 is a fixed kernel. We show that, under reasonably weak assumptions, the connectivity threshold of the model can be determined.
Open AccessConnectivity of inhomogeneous random graphs
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i,j) is added with probability min(1, \K(X_i,X_j) log n/n), where \K \ge 0 is a fixed kernel. We show that, under reasonably weak assumptions, the connectivity threshold of the model can be determined.
- 4 September 2012
- Published by Wiley in Random Structures & Algorithms
- Vol. 44 (1) , 45-66
Connectivity threshold of Bluetooth graphs
- 4 September 2012
- Published by Wiley in Random Structures & Algorithms
- Vol. 44 (1) , 45-66
Connectivity threshold of Bluetooth graphs
- 23 December 2011
- Published by Wiley in Random Structures & Algorithms
- Vol. 41 (1) , 66-98
Depth Properties of scaled attachment random recursive trees
We study depth properties of a general class of random recursive trees where each node i attaches to the random node \documentclass{article} \usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty} \begin{align*}\left\lfloor iX_i\right\rfloor\end{align*} and X0,…,Xn is a sequence of i.i.d. random variables taking values in [0,1). We call such trees scaled attachment random recursive trees (sarrt). We prove that the typical depth Dn, the maximum depth (or height) Hn and the minimum depth Mn of a sarrt are asymptotically given by Dn ∼μ‐1 log n, Hn ∼ αmax log n and Mn ∼ αmin log n where μ,αmax and αmin are constants depending only on the distribution of X0 whenever X0 has a density. In particular, this gives a new elementary proof for the height of uniform random recursive trees Hn ∼ elog n that does not use branching random walks.© 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011- 23 December 2011
- Published by Wiley in Random Structures & Algorithms
- Vol. 41 (1) , 66-98
Depth Properties of scaled attachment random recursive trees
We study depth properties of a general class of random recursive trees where each node i attaches to the random node \documentclass{article} \usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty} \begin{align*}\left\lfloor iX_i\right\rfloor\end{align*} and X0,…,Xn is a sequence of i.i.d. random variables taking values in [0,1). We call such trees scaled attachment random recursive trees (sarrt). We prove that the typical depth Dn, the maximum depth (or height) Hn and the minimum depth Mn of a sarrt are asymptotically given by Dn ∼μ‐1 log n, Hn ∼ αmax log n and Mn ∼ αmin log n where μ,αmax and αmin are constants depending only on the distribution of X0 whenever X0 has a density. In particular, this gives a new elementary proof for the height of uniform random recursive trees Hn ∼ elog n that does not use branching random walks.© 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011