Search results:
Found 3
Listing 1  3 of 3 
Sort by

Choose an application
This open access book focuses on the interplay between random walks on planar maps and Koebe’s circle packing theorem. Further topics covered include electric networks, the He–Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of finite planar maps and the almost sure recurrence of simple random walks on these limits. One of its main goals is to present a selfcontained proof that the uniform infinite planar triangulation (UIPT) is almost surely recurrent. Full proofs of all statements are provided. A planar map is a graph that can be drawn in the plane without crossing edges, together with a specification of the cyclic ordering of the edges incident to each vertex. One widely applicable method of drawing planar graphs is given by Koebe’s circle packing theorem (1936). Various geometric properties of these drawings, such as existence of accumulation points and bounds on the radii, encode important probabilistic information, such as the recurrence/transience of simple random walks and connectivity of the uniform spanning forest. This deep connection is especially fruitful to the study of random planar maps. The book is aimed at researchers and graduate students in mathematics and is suitable for a singlesemester course; only a basic knowledge of graduate level probability theory is assumed.
Mathematics  Probabilities  Discrete mathematics  Geometry  Mathematical physics
Choose an application
This book is prepared as a combination of the manuscripts submitted by respected mathematicians and scientists around the world. As an editor, I truly enjoyed reading each manuscript. Not only will the methods and explanations help you to understand more about graph theory, but I also hope you will find it joyful to discover ways that you can apply graph theory in your scientific field. I believe the book can be read from the beginning to the end at once. However, the book can also be used as a reference guide in order to turn back to it when it is needed. I have to mention that this book assumes the reader to have a basic knowledge about graph theory. The very basics of the theory and terms are not explained at the beginner level. I hope this book will support many applied and research scientists from different scientific fields.
Physical Sciences, Engineering and Technology  Mathematics  Discrete Mathematics  Graph Theory
Choose an application
This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.
Mathematical Logic and Foundations  Discrete Mathematics in Computer Science  Programming Languages, Compilers, Interpreters  Programming Techniques  Logic in AI  Computer Systems Organization and Communication Networks  categorical models and logics  language theory, automata, and games  modal, spatial, and temporal logics  type theory and proof theory  concurrency theory and process calculi  rewriting theory  semantics of programming languages  program analysis, correctness, transformation, and verification  logics of programming  software specification and refinement  emerging models of computation  logical aspects of computational complexity  models of software security  logical foundations of data bases  mathematics  artificial intellegence  formal logic  linguistics  Mathematical foundations  Mathematical logic  Discrete mathematics  Maths for computer scientists  Programming & scripting languages: general  Compilers & interpreters  Computer programming / software engineering  Artificial intelligence  Computer networking & communications
Listing 1  3 of 3 
Sort by
