Listing 1 - 4 of 4 |
Sort by
|
Choose an application
This monograph is devoted to random walk based stochastic algorithms for solving high-dimensional boundary value problems of mathematical physics and chemistry. It includes Monte Carlo methods where the random walks live not only on the boundary, but also inside the domain. A variety of examples from capacitance calculations to electron dynamics in semiconductors are discussed to illustrate the viability of the approach.The book is written for mathematicians who work in the field of partial differential and integral equations, physicists and engineers dealing with computational methods and applied probability, for students and postgraduates studying mathematical physics and numerical mathematics. Contents:IntroductionRandom walk algorithms for solving integral equationsRandom walk-on-boundary algorithms for the Laplace equationWalk-on-boundary algorithms for the heat equationSpatial problems of elasticityVariants of the random walk on boundary for solving stationary potential problemsSplitting and survival probabilities in random walk methods and applicationsA random WOS-based KMC method for electron-hole recombinationsMonte Carlo methods for computing macromolecules properties and solving related problemsBibliography
Boundary value problems --- Stochastic analysis. --- Random walks (Mathematics) --- Additive process (Probability theory) --- Random walk process (Mathematics) --- Walks, Random (Mathematics) --- Stochastic processes --- Analysis, Stochastic --- Mathematical analysis --- Numerical solutions.
Choose an application
This book offers a detailed review of perturbed random walks, perpetuities, and random processes with immigration. Being of major importance in modern probability theory, both theoretical and applied, these objects have been used to model various phenomena in the natural sciences as well as in insurance and finance. The book also presents the many significant results and efficient techniques and methods that have been worked out in the last decade. The first chapter is devoted to perturbed random walks and discusses their asymptotic behavior and various functionals pertaining to them, including supremum and first-passage time. The second chapter examines perpetuities, presenting results on continuity of their distributions and the existence of moments, as well as weak convergence of divergent perpetuities. Focusing on random processes with immigration, the third chapter investigates the existence of moments, describes long-time behavior and discusses limit theorems, both with and without scaling. Chapters four and five address branching random walks and the Bernoulli sieve, respectively, and their connection to the results of the previous chapters. With many motivating examples, this book appeals to both theoretical and applied probabilists.
Additive process (Probability theory) --- Random walk process (Mathematics) --- Walks, Random (Mathematics) --- Random walks (Mathematics) --- Stochastic processes --- Distribution (Probability theory. --- Probability Theory and Stochastic Processes. --- Distribution functions --- Frequency distribution --- Characteristic functions --- Probabilities --- Probabilities. --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk
Choose an application
The classical theory of random walks describes the asymptotic behavior of sums of independent identically distributed random real variables. This book explains the generalization of this theory to products of independent identically distributed random matrices with real coefficients. Under the assumption that the action of the matrices is semisimple – or, equivalently, that the Zariski closure of the group generated by these matrices is reductive - and under suitable moment assumptions, it is shown that the norm of the products of such random matrices satisfies a number of classical probabilistic laws. This book includes necessary background on the theory of reductive algebraic groups, probability theory and operator theory, thereby providing a modern introduction to the topic.
Mathematics. --- Topological groups. --- Lie groups. --- Dynamics. --- Ergodic theory. --- Probabilities. --- Probability Theory and Stochastic Processes. --- Dynamical Systems and Ergodic Theory. --- Topological Groups, Lie Groups. --- Random walks (Mathematics) --- Additive process (Probability theory) --- Random walk process (Mathematics) --- Walks, Random (Mathematics) --- Stochastic processes --- Distribution (Probability theory. --- Differentiable dynamical systems. --- Topological Groups. --- Groups, Topological --- Continuous groups --- Differential dynamical systems --- Dynamical systems, Differentiable --- Dynamics, Differentiable --- Differential equations --- Global analysis (Mathematics) --- Topological dynamics --- Distribution functions --- Frequency distribution --- Characteristic functions --- Probabilities --- Groups, Lie --- Lie algebras --- Symmetric spaces --- Topological groups --- Ergodic transformations --- Mathematical physics --- Measure theory --- Transformations (Mathematics) --- Dynamical systems --- Kinetics --- Mathematics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Probability --- Statistical inference --- Combinations --- Chance --- Least squares --- Mathematical statistics --- Risk
Choose an application
The collection of survey data from war zones or other unstable security situations is vulnerable to error because conflict often limits the implementation options. Although there are elevated risks throughout the process, this paper focuses specifically on challenges to frame construction and sample selection. The paper uses simulations based on data from the Mogadishu High Frequency Survey Pilot to examine the implications of the choice of second-stage selection methodology on bias and variance. Among the other findings, the simulations show the bias introduced by a random walk design leads to the underestimation of the poverty headcount by more than 10 percent. The paper also discusses the experience of the authors in the time required and technical complexity of the associated back-office preparation work and weight calculations for each method. Finally, as the simulations assume perfect implementation of the design, the paper also discusses practicality, including the ease of implementation and options for remote verification, and outlines areas for future research and pilot testing.
Administrative Records --- Age --- Algorithms --- Back Office --- Best Practice --- Business --- Calculation --- Case --- Cell Phones --- Classification --- Clustering --- Computer --- Confidence Intervals --- Counting --- Data --- Data Collection --- Description --- Document --- Effects --- Enumeration --- Equipment --- Errors --- Estimates --- Estimating --- Gps --- Human Error --- Image --- Implementation Plans --- Implementations --- Information --- Interviews --- Measurement --- Measures --- Methodology --- Methods --- Missing Values --- Modeling --- Monitoring --- Navigation --- Network --- Object --- Open Access --- Performance --- Phones --- Pilot Testing --- Precision --- Prediction --- Probability --- Probability Samples --- Protocol --- Random Sampling --- Random Walk --- Research --- Research Working Papers --- Researchers --- Result --- Risk --- Routing --- Sample Design --- Sample Size --- Samples --- Sampling --- Sampling Designs --- Satellite --- Scenarios --- Search --- Security --- Simulation --- Size --- Smart Phones --- Software --- Space --- Standard --- Standard Deviation --- Statistics --- Supervision --- Survey Data --- Survey Methodology --- Surveys --- Target --- Technical Training --- Techniques --- Technology --- Testing --- Theory --- Time --- URL --- Uses --- Variables --- Verification --- Web --- Weight --- Weighting --- WWW
Listing 1 - 4 of 4 |
Sort by
|