کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5777186 1632572 2017 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Lattice paths with catastrophes
ترجمه فارسی عنوان
مسیرهای شبکه با فاجعه
کلمات کلیدی
مسیر شبکه تابع تولید، عملکرد جبری، روش هسته، دستور زبان بدون متن،
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
چکیده انگلیسی

In queuing theory, it is usual to have some models with a “reset” of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not have the same intuitive probabilistic behavior like classical Dyck paths (the typical properties of which are strongly related to Brownian motion theory), and this article quantifies some relations between these two types of paths. We give a bijection with some other lattice paths and a link with a continuous fraction expansion, and prove several formulae for related combinatorial structures conjectured in the On-line Encyclopedia of Integer Sequences. Thanks to the kernel method and via analytic combinatorics, we derive the enumeration and limit laws of these “lattice paths with catastrophes”, for any finite set of jumps.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 59, June 2017, Pages 131-146
نویسندگان
, ,