02173nam0 22004933i 450 VAN018971320230613092420.991N978331969438220210721d2017 |0itac50 baengCH|||| |||||Maximum-Entropy NetworksPattern Detection, Network Reconstruction and Graph CombinatoricsTiziano Squartini, Diego GarlaschelliChamSpringer2017xii, 116 p.ill.24 cm001VAN01093072001 SpringerBriefs in Complexity210 Cham [etc.]SpringerVAN0189715Maximum-Entropy Networks258711282-XXStatistical mechanics, structure of matter [MSC 2020]VANC021931MF05C80Random graphs (graph-theoretic aspects) [MSC 2020]VANC023669MF93E12Identification in stochastic control theory [MSC 2020]VANC036699MFBinary networksKW:KBootstrap methodsKW:KComplex NetworksKW:KDegree-corrected gravity modelKW:KDirected networksKW:KDyadic motifsKW:KEnhanced configuration modelKW:KMaximum likelihood estimationKW:KMaximum-entropy EnsemblesKW:KTriadic motifsKW:KUndirected networksKW:KWeighted networksKW:KCHChamVANL001889SquartiniTizianoVANV168791823091GarlaschelliDiegoVANV168792823092Springer <editore>VANV108073650ITSOL20240614RICAhttp://doi.org/10.1007/978-3-319-69438-2E-book – Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o ShibbolethBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICAIT-CE0120VAN08NVAN0189713BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA08CONS e-book 3184 08eMF3184 20210721 Maximum-Entropy Networks2587112UNICAMPANIA