Erol A. Peköz
Statistics and Probability · 2007–2011
A researcher in the Science corpus: 3 papers; trusts 9 researchers and is trusted by 13 researchers here, as inferred from the citation graph.
Subfields
- Statistics and Probability — 7 citations into it; #2,685 of 12,932 by trust here, #4,371 by citations
- Discrete Mathematics and Combinatorics — 6 citations into it
Whom Erol A. Peköz trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Sourav Chatterjee
- Larry Goldstein
- Nathan Ross
- Louis H. Y. Chen
- Ivan Nourdin
- Adrian Röllin
- Giovanni Peccati
- Svante Janson
- Wim Schoutens
- Mark Newman
Who trusts Erol A. Peköz overall
- Robert E. Gaunt
- Sourav Chatterjee
- Christophe Ley
- Nathan Ross
- Gesine Reinert
- Peter Eichelsbacher
- Yvik Swan
- Adrian Röllin
- A. Pickett
- Christoph Thale
Papers from Erol A. Peköz's perspective
Ordered by how strongly the researchers Erol A. Peköz trusts endorse each paper. Same corpus, a different order for every researcher.
- Emergence of Scaling in Random Networks
- A bound for the error in the normal approximation to the distribution of a sum of dependent random variables
- The Structure and Function of Complex Networks
- Stein’s method on Wiener chaos
- On Choosing and Bounding Probability Metrics
- A NEW METHOD OF NORMAL APPROXIMATION
- New rates for exponential approximation and the theorems of Rényi and Yaglom (Annals of Probability)
- Fundamentals of Stein's method
- Stein couplings for normal approximation
- The degree sequence of a scale‐free random graph process (Random Struct. Algorithms)
Their papers
- New rates for exponential approximation and the theorems of Rényi and Yaglom (2011) — 87 citations
- Degree asymptotics with rates for preferential attachment random graphs (2011) — 79 citations
- A Second Course in Probability (2007) — 83 citations