LEADER 01384nam0-22003611i-450- 001 990001865020403321 005 20081020151838.0 035 $a000186502 035 $aFED01000186502 035 $a(Aleph)000186502FED01 035 $a000186502 100 $a20030910d1965----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $ay-------001yy 200 1 $aIndagini comparative su Javesella pellucida (Fabricius) e Laodelphax striatellus (Fallen) quali vettori del Virus delnanismo ruvido del mais (Maize rough dwarf virus)$fIsaac Harpaz, Carlo Vidano, Osvaldo Lovisolo, Maurizio Conti 210 $aTorino$c[s.n.]$d1965 215 $ap. 885-901$d25 cm 225 1 $aRaccolta di memorie$fUniversitą degli studi di Torino. Facoltą di scienze agrarie$v452 300 $aEstr. da: Atti della Accademia delle Scienze di Torino, 1964-1965. 610 0 $aEntomologia 676 $a595.7 702 1$aHarpaz,$bIsaac 702 1$aVidano,$bCarlo 702 1$aLovisolo,$bOsvaldo 702 1$aConti,$bMaurizio 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990001865020403321 952 $a60 MISC. B 131/452$fFAGBC 959 $aFAGBC 996 $aIndagini comparative su Javesella pellucida (Fabricius) e Laodelphax striatellus (Fallen) quali vettori del Virus delnanismo ruvido del mais (Maize rough dwarf virus$9401556 997 $aUNINA LEADER 01152nam a2200277 i 4500 001 991002594889707536 008 140924s2010 it |||| 00| | ita d 020 $a9788843057528 035 $ab14200508-39ule_inst 040 $aDip.to di Storia, Societą e Studi sull'Uomo$bita 082 0 $a362.9450684 100 1 $aBusso, Sandro$0511829 245 12$aL'informazione nelle politiche sociali :$bmodelli teorici, processi di legittimazione e dinamiche organizzative /$cSandro Buso 260 $aRoma :$bCarocci,$c2010 300 $a178 p. :$bill. ;$c22 cm 490 1 $aBiblioteca di testi e studi ;$v626. Sociologia 490 1 $aSerie Opera prima 650 04$aServizi sociali$xSistemi informativi 830 0$aBiblioteca di testi e studi (Carocci).$pSociologia 830 0$aBiblioteca di testi e studi (Carocci) ;$v626 907 $a.b14200508$b19-12-18$c24-09-14 912 $a991002594889707536 945 $aLE021SOC27E34$g1$i2021000252006$lle021$o-$pE20.50$q-$rl$s- $t0$u0$v0$w0$x0$y.i15635478$z02-10-14 996 $aInformazione nelle politiche sociali$9763959 997 $aUNISALENTO 998 $ale021$b24-09-14$cm$da $e-$fita$git $h2$i0 LEADER 04326nam 2200613 450 001 9910830265703321 005 20170816115247.0 010 $a1-118-03271-3 010 $a1-118-03096-6 035 $a(CKB)2670000000128016 035 $a(EBL)694693 035 $a(OCoLC)761319793 035 $a(SSID)ssj0000597345 035 $a(PQKBManifestationID)11362556 035 $a(PQKBTitleCode)TC0000597345 035 $a(PQKBWorkID)10577672 035 $a(PQKB)10849474 035 $a(MiAaPQ)EBC694693 035 $a(PPN)197022111 035 $a(EXLCZ)992670000000128016 100 $a20160816h20002000 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aRandom graphs /$fSvante Janson, Tomasz Luczak, Andrzej Rucinski 210 1$aNew York, New York :$cJohn Wiley & Sons, Inc.,$d2000. 210 4$d©2000 215 $a1 online resource (350 p.) 225 1 $aWiley-Interscience Series in Discrete Mathematics and Optimization 300 $a"A Wiley-Interscience Publication." 311 $a0-471-17541-2 320 $aIncludes bibliographical references and indexes. 327 $aRandom Graphs; Preface; Contents; 1 Preliminaries; 1.1 Models of random graphs; 1.2 Notes on notation and more; 1.3 Monotonicity; 1.4 Asymptotic equivalence; 1.5 Thresholds; 1.6 Sharp thresholds; 2 Exponentially Small Probabilities; 2.1 Independent summands; 2.2 Binomial random subsets; 2.3 Suen's inequality; 2.4 Martingales; 2.5 Talagrand's inequality; 2.6 The upper tail; 3 Small Subgraphs; 3.1 The containment problem; 3.2 Leading overlaps and the subgraph plot; 3.3 Subgraph count at the threshold; 3.4 The covering problem; 3.5 Disjoint copies; 3.6 Variations on the theme; 4 Matchings 327 $a4.1 Perfect matchings4.2 G-factors; 4.3 Two open problems; 5 The Phase Transition; 5.1 The evolution of the random graph; 5.2 The emergence of the giant component; 5.3 The emergence of the giant: A closer look; 5.4 The structure of the giant component; 5.5 Near the critical period; 5.6 Global properties and the symmetry rule; 5.7 Dynamic properties; 6 Asymptotic Distributions; 6.1 The method of moments; 6.2 Stein's method: The Poisson case; 6.3 Stein's method: The normal case; 6.4 Projections and decompositions; 6.5 Further methods; 7 The Chromatic Number; 7.1 The stability number 327 $a7.2 The chromatic number: A greedy approach7.3 The concentration of the chromatic number; 7.4 The chromatic number of dense random graphs; 7.5 The chromatic number of sparse random graphs; 7.6 Vertex partition properties; 8 Extremal and Ramsey Properties; 8.1 Heuristics and results; 8.2 Triangles: The first approach; 8.3 The Szemere?di Regularity Lemma; 8.4 A partition theorem for random graphs; 8.5 Triangles: An approach with perspective; 9 Random Regular Graphs; 9.1 The configuration model; 9.2 Small cycles; 9.3 Hamilton cycles; 9.4 Proofs; 9.5 Contiguity of random regular graphs 327 $a9.6 A brief course in contiguity10 Zero-One Laws; 10.1 Preliminaries; 10.2 Ehrenfeucht games and zero-one laws; 10.3 Filling gaps; 10.4 Sums of models; 10.5 Separability and the speed of convergence; References; Index of Notation; Index 330 $aA unified, modern treatment of the theory of random graphs-including recent results and techniquesSince its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the 410 0$aWiley-Interscience series in discrete mathematics and optimization. 606 $aRandom graphs 615 0$aRandom graphs. 676 $a511.5 676 $a511/.5 700 $aJanson$b Svante$0736482 702 $a?uczak$b Tomasz$f1963- 702 $aRucin?ski$b Andrzej 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910830265703321 996 $aRandom graphs$93981188 997 $aUNINA