IK
Igor Kortchemski
math.PRmath.COmath.MPmath-phcond-mat.stat-mechcs.DMmath.STq-bio.PEstat.TH
On Valency
published · living versionsW_g75u4szz·v1 · currentpublished
Preprints & journals
35 papers in the corpus · 2008–2026Rare subtree patterns in size-conditioned Bienaymé trees: Poisson approximation and declumping2607.22291v1 · Igor Kortchemski, Leonard Vetter2026 · 0 citationsarXiv
Does freezing impede the growth of random recursive trees?2505.16571v2 · Anna Brandenberger, Simon Briend, Hannah Cairns et al.2025 · 0 citationsarXiv
The height of the infection tree2504.03526v1 · Emmanuel Kammerer, Igor Kortchemski, Delphin S'enizergues2025 · 0 citationsarXiv
Condensation in subcritical Cauchy Bienaymé trees2503.07530v2 · Igor Kortchemski, Leonard Vetter2025 · 0 citationsarXiv
Random Lévy Looptrees and Lévy Maps2402.04098v3 · Igor Kortchemski, Cyril Marzouk2024 · 1 citationAnnals of Applied Probability, 35, No. 6, 3973-4029, 2025
Critical trees are neither too short nor too fat2311.06163v2 · Louigi Addario-Berry, Serte Donderwinkel, Igor Kortchemski2023 · 2 citationsarXiv
Uniform attachment with freezing: Scaling limits2308.00484v3 · 'Etienne Bellin, Arthur Blanc-Renaudie, Emmanuel Kammerer et al.2023 · 2 citationsarXiv
Uniform attachment with freezing2308.00493v2 · 'Etienne Bellin, Arthur Blanc-Renaudie, Emmanuel Kammerer et al.2023 · 1 citationarXiv
Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent2301.01153v3 · Igor Kortchemski, Paul Th'evenin2023 · 1 citationarXiv
The mesoscopic geometry of sparse random maps2112.10719v1 · Nicolas Curien, Igor Kortchemski, Cyril Marzouk2021 · 2 citationsJournal de l{\textquoteright}\'Ecole polytechnique {\textemdash} Math\'ematiques, Tome 9 (2022), pp. 1305-1345
Large deviation Local Limit Theorems and limits of biconditioned Trees and Maps2101.01682v3 · Igor Kortchemski, Cyril Marzouk2021 · 5 citationsAnn. Appl. Probab. 33(5): 3755-3802 (October 2023)
On conditioning a self-similar growth-fragmentation by its intrinsic area1908.07830v1 · Jean Bertoin, Nicolas Curien, Igor Kortchemski2019 · 4 citationsarXiv
Trajectories in random minimal transposition factorizations1810.07586v2 · Valentin F'eray, Igor Kortchemski2018 · 10 citationsarXiv
Condensation in critical Cauchy Bienaymé-Galton-Watson trees1804.10183v3 · Igor Kortchemski, Loic Richier2018 · 18 citationsarXiv
The boundary of random planar maps via looptrees1802.00647v2 · Igor Kortchemski, Loic Richier2018 · 17 citationsarXiv
The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees1712.06542v2 · Valentin F'eray, Igor Kortchemski2017 · 20 citationsarXiv
Martingales in self-similar growth-fragmentations and their connections with random planar maps1605.00581v2 · Jean Bertoin, Timothy Budd, Nicolas Curien et al.2016 · 51 citationsarXiv
Triangulating stable laminations1509.02829v1 · Igor Kortchemski, Cyril Marzouk2015 · 17 citationsElectron. J. Probab. Volume 21 (2016), paper no. 11, 31 pp
Random planar maps & growth-fragmentations1507.02265v2 · Jean Bertoin, Nicolas Curien, Igor Kortchemski2015 · 11 citationsAnn. Probab. 46 (2018), no. 1, 207-260
Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees1504.04358v2 · Igor Kortchemski2015 · 39 citationsProbab. Theory Related Fields 168 (2017), no. 1-2, 1-40
Simply generated non-crossing partitions1503.09174v1 · Igor Kortchemski, Cyril Marzouk2015 · 18 citationsCombinatorics, Probability and Computing, 26(4), 560-592 (2017)
Random maps: proceeding of the Journées MAS 20141412.1610v1 · C'eline Abraham (LM-Orsay), J'er'emie Bettinelli (IECL), Gwendal Collet (LIX) et al.2014 · 0 citationsarXiv
Self-similar scaling limits of Markov chains on the positive integers1412.1068v2 · Jean Bertoin, Igor Kortchemski2014 · 31 citationsAnn. Appl. Probab. 26 (2016), no. 4, 2556-2595
Scaling limits and influence of the seed graph in preferential attachment trees1406.1758v1 · Nicolas Curien, Thomas Duquesne, Igor Kortchemski et al.2014 · 41 citationsJ. \'Ec. polytech. Math. 2 (2015), 1-34
A predator-prey SIR type dynamics on large complete graphs with three phase transitions1312.5678v3 · Igor Kortchemski2013 · 18 citationsStochastic Process. Appl. 125 (2015), no. 3, 886-917
Predator-prey dynamics on infinite trees: a branching random walk approach1312.4933v2 · Igor Kortchemski2013 · 11 citationsJ. Theoret. Probab. 29 (2016), no. 3, 1027-1046
Percolation on random triangulations and stable looptrees1307.6818v3 · Nicolas Curien, Igor Kortchemski2013 · 58 citationsProbab. Theory Related Fields 163 (2015), no. 1-2, 303-337
The CRT is the scaling limit of random dissections1305.3534v2 · Nicolas Curien, B'en'edicte Haas, Igor Kortchemski2013 · 44 citationsarXiv
Random stable looptrees1304.1044v2 · Nicolas Curien, Igor Kortchemski2013 · 56 citationsElectron. J. Probab. 19 (2014), no. 108, 1-35
Limit theorems for conditioned non-generic Galton-Watson trees1205.3145v4 · Igor Kortchemski2012 · 50 citationsAnn. Inst. Henri Poincar\'e Probab. Stat. 51 (2015), no. 2, 489-511
Random non-crossing plane configurations: A conditioned Galton-Watson tree approach1201.3354v1 · Nicolas Curien, Igor Kortchemski2012 · 41 citationsRandom Structures Algorithms 45 (2014), no. 2, 236-260
Invariance principles for Galton-Watson trees conditioned on the number of leaves1110.2163v4 · Igor Kortchemski2011 · 68 citationsStochastic Process. Appl. 122 (2012), no. 9, 3126-3172
A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees1109.4138v3 · Igor Kortchemski2011 · 40 citationsS\'eminaire de Probabilit\'es XLV, 537-558, Lecture Notes in Math., 2078, Springer, Cham, 2013
Random stable laminations of the disk1106.0271v4 · Igor Kortchemski2011 · 19 citationsAnnals of Probability 2014, Vol. 42, No. 2, 725-759
Asymptotic behavior of permutation records0804.0446v3 · Igor Kortchemski2008 · 20 citationsJ. Combin. Theory Ser. A 116 (2009), no. 6, 1154-1166
Career total: 58 works. 35 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.