02826nam 2200445 450 991081394810332120230105202201.090-04-41405-310.1163/9789004414051(CKB)4920000000126907(nllekb)BRILL9789004414051(MiAaPQ)EBC5992933(EXLCZ)99492000000012690720191227d2020 uy 0engurun| uuuuatxtrdacontentcrdamediardacarrierGrammaticalising the perfect and explanations of language change have- and be-perfects in the history and structure of English and Bulgarian /by Bozhil HristovLeiden, The Netherlands ;Boston :Brill,[2020]©20201 online resourceBrill's studies in historical linguistics ;Volume 1090-04-41432-0 Includes bibliographical references and index.Introduction -- Theoretical preliminaries -- The story of the English perfect -- The development of the perfect in a selection of Old English texts -- Further development of the perfect based on a selection of texts from Middle to Modern English -- How things could have been: a glance at German -- The perfect in the history and structure of Bulgarian -- The development of the perfect in a selection of Middle and Modern Bulgarian texts -- Conclusions.In Grammaticalising the Perfect and Explanations of Language Change: Have- and Be-Perfects in the History and Structure of English and Bulgarian, Bozhil Hristov investigates key aspects of the verbal systems of two distantly related Indo-European languages, highlighting similarities as well as crucial differences between them and seeking a unified approach. The book reassesses some long-held notions and functionalist assumptions and shines the spotlight on certain areas that have received less attention, such as the role of ambiguity in actual usage. The detailed analysis of rich, contextualised material from a selection of texts dovetails with large-scale corpus studies, complementing their findings and enhancing our understanding of the phenomena. This monograph thus presents a happy marriage of traditional philological techniques and recent advances in theoretical linguistics and corpus work.Brill's studies in historical linguistics ;Volume 10.English languageTenseEnglish languageTense.425/.62Hristov Bozhil1984-1707998MiAaPQMiAaPQMiAaPQBOOK9910813948103321Grammaticalising the perfect and explanations of language change4096660UNINA05219nam 22006855 450 991025458630332120201223092515.03-319-69438-310.1007/978-3-319-69438-2(CKB)4340000000223490(DE-He213)978-3-319-69438-2(MiAaPQ)EBC5153635(PPN)221253009(EXLCZ)99434000000022349020171121d2017 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierMaximum-Entropy Networks Pattern Detection, Network Reconstruction and Graph Combinatorics /by Tiziano Squartini, Diego Garlaschelli1st ed. 2017.Cham :Springer International Publishing :Imprint: Springer,2017.1 online resource (XII, 116 p. 34 illus., 31 illus. in color.) Understanding Complex Systems,2191-53263-319-69436-7 Includes bibliographical references at the end of each chapters and index.Introduction -- Maximum-entropy ensembles of graphs -- Constructing constrained graph ensembles: why and how? -- Comparing models obtained from different constraints -- Pattern detection -- Detecting assortativity and clustering -- Detecting dyadic motifs -- Detecting triadic motifs -- Some extensions to weighted networks -- Network reconstruction -- Reconstructing network properties from partial information -- The Enhanced Configuration Model -- Further reducing the observational requirements -- Graph combinatorics -- A dual route to combinatorics? -- ‘Soft’ combinatorial enumeration -- Quantifying ensemble (non)equivalence -- Breaking of equivalence between ensembles -- Implications of (non)equivalence for combinatorics -- “What then shall we choose?” Hardness or softness? -- Concluding remarks.This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications. Its original contribution is the reformulation of many seemingly different problems in the study of both real networks and graph theory within the unified framework of maximum entropy. Particular emphasis is put on the detection of structural patterns in real networks, on the reconstruction of the properties of networks from partial information, and on the enumeration and sampling of graphs with given properties.  After a first introductory chapter explaining the motivation, focus, aim and message of the book, chapter 2 introduces the formal construction of maximum-entropy ensembles of graphs with local topological constraints. Chapter 3 focuses on the problem of pattern detection in real networks and provides a powerful way to disentangle nontrivial higher-order structural features from those that can be traced back to simpler local constraints. Chapter 4 focuses on the problem of network reconstruction and introduces various advanced techniques to reliably infer the topology of a network from partial local information. Chapter 5 is devoted to the reformulation of certain “hard” combinatorial operations, such as the enumeration and unbiased sampling of graphs with given constraints, within a “softened” maximum-entropy framework. A final chapter offers various overarching remarks and take-home messages. By requiring no prior knowledge of network theory, the book targets a broad audience ranging from PhD students approaching these topics for the first time to senior researchers interested in the application of advanced network techniques to their field.Understanding Complex Systems,2191-5326PhysicsStatistical physicsSystem theoryGraph theoryComputational complexityApplications of Graph Theory and Complex Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/P33010Statistical Physics and Dynamical Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/P19090Complex Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/M13090Graph Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/M29020Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/T11022Physics.Statistical physics.System theory.Graph theory.Computational complexity.Applications of Graph Theory and Complex Networks.Statistical Physics and Dynamical Systems.Complex Systems.Graph Theory.Complexity.003.54Squartini Tizianoauthttp://id.loc.gov/vocabulary/relators/aut823091Garlaschelli Diegoauthttp://id.loc.gov/vocabulary/relators/autMiAaPQMiAaPQMiAaPQBOOK9910254586303321Maximum-Entropy Networks1984712UNINA