Probability Approximations via the Poisson Clumping Heuristic: 77 (Applied Mathematical Sciences, 77) - Tapa dura

Aldous, David

 
9780387968995: Probability Approximations via the Poisson Clumping Heuristic: 77 (Applied Mathematical Sciences, 77)
Tapa dura
ISBN 10: 0387968997 ISBN 13: 9780387968995
Editorial: Springer, 1988

Sinopsis

If you place a large number of points randomly in the unit square, what is the distribution of the radius of the largest circle containing no points? Of the smallest circle containing 4 points? Why do Brownian sample paths have local maxima but not points of increase, and how nearly do they have points of increase? Given two long strings of letters drawn i. i. d. from a finite alphabet, how long is the longest consecutive (resp. non-consecutive) substring appearing in both strings? If an imaginary particle performs a simple random walk on the vertices of a high-dimensional cube, how long does it take to visit every vertex? If a particle moves under the influence of a potential field and random perturbations of velocity, how long does it take to escape from a deep potential well? If cars on a freeway move with constant speed (random from car to car), what is the longest stretch of empty road you will see during a long journey? If you take a large i. i. d. sample from a 2-dimensional rotationally-invariant distribution, what is the maximum over all half-spaces of the deviation between the empirical and true distributions? These questions cover a wide cross-section of theoretical and applied probability. The common theme is that they all deal with maxima or min­ ima, in some sense.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

If you place a large number of points randomly in the unit square, what is the distribution of the radius of the largest circle containing no points? Of the smallest circle containing 4 points? Why do Brownian sample paths have local maxima but not points of increase, and how nearly do they have points of increase? Given two long strings of letters drawn i. i. d. from a finite alphabet, how long is the longest consecutive (resp. non-consecutive) substring appearing in both strings? If an imaginary particle performs a simple random walk on the vertices of a high-dimensional cube, how long does it take to visit every vertex? If a particle moves under the influence of a potential field and random perturbations of velocity, how long does it take to escape from a deep potential well? If cars on a freeway move with constant speed (random from car to car), what is the longest stretch of empty road you will see during a long journey? If you take a large i. i. d. sample from a 2-dimensional rotationally-invariant distribution, what is the maximum over all half-spaces of the deviation between the empirical and true distributions? These questions cover a wide cross-section of theoretical and applied probability. The common theme is that they all deal with maxima or min­ ima, in some sense.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
1988
Idioma
Inglés
ISBN 10 
0387968997
ISBN 13 
9780387968995
Encuadernación
Tapa dura
Número de páginas
292
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9781441930880: Probability Approximations via the Poisson Clumping Heuristic: 77 (Applied Mathematical Sciences)

Edición Destacada

ISBN 10:  1441930884 ISBN 13:  9781441930880
Editorial: Springer, 2010
Tapa blanda