Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 59 for “"Discrete probability"”.

  1. Three Problems in Discrete Probability

    In this thesis we present three problems. The first problem is to find a good description of the number of fixed points of a 231-avoiding permutation. We use a bijection from Dyck paths to 231-avoiding permutations that allows us to compute the scaled distribution of the number of fixed points of a …

    washington Repository record for Three Problems in Discrete Probability (opens in a new tab)

  2. Discrete probability and the geometry of graphs

    We prove several theorems concerning random walks, harmonic functions, percolation, uniform spanning forests, and circle packing, often in combination with each other. We study these models primarily on planar graphs, on transitive graphs, and on unimodular random rooted graphs, although some of …

    ubc Repository record for Discrete probability and the geometry of graphs (opens in a new tab) Download PDF for Discrete probability and the geometry of graphs (opens in a new tab)

  3. Approximations, simulation, and accuracy of multivariate discrete probability distributions in decision analysis

    … procedure to create a collection of joint probability distributions, all of which match whatever information we have. Using this collection of distributions, we analyzed the accuracy of different approximations such as maximum entropy or copula-models. In addition, we proposed several new …

    texas Repository record for Approximations, simulation, and accuracy of multivariate discrete probability distributions in decision analysis (opens in a new tab)

  4. A unified algebraic framework extending from a 6-set discrete probability algebra and its application in deep learning

    … Functions Package built upon an extensible 6-Set Discrete Probability Algebra. The motivation behind this research is to provide a unified, general, and extendible quantitative analysis tool that can be used to delve into the neuron-level deep neural network structure and aims at improving the …

    utc Repository record for A unified algebraic framework extending from a 6-set discrete probability algebra and its application in deep learning (opens in a new tab)

  5. Estimating directed information to infer causal relationships between neural spike trains and approximating discrete probability distributions with causal dependence trees

    … be a general quantity, applicable to arbitrary probability distributions. It is interpreted in terms of prediction, communication with feedback, source coding with feed forward, control over noisy channels, and other settings. It is also shown to be consistent with Granger's philosophical …

    uiuc Repository record for Estimating directed information to infer causal relationships between neural spike trains and approximating discrete probability distributions with causal dependence trees (opens in a new tab)

  6. Metrization of Sets of Sub-σ-Algebras and their Conditional Entropies

    … Co Rajski's Theorem ([9]) on the metric space of discrete probability distributions can be deduced as a particular case of a theorem on the metric space of sub-σ-algebras given in Chapter III, the proof of which is comparatively very concise. The completeness of this metric space and some other …

    mcmaster Repository record for Metrization of Sets of Sub-σ-Algebras and their Conditional Entropies (opens in a new tab)

  7. A Discrete Truncated Power-law Distribution

    This thesis concerns discrete probability distributions with power-law tailbehavior. Discrete power-law distributions are reviewed together withtheir truncated versions. The Zipf distribution (Zipf, 1932) is then focusedon and a truncated version of the Zipf distribution is further studied. …

    unr Repository record for A Discrete Truncated Power-law Distribution (opens in a new tab)

  8. Ordinal data: a new model with applications

    In this work we propose a new discrete probability distribution useful when we work with ordered categorical data. The discrete-beta distribution has a highly flexible shape and it can be either over-dispersed or under-dispersed with respect to the binomial distribution. It has only two parameters, …

    poli-torino Repository record for Ordinal data: a new model with applications (opens in a new tab)

  9. Chance-Constrained Linear Matrix Inequality Optimization: Theory and Applications

    … LMI constraints to be satisfied with high probability. While chance-constrained linear matrix inequality (CCLMI) optimization provides a natural way to model optimization problems with uncertainty, finding exact solutions to these problems is notoriously challenging due to the nonconvexity …

    arizona-thes Repository record for Chance-Constrained Linear Matrix Inequality Optimization: Theory and Applications (opens in a new tab)

  10. Application of GenRel for maintainability analysis of underground mining equipment: based on case studies of two hoist systems

    … GenRel through case studies, especially in using discrete probability distribution function. One of the objectives of this thesis is to improve GenRel. A discrete probability distribution function named Poisson is added in the pool of available probabilities functions. After improving and …

    laurentian Repository record for Application of GenRel for maintainability analysis of underground mining equipment: based on case studies of two hoist systems (opens in a new tab)

  11. Sezoninis ir jungtinis trijų žalų diskretaus laiko rizikos modeliai /

    … paper it is analysed seasonal and multi-risk discrete-time risk models with non identically distributed claims for finite and infinite time. Main risk theory definitions and properties are introduced as well as formulation of main theorems that use principal of recursion to calculate …

    vilnius Repository record for Sezoninis ir jungtinis trijų žalų diskretaus laiko rizikos modeliai / (opens in a new tab)

  12. Irreducibility of Random Hilbert Schemes

    … space is irreducible and nonsingular with probability greater than $0.5$. To consider the set of nonempty Hilbert schemes as a probability space, we transform this set into a disjoint union of infinite binary trees, reinterpreting Macaulay's classification of admissible Hilbert polynomials. …

    queens Repository record for Irreducibility of Random Hilbert Schemes (opens in a new tab)

  13. Optimizing Surgical Scheduling Through Integer Programming and Robust Optimization

    … patients` length of stay was incorporated using discrete probability distributions unique to each surgeon. Furthermore, robust optimization was utilized to protect against the uncertainty in the number of inpatients a surgeon may send to the ward per block. Different scenarios were developed that …

    ottawa-retro Repository record for Optimizing Surgical Scheduling Through Integer Programming and Robust Optimization (opens in a new tab)

  14. Generalized Minimum Penalized Hellinger Distance Estimation and Generalized Penalized Hellinger Deviance Testing for Generalized Linear Models: The Discrete Case

    … and likelihood ratio tests are developed for discrete generalized linear models. The estimation method considered is a penalized minimum Hellinger distance procedure that generalizes a procedure developed by Harris and Basu for estimating parameters of a single discrete probability …

    utahstate Repository record for Generalized Minimum Penalized Hellinger Distance Estimation and Generalized Penalized Hellinger Deviance Testing for Generalized Linear Models: The Discrete Case (opens in a new tab)

  15. An introduction to the theory of random graphs

    … building blocks of random graph theory, namely discrete probability and graph theory. The study starts by introducing relevant concepts probability commonly used in random graph theory- these include concentration inequalities such as Chebyshev's inequality and Chernoff's inequality. Moreover we …

    birmingham Download PDF for An introduction to the theory of random graphs (opens in a new tab)

  16. Chemical Distance in Percolation Models and Phase Transitions of Ballistic Annihilation

    … problems in two areas at the intersection of discrete probability and statistical physics: the chemical distance in planar percolation models and phase transitions of ballistic annihilation. Although the two models are quite different, the techniques and results involved are often of …

    cornell Repository record for Chemical Distance in Percolation Models and Phase Transitions of Ballistic Annihilation (opens in a new tab)

  17. ΧΑΡΑΚΤΗΡΙΣΜΟΙ ΚΑΤΑΝΟΜΩΝ ΜΕ ΕΜΦΑΣΗ ΣΤΙΣ ΚΑΤΑΝΟΜΕΣ PARETO ΚΑΙ YULE

    … CHARACTERISTIC PROPERTIES OF CONTINUOUS AND DISCRETE PROBABILITY DISTRIBUTIONS IN THE CONTEXT OF WHAT IS DEFINED AS A DISTORTION MODEL.

    greece Repository record for ΧΑΡΑΚΤΗΡΙΣΜΟΙ ΚΑΤΑΝΟΜΩΝ ΜΕ ΕΜΦΑΣΗ ΣΤΙΣ ΚΑΤΑΝΟΜΕΣ PARETO ΚΑΙ YULE (opens in a new tab)

  18. On New Advances in Nonparametric Bayesian Priors and Their Applications

    … distribution and its associated random discrete probability measure. The new proposed family of the discrete random probability measures which is defined by normalizing the points of the negative binomial process provides a new set of useful priors for Bayesian nonparametric models with …

    ottawa-retro Repository record for On New Advances in Nonparametric Bayesian Priors and Their Applications (opens in a new tab)

Page 1 of 3