Böcker av Nikolaos Limnios

This textbook presents the basics of probability and statistical estimation, with a view to applications. The didactic presentation follows a path of increasing complexity with a constant concern for pedagogy, from the most classical formulas of probability theory to the asymptotics of independent random sequences and an introduction to inferential statistics. The necessary basics on measure theory are included to ensure the book is self-contained. Illustrations are provided from many applied fields, including information theory and reliability theory. Numerous examples and exercises in each chapter, all with solutions, add to the main content of the book.Written in an accessible yet rigorous style, the book is addressed to advanced undergraduate students in mathematics and graduate students in applied mathematics and statistics. It will also appeal to students and researchers in other disciplines, including computer science, engineering, biology, physics and economics, who are interested in a pragmatic introduction to the probability modeling of random phenomena.

The aim of this book is to reflect the current cutting-edge thinking and established practices in the investigation of queueing systems and networks.This first volume includes ten chapters written by experts well-known in their areas. The book studies the analysis of queues with interdependent arrival and service times, characteristics of fluid queues, modifications of retrial queueing systems and finite-source retrial queues with random breakdowns, repairs and customers' collisions. Some recent tendencies in the asymptotic analysis include the average and diffusion approximation of Markov queueing systems and networks, the diffusion and Gaussian limits of multi-channel queueing networks with rather general input flow, and the analysis of two-time-scale nonhomogenous Markov chains using the large deviations principle.The book also analyzes transient behavior of infinite-server queueing models with a mixed arrival process, the strong stability of queueing systems and networks, and applications of fast simulation methods for solving high-dimension combinatorial problems.