Random Geometric Graphs
may, 2003 · Oxford Studies in Probability 2-kitob · OUP Oxford
E-kitob
344
Sahifalar soni
family_home
Yaroqli
info
reportReytinglar va sharhlar tasdiqlanmagan Batafsil
Bu e-kitob haqida
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.
Bu e-kitobni baholang
Fikringizni bildiring.
Qayerda o‘qiladi
Smartfonlar va planshetlar
Android va iPad/iPhone uchun mo‘ljallangan Google Play Kitoblar ilovasini o‘rnating. U hisobingiz bilan avtomatik tazrda sinxronlanadi va hatto oflayn rejimda ham kitob o‘qish imkonini beradi.
Noutbuklar va kompyuterlar
Google Play orqali sotib olingan audiokitoblarni brauzer yordamida tinglash mumkin.
Kitob o‘qish uchun mo‘ljallangan qurilmalar
Kitoblarni Kobo e-riderlar kabi e-siyoh qurilmalarida oʻqish uchun faylni yuklab olish va qurilmaga koʻchirish kerak. Fayllarni e-riderlarga koʻchirish haqida batafsil axborotni Yordam markazidan olishingiz mumkin.
