ETH Home D-MATH Home




Artem Sapozhnikov

Departement Mathematik
ETH-Zentrum, HG E 66.2
Rämistrasse 101
8092 Zürich
Switzerland
email: [first name].[last name]@math.ethz.ch
phone: +41 44 632 8273


Research
I am interested in probability and its applications. I have been recently working on critical and near critical percolation, invasion percolation, random interlacements. I am currently a postdoc with Prof. Alain-Sol Sznitman. My research is supported by the ERC project RWPERCRI: Random Walks, Percolation and Random Interlacements.
Workshop announcement
If you are curious about mathematical aspects of two-dimensional statistical mechanics, check out the next Young European Probabilists workshop on "Two-dimensional statistical mechanics", taking place at Eurandom, Eindhoven, from 27 February - 2 March, 2012.
Teaching
In Spring semester 2012, I am teaching a graduate course "Special topics in probability: Random interlacements" together with Alex Drewitz and Balazs Rath.
Publications
2012
Balazs Rath and Artem Sapozhnikov. The effect of small quenched noise on connectivity properties of random interlacements.
Submitted.
Remco van der Hofstad and Artem Sapozhnikov. Cycle structure of percolation on high-dimensional tori.
Submitted.
Michael Damron and Artem Sapozhnikov. Limit theorems for 2D invasion percolation.
Annals of Probability, 40, 893-920.
Balazs Rath and Artem Sapozhnikov. Connectivity properties of random interlacement and intersection of random walks.
ALEA Latin American Journal of Probability and Mathematical Statistics, 9, 67-83.
2011
Artem Sapozhnikov. The incipient infinite cluster does not stochastically dominate the invasion percolation cluster in two dimensions.
Electronic Communications in Probability, 16, 775-780.
Balazs Rath and Artem Sapozhnikov. On the transience of random interlacements.
Electronic Communications in Probability, 16, 379-391.
Michael Damron and Artem Sapozhnikov. Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters.
Probability Theory and Related Fields, 150(1-2), 257-294.
2010
Artem Sapozhnikov. Upper bound on the expected size of the intrinsic ball.
Electronic Communications in Probability, 15, 297-298.
2009
Michael Damron, Artem Sapozhnikov and Balint Vágvölgyi. Relations between invasion percolation and critical percolation in two dimensions.
Annals of Probability, 37(6), 2297-2331.
2008
Bernardo N.B. de Lima and Artem Sapozhnikov. On the truncated long-range percolation on Z2.
Journal of Applied Probability, 45(1), 287-291.
Ken R. Duffy, Neil O'Connell and Artem Sapozhnikov. Complexity analysis of a decentralised graph colouring algorithm.
Information Processing Letters, 107(2), 60-63.
Ken R. Duffy and Artem Sapozhnikov. The large deviation principle for the on-off Weibull sojourn process.
Journal of Applied Probability, 45(1), 107-117.
Marc van Dongen, Ton Dieker and Artem Sapozhnikov. The expected value and the variance of the checks required by revision algorithms.
Constraint Programming Letters, 2, 55-77.
Artem Sapozhnikov. Convergence rates in the local renewal theorem.
Statistics and Probability Letters, 78(14), 2230-2233.
2007
Artem Sapozhnikov. Existence of phase transition for heavy-tailed continuum percolation.
Markov Processes and Related Fields, 13(3), 575-586.
2006
Denis Denisov and Artem Sapozhnikov. On the distribution of the number of customers in the symmetric M/G/1 queue.
Queueing Systems: Theory and Applications, 54(4), 237-241.
Serguei Foss and Artem Sapozhnikov. Convergence rates in monotone separable stochastic networks.
Queueing Systems: Theory and Applications, 52(2), 125-137.
2004
Serguei Foss and Artem Sapozhnikov. On the existence of moments for the busy period in a single-server queue.
Mathematics of Operations Research, 29(3), 592-601.