Random Generation of Trees


Book Description

Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation.










Random Trees


Book Description

The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research.




Random Number Generation and Monte Carlo Methods


Book Description

Monte Carlo simulation has become one of the most important tools in all fields of science. This book surveys the basic techniques and principles of the subject, as well as general techniques useful in more complicated models and in novel settings. The emphasis throughout is on practical methods that work well in current computing environments.




Algorithms for Random Generation and Counting: A Markov Chain Approach


Book Description

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.




Algorithms for Random Generation and Counting: A Markov Chain Approach


Book Description

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.







Model Driven Architecture - Foundations and Applications


Book Description

The ?fth edition of the European Conference on Model-Driven Architecture Foundations and Applications (ECMDA-FA 2009) was dedicated to furthering the state of knowledge and fostering the industrialization of Model-Driven - chitecture (MDA) and Model-Driven Engineering (MDE). MDA is an initiative proposed by the Object Management Group for platform-generic systems - velopment; MDA is one of a class of approaches under the umbrella of MDE. MDE and MDA promote the use of models in the speci?cation, design, analysis, synthesis, deployment, and evolution of complex software systems. It is a pleasure to be able to introduce the proceedings of ECMDA-FA 2009. ECMDA-FA 2009 addressed various MDA areas including model transfor- tions, modelling language issues, modelling of behavior and time, traceability and scalability, model-basedembedded systems engineering,and the application of model-driven development to IT and networking systems. ECMDA-FA 2009 focused on engaging key European and international - searchers and practitioners in a dialogue which will result in a stronger, more e?cientindustry,producingmorereliablesoftwareonthebasisofstate-of-the-art research results. ECMDA-FA is a forum for exchanging information, discussing the latest results and arguing about future developments of MDA and MDE. Particularly, it is one of the few venues that engages both leading academic researchers and industry practitioners, with the intent of creating synergies.




Algorithms and Discrete Applied Mathematics


Book Description

This book collects the refereed proceedings of the First International Conference onon Algorithms and Discrete Applied Mathematics, CALDAM 2015, held in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including approximation algorithms, graph theory and computational complexity.