



LEADER 
02496nmm a2200313 u 4500 
001 
EB000618273 
003 
EBX01000000000000000471355 
005 
00000000000000.0 
007 
cr 
008 
140122  eng 
020 


a 9781461207191

100 
1 

a Aldous, David
e [editor]

245 
0 
0 
a Random Discrete Structures
h Elektronische Ressource
c edited by David Aldous, Robin Pemantle

250 


a 1st ed. 1996

260 


a New York, NY
b Springer New York
c 1996, 1996

300 


a XVIII, 225 p
b online resource

505 
0 

a Probability distributions on cladograms  Stability of selforganizing processes  Some examples of normal approximations by Stein’s method  Large deviations for random distribution of mass  Random minimax game tress  Metrics on compositions and coincidences among renewal sequences  The no long odd cycle theorem for completely positive matrices  A note on trianglefree graphs  Intersections and limits of regenerative sets  Random processes of the form Xn+1 = anXn + bn (mod p) where bn takes on a single value  The second moment method, conditioning and approximation  How fast and where does a random walker move on a random tree?  A note on recurrence, amenability, and the universal cover of graphs  On which graphs are all random walks in random environments transient?  Energy, and intersections of Markov chains

653 


a Probability Theory

653 


a Discrete Mathematics

653 


a Discrete mathematics

653 


a Probabilities

700 
1 

a Pemantle, Robin
e [editor]

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a The IMA Volumes in Mathematics and its Applications

028 
5 
0 
a 10.1007/9781461207191

856 
4 
0 
u https://doi.org/10.1007/9781461207191?nosfx=y
x Verlag
3 Volltext

082 
0 

a 519.2

520 


a The articles in this volume present the state of the art in a variety of areas of discrete probability, including random walks on finite and infinite graphs, random trees, renewal sequences, Stein's method for normal approximation and Kohonentype selforganizing maps. This volume also focuses on discrete probability and its connections with the theory of algorithms. Classical topics in discrete mathematics are represented as are expositions that condense and make readable some recent work on Markov chains, potential theory and the second moment method. This volume is suitable for mathematicians and students
