Richard Arratia
#37,886
Most Influential Person Now
American mathematician
Richard Arratia's AcademicInfluence.com Rankings
Richard Arratiamathematics Degrees
Mathematics
#1909
World Rank
#3031
Historical Rank
#770
USA Rank
Measure Theory
#3401
World Rank
#4016
Historical Rank
#983
USA Rank
Download Badge
Mathematics
Richard Arratia's Degrees
- PhD Mathematics University of California, Berkeley
- Masters Mathematics University of California, Berkeley
- Bachelors Mathematics University of California, Berkeley
Similar Degrees You Can Earn
Why Is Richard Arratia Influential?
(Suggest an Edit or Addition)According to Wikipedia, Richard Alejandro Arratia is a mathematician noted for his work in combinatorics and probability theory. Contributions Arratia developed the ideas of interlace polynomials with Béla Bollobás and Gregory Sorkin, found an equivalent formulation of the Stanley–Wilf conjecture as the convergence of a limit, and was the first to investigate the lengths of superpatterns of permutations.
Richard Arratia's Published Works
Published Works
- Logarithmic Combinatorial Structures: A Probabilistic Approach (2003) (523)
- Two moments su ce for Poisson approx-imations: the Chen-Stein method (1989) (486)
- Poisson Approximation and the Chen-Stein Method (1990) (341)
- The Motion of a Tagged Particle in the Simple Symmetric Exclusion System on $Z$ (1983) (198)
- Pattern recognition in several sequences: consensus and alignment. (1984) (166)
- Poisson Process Approximations for the Ewens Sampling Formula (1992) (139)
- The Cycle Structure of Random Permutations (1992) (137)
- Tutorial on large deviations for the binomial distribution. (1989) (136)
- A Phase Transition for the Score in Matching Random Sequences Allowing Deletions (1994) (134)
- The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence Matching (1990) (134)
- On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern (1999) (125)
- The interlace polynomial of a graph (2002) (106)
- Independent Process Approximations for Random Combinatorial Structures (1994) (102)
- Genomic mapping by anchoring random clones: a mathematical analysis. (1991) (93)
- THE ERDOS-RENYI STRONG LAW FOR PATTERN MATCHING WITH A GIVEN PROPORTION OF MISMATCHES (1989) (86)
- Limit Theorems for Combinatorial Structures via Discrete Process Approximations (1992) (83)
- Limiting Point Processes for Rescalings of Coalescing and Annihilating Random Walks on $Z^d$ (1981) (82)
- Phase transitions in sequence matches and nucleic acid structure. (1987) (80)
- The interlace polynomial: a new graph polynomial (2000) (75)
- Poisson Process Approximation for Sequence Repeats and Sequencing by Hybridization (1996) (68)
- An Extreme Value Theory for Sequence Matching (1986) (65)
- Critical Phenomena in Sequence Matching (1985) (61)
- A Two-Variable Interlace Polynomial (2002) (58)
- An Erdös-Rényi law with shifts (1985) (57)
- Site Recurrence for Annihilating Random Walks on $Z_d$ (1983) (53)
- Euler circuits and DNA sequencing by hybridization (2000) (52)
- On random polynomials over finite fields (1993) (50)
- Size bias for one and all (2013) (47)
- Random Combinatorial Structures and Prime Factorizations (1997) (45)
- Limits of logarithmic combinatorial structures (2000) (40)
- Stochastic scrabble: large deviations for sequences with scores (1988) (39)
- Total Variation Asymptotics for Poisson Process Approximations of Logarithmic Combinatorial Assemblies (1995) (35)
- Tutorial on large deviations for the binomial distribution (1989) (33)
- Size bias, sampling, the waiting time paradox, and infinite divisibility: when is the increment independent? (2010) (31)
- [Poisson Approximation and the Chen-Stein Method]: Rejoinder (1990) (31)
- Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example (2011) (29)
- The Poisson–Dirichlet Distribution and the Scale-Invariant Poisson Process (1999) (28)
- How likely is an i.i.d. degree sequence to be graphical (2005) (23)
- On the central role of scale invariant Poisson processes on (0, ∞) (1997) (23)
- Bounded size bias coupling: a Gamma function bound, and universal Dickman-function behavior (2013) (22)
- Symmetric Exclusion Processes: A Comparison Inequality and a Large Deviation Result (1985) (20)
- On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer (2013) (19)
- Central Limit Theorem from Renewal Theory for Several Patterns (1997) (17)
- Local central limit theorems, the high-order correlations of rejective sampling and logistic likelihood asymptotics (2005) (15)
- On Poisson–Dirichlet Limits for Random Decomposable Combinatorial Structures (1999) (14)
- Monte carlo simulation of particulate noise in magnetic recording (1984) (14)
- Completely Effective Error Bounds for Stirling Numbers of the First and Second Kinds via Poisson Approximation (2014) (13)
- A Tale of Three Couplings: Poisson–Dirichlet and GEM Approximations for Random Permutations (2006) (13)
- The van den Berg–Kesten–Reimer operator and inequality for infinite spaces (2015) (12)
- Review: D. Aldous, Probability Approximations via the Poisson Clumping Heuristic; A. D. Barbour, L. Holst, S. Janson, Poisson Approximation (1993) (11)
- Some People Have All the Luck (2015) (11)
- The distribution of clusters in random graphs (1990) (10)
- Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process (2013) (9)
- Exploiting the Feller Coupling for the Ewens Sampling Formula (2016) (8)
- The number of components in a logarithmic combinatorial structure (2000) (8)
- On the Singularity of Random Bernoulli Matrices— Novel Integer Partitions and Lower Bound Expansions (2011) (8)
- Simulating the component counts of combinatorial structures. (2018) (7)
- Scale-free and power law distributions via fixed points and convergence of (thinning and conditioning) transformations (2013) (7)
- Extensions of Billingsley's Theorem via Multi-Intensities (2014) (4)
- BOOK REVIEW D. Arxmus, Probability Approximations via the Poisson Clumping Heuristic. Springer, Berlin, 1989. (1993) (4)
- A Simple Direct Proof of Billingsley's Theorem (2014) (2)
- Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization (1996) (2)
- On the central role of the scale invariant Poisson processes on (0,infty) (2016) (2)
- Poisson and independent process approximation for random combinatorial structures with a given number of components, and near-universal behavior for low rank assemblies (2016) (2)
- A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains (1997) (1)
- van den Berg--Kesten--Reimer inequality for infinite spaces (2015) (1)
- On the largest part size of low‐rank combinatorial assemblies (2022) (1)
- Probabilistic Aspects of Sequence Repeats and Sequencing by Hybridization (1997) (1)
- Pattern recognition in several sequences: Consensus and alignment (1984) (1)
- Large deviation asymptotics for a random variable with L\'evy measure supported by $[0, 1]$ (2016) (1)
- A probabilistic approach to analytic arithmetic on algebraic function fields (2005) (1)
- of the Bernoulli Society for Mathematical Statistics and Probability (2019) (0)
- Brownian bridge asymptotics for random mappings Independent process approximations for random combinatorial structures Refined approximations for the Ewens sampling formula The height of a random partial order : concentration of measure Comparison techniques for card shuffling (0)
- Random feedback shift registers and the limit distribution for largest cycle lengths (2019) (0)
- Local Central Limit Theorems, the High Order Correlations of Rejective Sampling, and Applications to Conditional Logistic Likelihood Asymptotics † (2001) (0)
- Attacks and alignments: rooks, set partitions, and permutations (2018) (0)
- Bounded size bias coupling: a Gamma function bound, and universal Dickman-function behavior (2014) (0)
- An Erdos-Rhyi taw with Shifts (1985) (0)
- On the Singularity of Random Bernoulli Matrices— Novel Integer Partitions and Lower Bound Expansions (2013) (0)
- Completely Effective Error Bounds for Stirling Numbers of the First and Second Kinds via Poisson Approximation (2017) (0)
- Year : 1997 Random combinatorial structures and prime factorizations (2010) (0)
- Independent process approximations for combinatorial structures (1992) (0)
- On the Random Sampling of Pairs, with Pedestrian Examples (2012) (0)
- A countdown process, with application to the rank of random matrices over $\mathbb F_q(n)$ (2016) (0)
- Poisson--Dirichlet Limit Theorems in Combinatorial Applications via Multi-Intensities (2014) (0)
This paper list is powered by the following services:
Other Resources About Richard Arratia
What Schools Are Affiliated With Richard Arratia?
Richard Arratia is affiliated with the following schools: