Persons: Foss, Sergei Georgievich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Foss, Sergei Georgievich

Statistics Math-Net.Ru
Total publications:	32
Scientific articles:	30
Presentations:	5

Number of views:
This page:	4956
Abstract pages:	8306
Full texts:	2760
References:	652

Professor

Doctor of physico-mathematical sciences (1992)

Speciality:

01.01.05 (Probability theory and mathematical statistics)

Birth date:

23.09.1953

E-mail:

Website:

https://math.nsc.ru/LBRT/v1/foss/

Keywords:

stability, heavy tails, random graphs, communications networks.

Subject:

methods for stability of stochastic processes, heavy-tailed distributions, directed random graphs, finite and infinite communication and information transmission stochastic networks

Main publications:

A. Sankararaman, F. Baccelli, S Foss, “Interference queueing networks on grids”, The Annals of Applied Probability, 29:5 (2019), 2929–2987
S. Foss, J. Martin, P. Schmidt, “Long-range last-passage percolation on the line”, The Annals of Applied Probability, 24:1 (2014), 198–234
S. Foss, D. Korshunov, “Lower limits and equivalences for convolution tails”, The Annals of Probability, 35:1 (2007), 366–383
S. Foss, S. Zachary, “The maximum on a random time interval of a random walk with long-tailed increments and negative drift”, The Annals of Applied Probability, 13:1 (2003), 37–53
S. Foss, G. Last, “Stability of polling systems with exhaustive service policies and state-dependent routing”, The Annals of Applied Probability, 6:1 (1996), 116–137

https://www.mathnet.ru/eng/person19362

List of publications on Google Scholar

https://zbmath.org/authors/?q=ai:foss.sergey-g

https://mathscinet.ams.org/mathscinet/MRAuthorID/199582

https://elibrary.ru/author_items.asp?authorid=5286

	Publications in Math-Net.Ru	Citations
	2022
1.	P. I. Tesemnivkov, S. G. Foss, “The Probability of Reaching a Receding Boundary by a Branching Random Walk with Fading Branching and Heavy-Tailed Jump Distribution”, Trudy Mat. Inst. Steklova, 316 (2022), 336–354 ; Proc. Steklov Inst. Math., 316 (2022), 318–335
	2021
2.	T. Konstantopoulos, A. V. Logachov, A. A. Mogulskii, S. G. Foss, “Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges”, Probl. Peredachi Inf., 57:2 (2021), 71–89 ; Problems Inform. Transmission, 57:2 (2021), 161–177
3.	A. Sakhanenko, S. Foss, “On representations and simulation of conditioned random walks on integer lattices”, Sib. Èlektron. Mat. Izv., 18:2 (2021), 1556–1571
4.	S. G. Foss, M. G. Chebunin, “Harris ergodicity of a Split Transmission Control Protocol”, Sib. Èlektron. Mat. Izv., 18:2 (2021), 1493–1505
	2019
5.	M. G. Chebunin, S. G. Foss, “On stability of multiple access systems with minimal feedback”, Sib. Èlektron. Mat. Izv., 16 (2019), 1805–1821
	2017
6.	A. I. Sakhanenko, S. G. Foss, “On a structure of a conditioned random walk on the integers with bounded local times”, Sib. Èlektron. Mat. Izv., 14 (2017), 1265–1278	1
	2016
7.	S. G. Foss, B. Hajek, A. M. Turlikov, “Doubly randomized protocols for a random multiple access channel with “success–nonsuccess” feedback”, Probl. Peredachi Inf., 52:2 (2016), 61–71 ; Problems Inform. Transmission, 52:2 (2016), 156–165	4
8.	S. Foss, D. Kim, A. Turlikov, “Stability and instability of a random multiple access model with adaptive energy harvesting”, Sib. Èlektron. Mat. Izv., 13 (2016), 16–25
	2014
9.	D. K. Kim, A. M. Turlikov, S. G. Foss, “Random multiple access with common energy harvesting mechanism”, Sib. Èlektron. Mat. Izv., 11 (2014), 896–905
	2010
10.	A. M. Turlikov, S. G. Foss, “On ergodic algorithms in random multiple access systems with “success-failure” feedback”, Probl. Peredachi Inf., 46:2 (2010), 91–109 ; Problems Inform. Transmission, 46:2 (2010), 184–200	3
	2007
11.	S. G. Foss, “On Exact Asymptotics for a Stationary Sojourn Time Distribution in a Tandem of Queues with Light-Tailed Service Times”, Probl. Peredachi Inf., 43:4 (2007), 93–108 ; Problems Inform. Transmission, 43:4 (2007), 353–366	6
12.	D. É. Denisov, D. A. Korshunov, S. G. Foss, “Lower Limits for Distribution Tails of Randomly Stopped Sums”, Teor. Veroyatnost. i Primenen., 52:4 (2007), 794–802 ; Theory Probab. Appl., 52:4 (2008), 690–699	10
	2006
13.	S. Zachary, S. G. Foss, “On the exact distributional asymptotics for the supremum of a random walk with increments in a class of light-tailed distributions”, Sibirsk. Mat. Zh., 47:6 (2006), 1265–1274 ; Siberian Math. J., 47:6 (2006), 1034–1041	11
	2005
14.	A. P. Kovalevskii, V. A. Topchii, S. G. Foss, “On Stability of a Queueing System with Continuum Branching Fluid Limits”, Probl. Peredachi Inf., 41:3 (2005), 76–104 ; Problems Inform. Transmission, 41:3 (2005), 254–279	6
	2003
15.	D. É. Denisov, S. G. Foss, “On transience conditions for Markov chains and random walks”, Sibirsk. Mat. Zh., 44:1 (2003), 53–68 ; Siberian Math. J., 44:1 (2003), 44–57	2
	2001
