Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Nathanaël Enriquez"'
Autor:
Julien Bureaux, Nathanaël Enriquez
Publikováno v:
Discrete Analysis (2016)
On the number of lattice convex chains, Discrete Analysis 2016:19, 15pp. A _lattice convex polygon_ is a convex polygon whose vertices have integer coordinates. This simple definition leads quickly to some very interesting questions that have been s
Externí odkaz:
https://doaj.org/article/9977a2621a4d45959db5aae98cc4d470
Autor:
Nathanael, Enriquez
In this work we introduce correlated random walks on $\Z$. When picking suitably at random the coefficient of correlation, and taking the average over a large number of walks, we obtain a discrete Gaussian process, whose scaling limit is the fraction
Externí odkaz:
http://arxiv.org/abs/math/0210272
Publikováno v:
Annales Henri Lebesgue
Annales Henri Lebesgue, 2021, 4, pp.711-757
Annales Henri Lebesgue, 2021, 4, pp.711-757
International audience
Publikováno v:
International Mathematics Research Notices. 2021:5413-5459
In this paper, we consider a Riemannian manifold $M$ and the Poisson–Voronoi tessellation generated by the union of a fixed point $x_0$ and a Poisson point process of intensity $\lambda $ on $M$. We obtain a two-term asymptotic expansion, when $\la
Autor:
Nathan Noiry, Nathanaël Enriquez
Publikováno v:
Electron. Commun. Probab.
When the distribution of the inter-arrival times of a renewal process is a mixture of geometric laws, we prove that the renewal function of the process is given by the moments of a probability measure which is explicitly related to the mixture distri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::670acba76b5076a4523bfec7d305041b
https://projecteuclid.org/euclid.ecp/1600912939
https://projecteuclid.org/euclid.ecp/1600912939
Publikováno v:
Random Structures and Algorithms
Random Structures and Algorithms, Wiley, 2020, 56 (2)
Random Structures and Algorithms, 2020, 56 (2)
Random Structures and Algorithms, Wiley, 2020, 56 (2)
Random Structures and Algorithms, 2020, 56 (2)
We show that the profile of the tree constructed by the Depth First Search Algorithm in the giant component of an Erd\H{o}s-R\'enyi graph with $N$ vertices and connection probability $c/N$ converges to an explicit deterministic shape. This makes it p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e82072fb051b21c7a27b72e71493be3
https://hal.archives-ouvertes.fr/hal-01700925
https://hal.archives-ouvertes.fr/hal-01700925
Autor:
Julien Bureaux, Nathanaël Enriquez
Publikováno v:
Mathematical News / Mathematische Nachrichten
Mathematical News / Mathematische Nachrichten, Wiley-VCH Verlag, 2018, 291 (1), pp.24-27. ⟨10.1002/mana.201600526⟩
Mathematical News / Mathematische Nachrichten, 2018, 291 (1), pp.24-27. ⟨10.1002/mana.201600526⟩
Mathematical News / Mathematische Nachrichten, Wiley-VCH Verlag, 2018, 291 (1), pp.24-27. ⟨10.1002/mana.201600526⟩
Mathematical News / Mathematische Nachrichten, 2018, 291 (1), pp.24-27. ⟨10.1002/mana.201600526⟩
An equivalence is proven between the Riemann Hypothesis and the speed of convergence to 1/zeta(2) of the probability that two independent random variables following the same geometric distribution are coprime integers, when the parameter of the distr
Autor:
Nathanaël Enriquez, Julien Bureaux
Publikováno v:
Israel Journal of Mathematics
Israel Journal of Mathematics, 2017, 222 (2), pp.515-549. ⟨10.1007/s11856-017-1599-3⟩
Israël Journal of Mathematics
Israël Journal of Mathematics, Hebrew University Magnes Press, 2017, 222 (2), pp.515-549. ⟨10.1007/s11856-017-1599-3⟩
Israel Journal of Mathematics, 2017, 222 (2), pp.515-549. ⟨10.1007/s11856-017-1599-3⟩
Israël Journal of Mathematics
Israël Journal of Mathematics, Hebrew University Magnes Press, 2017, 222 (2), pp.515-549. ⟨10.1007/s11856-017-1599-3⟩
International audience; A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is cons
Publikováno v:
Séminaire de Probabilités L
Springer, Cham. Séminaire de Probabilités L, 2252, pp.9-16, 2019, Lecture Notes in Mathematics, 978-3-030-28534-0. ⟨10.1007/978-3-030-28535-7_3⟩
Lecture Notes in Mathematics ISBN: 9783030285340
Springer, Cham. Séminaire de Probabilités L, 2252, pp.9-16, 2019, Lecture Notes in Mathematics, 978-3-030-28534-0. ⟨10.1007/978-3-030-28535-7_3⟩
Lecture Notes in Mathematics ISBN: 9783030285340
L’objet de cette note est d’indiquer la maniere dont on peut etendre au cas d’une surface S, le celebre resultat, trouve independamment par Meijering en 1953 et Gilbert en 1962 , enoncant que le nombre moyen de sommets d’une cellule ou de fac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::474265fd0801ebdcf6581b57412ef2d7
https://hal.archives-ouvertes.fr/hal-02377527
https://hal.archives-ouvertes.fr/hal-02377527
Autor:
Nathanaël Enriquez
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783030285340
J’ai partage mon bureau a Jussieu avec Jacques pendant 7 ans. Cela va vous etonner mais c’est lors de notre derniere conversation que nous avons eu l’un de nos echanges mathematiques les plus intenses, dont nous vous exposerons la teneur avec A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6142034778a01415cd2f55e62d593e19
https://doi.org/10.1007/978-3-030-28535-7_2
https://doi.org/10.1007/978-3-030-28535-7_2