Journal Article10.2307/3613273
An Introduction to Probability Theory and Its Applications. Volume II By William Feller. Pp. xviii, 626. 90s. 1966. (Wiley)
538
About: This article is published in The Mathematical Gazette. The article was published on 01 Oct 1967.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Probability theory : the logic of science
TL;DR: In this article, a survey of elementary applications of probability theory can be found, including the following: 1. Plausible reasoning 2. The quantitative rules 3. Elementary sampling theory 4. Elementary hypothesis testing 5. Queer uses for probability theory 6. Elementary parameter estimation 7. The central, Gaussian or normal distribution 8. Sufficiency, ancillarity, and all that 9. Repetitive experiments, probability and frequency 10. Advanced applications: 11. Discrete prior probabilities, the entropy principle 12. Simple applications of decision theory 15.
5.9K
•Book
Random walks and electric networks
Peter G. Doyle,J. Laurie Snell +1 more
- 01 Dec 1984
TL;DR: The goal will be to interpret Polya’s beautiful theorem that a random walker on an infinite street network in d-dimensional space is bound to return to the starting point when d = 2, but has a positive probability of escaping to infinity without returning to the Starting Point when d ≥ 3, and to prove the theorem using techniques from classical electrical theory.
Wide-area traffic: the failure of Poisson modeling
Vern Paxson,Sally Floyd +1 more
- 01 Oct 1994
TL;DR: It is found that user-initiated TCP session arrivals, such as remote-login and file-transfer, are well-modeled as Poisson processes with fixed hourly rates, but that other connection arrivals deviate considerably from Poisson.
•Book
Stochastic Geometry and Wireless Networks: Volume I Theory
François Baccelli,Bartłlomiej Błlaszczyszyn +1 more
- 24 Sep 2009
TL;DR: Volume I first provides a compact survey on classical stochastic geometry models, with a main focus on spatial shot-noise processes, coverage processes and random tessellations, which is the basis for the modeling of wireless network protocols and architectures considered in Volume II.
Random Graphs and Complex Networks
Remco van der Hofstad
- 01 Jan 2017
TL;DR: This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.
References
Edgeworth series approximation for chi-square type chance constraints
Mehmet Yilmaz
- 01 Jan 1999
TL;DR: In this article, the authors introduce two methods for approximation to distribution of weighted sum of chi-square random variables, which can be more use-ful than the known methods in literature to transform Chi-square type chance constrained programming (CCP) problem into deterministic problem.
Queue-length distributions for multi-priority queueing systems
John N. Daigle,Matthew Roughan +1 more
- 21 Mar 1999
TL;DR: A method is presented of obtaining the occupancy distribution from the PGF and its validity is demonstrated by obtaining the occupation distributions for a number of cases, including those with regularly varying service time distributions.
6
DeepKøver: An Adaptive Intelligent Assistance System for Monitoring Impaired People in Smart Homes
Mehdi Najjar,François Courtemanche,Habib Hamam,Alexandre Dion,Jérémy Bauchet,André Mayers +5 more
- 01 Jan 2011
TL;DR: The chapter presents a novel modular adaptive artful intelligent assistance system for cognitively and/ or memory impaired people engaged in the realisation of their activities of daily living (ADLs) to provide logistic support in achieving their ADLs.
6
•Journal Article
An Algebraic Framework for Defining Random Concurrent Behaviours
TL;DR: The paper is devoted to characterizing systems with random behaviours by considering systems in terms of their possible runs, called processes, where each process is represented by a pomset in an intrinsic, global time independent way and can possibly be obtained by composing sequentially and in parallel other processes.
6