- Author:
- Hosam Mahmoud
Incorporating a collection of recent results, Plya Urn Models deals with discrete probability through the modern and evolving urn theory and its numerous applications. The book first substantiates the realization of distributions with urn arguments and introduces several modern tools, including exchangeability and stochastic processes via urns. It reviews classical probability problems and presents dichromatic Plya urns as a basic discrete structure growing in discrete time. The author then embeds the discrete Plya urn scheme in Poisson processes to achieve an equivalent view in continuous time, provides heuristical arguments to connect the Plya process to the discrete urn scheme, and explores extensions and generalizations. He also discusses how functional equations for moment generating functions can be obtained and solved. The final chapters cover applications of urns to computer science and bioscience. Examining how urns can help conceptualize discrete probability principles, this book provides information pertinent to the modeling of dynamically evolving systems where particles come and go according to governing rules.
Cited By
- Souto Arias L, Cirillo P and Oosterlee C (2025). The Heston–Queue-Hawkes process, Journal of Computational and Applied Mathematics, 454:C, Online publication date: 15-Jan-2025.
- Kinariwala S and Deshmukh S (2023). Short text topic modelling using local and global word-context semantic correlation, Multimedia Tools and Applications, 82:17, (26411-26433), Online publication date: 1-Jul-2023.
Gaeta R, Garetto M, Ruffo G and Flammini A (2022). Reconciling the Quality vs Popularity Dichotomy in Online Cultural Markets, ACM Transactions on Information Systems, 41:1, (1-34), Online publication date: 31-Jan-2023.- Gao C, Wang Y, Xiong X and Fysarakis K (2022). A Cyber Deception Defense Method Based on Signal Game to Deal with Network Intrusion, Security and Communication Networks, 2022, Online publication date: 1-Jan-2022.
- Huang Y, Tang J, Cong Q, Lim A and Xu J Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives Proceedings of the 2021 International Conference on Management of Data, (790-803)
- Chierichetti F, Kumar R and Tomkins A Asymptotic Behavior of Sequence Models Proceedings of The Web Conference 2020, (2824-2830)
- Hwang H, Chern H and Duh G (2020). An asymptotic distribution theory for Eulerian recurrences with applications, Advances in Applied Mathematics, 112:C, Online publication date: 1-Jan-2020.
- Elishco O, Hassanzadeh F, Schwartz M and Bruck J (2019). The Entropy Rate of Some Pólya String Models, IEEE Transactions on Information Theory, 65:12, (8180-8193), Online publication date: 1-Dec-2019.
- Gao W, Peng M, Wang H, Zhang Y, Xie Q and Tian G (2019). Incorporating word embeddings into topic modeling of short text, Knowledge and Information Systems, 61:2, (1123-1145), Online publication date: 1-Nov-2019.
- Huang M, Fu H, Chatterjee K and Goharshady A (2019). Modular verification for almost-sure termination of probabilistic programs, Proceedings of the ACM on Programming Languages, 3:OOPSLA, (1-29), Online publication date: 10-Oct-2019.
- Mahmoud H (2019). Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment, Advances in Applied Mathematics, 111:C, Online publication date: 1-Oct-2019.
- Zha D and Li C (2019). Multi-label dataless text classification with topic modeling, Knowledge and Information Systems, 61:1, (137-160), Online publication date: 1-Oct-2019.
- Khan M, Khalid S and Aziz F Graph Clustering Based Size Varying Rules for Lifelong Topic Modeling Proceedings of the 5th International Conference on Bioinformatics Research and Applications, (73-77)
- Xu K, Zheng X, Cai Y, Min H, Gao Z, Zhu B, Xie H and Wong T (2018). Improving user recommendation by extracting social topics and interest topics of users in uni-directional social networks, Knowledge-Based Systems, 140:C, (120-133), Online publication date: 15-Jan-2018.
- Fanti G and Viswanath P Deanonymization in the Bitcoin P2P network Proceedings of the 31st International Conference on Neural Information Processing Systems, (1364-1373)
- Hingmire S, Chakraborti S, Palshikar G and Sodani A WikiLDA Proceedings of the 9th Knowledge Capture Conference, (1-4)
- Thonet T, Cabanac G, Boughanem M and Pinel-Sauvagnat K Users Are Known by the Company They Keep Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, (87-96)
- Li C, Duan Y, Wang H, Zhang Z, Sun A and Ma Z (2017). Enhancing Topic Modeling for Short Texts with Auxiliary Word Embeddings, ACM Transactions on Information Systems, 36:2, (1-30), Online publication date: 15-Sep-2017.
- Lu W, Chung F, Lai K and Zhang L (2017). Recommender system based on scarce information mining, Neural Networks, 93:C, (256-266), Online publication date: 1-Sep-2017.
- Xu Y, Yin Y and Yin J (2017). Tackling topic general words in topic modeling, Engineering Applications of Artificial Intelligence, 62:C, (124-133), Online publication date: 1-Jun-2017.
- Mathews P, Mitchell L, Nguyen G and Bean N The Nature and Origin of Heavy Tails in Retweet Activity Proceedings of the 26th International Conference on World Wide Web Companion, (1493-1498)
- Khan M, Azam N, Khalid S and Yao J (2017). A three-way approach for learning rules in automatic knowledge-based topic models, International Journal of Approximate Reasoning, 82:C, (210-226), Online publication date: 1-Mar-2017.
- Li C, Wang H, Zhang Z, Sun A and Ma Z Topic Modeling for Short Texts with Auxiliary Word Embeddings Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, (165-174)
- Konzem S and Mahmoud H (2016). Characterization and Enumeration of Certain Classes of Tenable Pólya Urns Grown by Drawing Multisets of Balls, Methodology and Computing in Applied Probability, 18:2, (359-375), Online publication date: 1-Jun-2016.
- Wang S, Chen Z and Liu B Mining Aspect-Specific Opinion using a Holistic Lifelong Topic Model Proceedings of the 25th International Conference on World Wide Web, (167-176)
- Crouse M, Prosser B and Fulp E Probabilistic Performance Analysis of Moving Target and Deception Reconnaissance Defenses Proceedings of the Second ACM Workshop on Moving Target Defense, (21-29)
- Galbete A, Moler J and Plo F (2014). A Response-Driven Adaptive Design Based on the Klein Urn, Methodology and Computing in Applied Probability, 16:3, (731-746), Online publication date: 1-Sep-2014.
- Chen Z and Liu B Mining topics in documents Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, (1116-1125)
- Kuba M, Mahmoud H and Panholzer A (2013). Analysis of a generalized Friedman's urn with multiple drawings, Discrete Applied Mathematics, 161:18, (2968-2984), Online publication date: 1-Dec-2013.
- Chen Z, Mukherjee A, Liu B, Hsu M, Castellanos M and Ghosh R Discovering coherent topics using general knowledge Proceedings of the 22nd ACM international conference on Information & Knowledge Management, (209-218)
- Kholfi S and Mahmoud H The class of tenable zero-balanced Pólya urn schemes Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (117-126)
- Balaji S and Mahmoud H Phases in the mixing of gases via the Ehrenfest urn model Proceedings of the Meeting on Algorithm Engineering & Expermiments, (9-17)
- Elishco O, Farnoud F, Schwartz M and Bruck J The capacity of some Pólya string models 2016 IEEE International Symposium on Information Theory (ISIT), (270-274)
- Fanti G, Kogan L, Oh S, Ruan K, Viswanath P and Wang G Compounding of Wealth in Proof-of-Stake Cryptocurrencies Financial Cryptography and Data Security, (42-61)
Index Terms
- Polya Urn Models
Recommendations
The Power of Choice in a Generalized Pólya Urn Model
APPROX '08 / RANDOM '08: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and TechniquesWe establish some basic properties of a "Pólya choice" generalization of the standard Pólya urn process. From a set of k urns, the i th occupied by n i balls, choose c distinct urns i 1,..., i c with probability proportional to $n_{i_1}^\...
Weighing the "heaviest" Polya urn
For the classical Polya urn model parametrized by exponent γ , the limit distributions of the fraction of balls in each bin are simple and well known when γ < 1 ("egalitarian") and when γ > 1 ("winner takes all"). In this note, we partially fill in the ...
Fully analyzing an algebraic pólya urn model
LATIN'12: Proceedings of the 10th Latin American international conference on Theoretical InformaticsThis paper introduces and analyzes a particular class of Pólya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color compositions varies (the ...