16.	S. G. Foss, N. I. Chernova, “On optimality of the FCFS discipline in multiserver queueing systems and networks”, Sibirsk. Mat. Zh., 42:2 (2001), 434–450 ; Siberian Math. J., 42:2 (2001), 372–385	18
17.	S. G. Foss, D. É. Denisov, “On transience conditions for Markov chains”, Sibirsk. Mat. Zh., 42:2 (2001), 425–433 ; Siberian Math. J., 42:2 (2001), 364–371	11
	1999
18.	A. A. Borovkov, S. G. Foss, “Estimates for overshooting an arbitrary boundary by a random walk and their applications”, Teor. Veroyatnost. i Primenen., 44:2 (1999), 249–277 ; Theory Probab. Appl., 44:2 (2000), 231–253	18
	1996
19.	S. G. Foss, N. I. Chernova, “Dominance Theorems and Ergodic Properties of Polling Systems”, Probl. Peredachi Inf., 32:4 (1996), 46–71 ; Problems Inform. Transmission, 32:4 (1996), 342–364	8
20.	S. G. Foss, N. I. Chernova, “On polling systems with infinitely many stations”, Sibirsk. Mat. Zh., 37:4 (1996), 940–956 ; Siberian Math. J., 37:4 (1996), 832–846	7
	1993
21.	A. A. Borovkov, S. G. Foss, “Stochastically recursive sequences and their generalizations”, Trudy Inst. Mat. SO RAN, 20 (1993), 32–103
	1991
22.	S. G. Foss, N. I. Chernova, “Ergodicity of Partially Accessible Multichannel Communication Systems”, Probl. Peredachi Inf., 27:2 (1991), 9–14 ; Problems Inform. Transmission, 27:2 (1991), 94–99	1
23.	S. G. Foss, “Ergodicity of queueing networks”, Sibirsk. Mat. Zh., 32:4 (1991), 184–203 ; Siberian Math. J., 32:4 (1991), 690–705	6
	1989
24.	S. G. Foss, “Some Properties of Open Queueing Networks”, Probl. Peredachi Inf., 25:3 (1989), 90–97 ; Problems Inform. Transmission, 25:3 (1989), 241–246
	1985
25.	S. G. Foss, “A method for estimation of the rate of convergence in ergodicity and continuity theorems for multichannel queueing systems”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 5 (1985), 126–137
	1983
26.	S. G. Foss, “Ergodicity conditions in multiserver queueing systems with waiting time”, Sibirsk. Mat. Zh., 24:6 (1983), 168–175 ; Siberian Math. J., 24:6 (1983), 961–968	4
	1982
27.	S. G. Foss, “Systems with several types of customers”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 1 (1982), 186–201
	1981
28.	S. G. Foss, “Comparison of servicing strategies in multichannel queueing systems”, Sibirsk. Mat. Zh., 22:1 (1981), 190–197 ; Siberian Math. J., 22:1 (1981), 142–147	11
	1980
29.	S. G. Foss, “Approximation of multichannel queueing systems”, Sibirsk. Mat. Zh., 21:6 (1980), 132–140 ; Siberian Math. J., 21:6 (1981), 851–857	16
	1978
30.	B. A. Rogozin, S. G. Foss, “The recurrency of oscillating random walks”, Teor. Veroyatnost. i Primenen., 23:1 (1978), 161–169 ; Theory Probab. Appl., 23:1 (1978), 155–162	12

	2006
31.	N. N. Vakhania, I. A. Ibragimov, V. P. Maslov, Yu. V. Prokhorov, B. A. Sevast'yanov, Ya. G. Sinai, D. M. Chibisov, A. N. Shiryaev, I. S. Borisov, V. I. Lotov, A. A. Mogul'skii, S. G. Foss, “To the 75th birthday of A. A. Borovkov”, Teor. Veroyatnost. i Primenen., 51:2 (2006), 257–259 ; Theory Probab. Appl., 51:2 (2007), 225–226
	2001
32.	I. S. Borisov, I. A. Ibragimov, V. I. Lotov, A. A. Mogul'skii, Yu. V. Prokhorov, S. G. Foss, “Aleksandr Alekseevich Borovkov (on his 70th birthday)”, Uspekhi Mat. Nauk, 56:5(341) (2001), 202–204 ; Russian Math. Surveys, 56:5 (2001), 1009–1012	1

Presentations in Math-Net.Ru

1.	Upper and Lower Bounds for the Tail Probabilities in a Branching Random Walk with Heavy-Tailed Distributions of Jumps Pavel Tesemnikov, Sergei Foss Borovkov Meeting August 25, 2022 13:30
2.	Branching processes with immigration in atypical random environment Sergey Foss, Dmitry Korshunov, Zbigniew Palmowski International Conference "Theory of Probability and Its Applications: P. L. Chebyshev – 200" (The 6th International Conference on Stochastic Methods) May 19, 2021 18:00
3.	Longest and heaviest paths in barak-erdos directed random graphs and related models S. G. Foss Dobrushin Mathematics Laboratory Seminar April 20, 2021 16:00
4.	Пути наибольшей длины и с наибольшим весом в направленных графах Барака–Эрдёша и близких моделях S. G. Foss Seminar on Probability Theory and Mathematical Statistics February 12, 2021 18:00
5.	«Жадный сервер» под пуассоновским дождем и «пылесос» в пуассоновском поле — открытые проблемы и частичные решения S. G. Foss Seminar on Probability Theory and Mathematical Statistics December 6, 2011 18:00

Organisations

Registration to the website

Logotypes