Random Geometric Graphs
Mei 2003 · Oxford Studies in Probability Boek 2 · OUP Oxford
E-boek
344
Bladsye
family_home
Geskik
info
reportGraderings en resensies word nie geverifieer nie. Kom meer te wete
Meer oor hierdie e-boek
This monograph sets out a body of mathematical theory for finite graphs with nodes placed randomly in Euclidean space and edges added to connect points that are close to each other. As an alternative to classical random graph models, these geometric graphs are relevant to the modelling of real-world networks having spatial content, arising in numerous applications such as wireless communications, parallel processing, classification, epidemiology, astronomy, and the internet. Aimed at graduate students and researchers in probability, combinatorics, statistics, and theoretical computer science, it covers topics such as edge and component counts, vertex degrees, cliques, colourings, connectivity, giant component phenomena, vertex ordering and partitioning problems. It also illustrates and extends the application to geometric probability of modern techniques including Stein's method, martingale methods and continuum percolation.
Gradeer hierdie e-boek
Sê vir ons wat jy dink.
Lees inligting
Slimfone en tablette
Installeer die Google Play Boeke-app vir Android en iPad/iPhone. Dit sinkroniseer outomaties met jou rekening en maak dit vir jou moontlik om aanlyn of vanlyn te lees waar jy ook al is.
Skootrekenaars en rekenaars
Jy kan jou rekenaar se webblaaier gebruik om na oudioboeke wat jy op Google Play gekoop het, te luister.
E-lesers en ander toestelle
Om op e-inktoestelle soos Kobo-e-lesers te lees, moet jy ’n lêer aflaai en dit na jou toestel toe oordra. Volg die gedetailleerde hulpsentrumaanwysings om die lêers na ondersteunde e-lesers toe oor te dra.
