 Finding cliques in random graphs by adaptive probing [ pdf ]
 Sequence assembly from corrupted shotgun reads [ pdf ]
 Braess's paradox for the spectral gap in random graphs [ pdf (4 min. talk) ]
 From trees to seeds: on the inference of the seed from large random trees [ pdf ]
 Multidimensional sticky Brownian motions as limits of exclusion processes [ pdf ]
 Coexistence in preferential attachment networks [ pdf ]
 Modeling Flocks and Prices: Jumping Particles with an Attractive Interaction: [ pdf ]
 Braess's paradox for the spectral gap in random graphs [ pdf ]
 From trees to seeds: on the inference of the seed from large random trees [ pdf ]
 Coexistence in preferential attachment networks [ pdf ]
Talks (since 2012)
2020

June 1: SIAM Conference on Discrete Mathematics (DM20), Portland, OR.
Title: Correlated randomly growing graphs 
May 18  22: Workshop on Critical and Collective Effects in Graphs and Networks, Woods Hole, MA.
Title: TBD 
May 6: Mathematical Physics Seminar, Yeshiva University.
Title: TBD 
January 31: Probability Seminar, Columbia University.
Title: Correlated randomly growing graphs 
January 27: MIFODS Workshop on Learning Under Complex Structure, MIT.
Title: Trace reconstruction problems with applications to DNA data storage

December 27: Statistical Physics Holiday Seminar, Eotvos Lorand University (ELTE).
Title: Correlated randomly growing graphs 
December 2: Probability Seminar, MIT.
Title: Correlated randomly growing graphs 
November 8: Combinatorics Seminar, Georgia Tech.
Title: Finding cliques in random graphs by adaptive probing 
October 13: Special Session on Stochastic Evolution of Discrete Structures, AMS Eastern Sectional Meeting, Binghamton, NY.
Title: Correlated randomly growing graphs 
September 14: Special Session on Recent Trends in the Mathematics of Data, AMS Central Sectional Meeting, Madison, WI.
Title: Trace reconstruction problems with applications to DNA data storage 
July 16: The 19th International Conference on Random Structures and Algorithms, Zurich, Switzerland.
Title: Finding cliques in random graphs by adaptive probing

December 28: Statistical Physics Holiday Seminar, Eotvos Lorand University (ELTE).
Title: Finding cliques using few probes 
November 16  17: Oxford  Princeton Workshop, Princeton, NJ.
Title: Highdimensional random geometric graphs 
November 2: Probability Seminar, University of Bristol.
Title: Highdimensional random geometric graphs 
October 29: Probability Seminar, University of Oxford.
Title: Finding cliques using few probes 
October 4: Applied Probability & Risk Seminar, Columbia University.
Title: Highdimensional random geometric graphs 
September 30: Special Session on Probability, Combinatorics, and Statistical Mechanics, AMS Eastern Sectional Meeting, Newark, DE.
Title: Highdimensional random geometric graphs 
June 22: Workshop on Critical and Collective Effects in Graphs and Networks, Eindhoven, The Netherlands.
Title: Highdimensional random geometric graphs 
May 23: Research on Algorithms and Incentives in Networks (RAIN) Seminar, Stanford University.
Title: Highdimensional random geometric graphs 
May 3: Workshop on Combinatorial Statistics, CRM, Montreal, Canada.
Title: Highdimensional random geometric graphs 
March 23: Computational Statistics and Machine Learning (CSML) Seminar, University of Oxford.
Title: Highdimensional random geometric graphs

December 29: Statistical Physics Holiday Seminar, Eotvos Lorand University (ELTE).
Title: How fragile are information cascades? 
November 14: Probability Seminar, University of Pennsylvania.
Title: How fragile are information cascades? 
July 30: Joint Statistical Meetings (JSM), Baltimore, MD.
Title: Statistical Inference in Growing Random Graphs 
April 21: Mathematics Colloquium, University of Denver.
Title: Statistical Inference in Networks 
April 20: Probability Seminar, University of Colorado, Boulder.
Title: Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors 
April 19: Theory Lunch, Microsoft Research, Redmond.
Title: How fragile are information cascades? 
February 6: ORFE Colloquium, Princeton University.
Title: Statistical Inference in Networks and Genomics 
January 24: Mathematics Colloquium, University of Maryland.
Title: Statistical Inference in Networks and Genomics 
January 13: Mathematics Colloquium, University of British Columbia.
Title: Statistical Inference in Networks and Genomics 
January 12: Probability Seminar, University of British Columbia.
Title: Highdimensional random geometric graphs 
January 9: Mathematics Colloquium, University of WisconsinMadison.
Title: Statistical Inference in Networks and Genomics

December 16: Dynamic Networks Workshop, Isaac Newton Institute, Cambridge, UK.
Title: Finding and hiding the seed 
December 7: Mathematics Colloquium, McGill University.
Title: Statistical Inference in Networks and Genomics 
December 5: Mathematics Colloquium, Carnegie Mellon University.
Title: Statistical Inference in Networks and Genomics 
November 30: Probability Seminar, Princeton University.
Title: Finding and hiding the seed 
November 21: Probability Seminar, University of Washington.
Title: Controlled diffusion on graphs 
October 13: Probability Seminar, Duke University.
Title: From trees to seeds: on the inference of the seed from large random trees 
September 25: BIRS Retreat for Young Researchers in Stochastics, Banff, Canada.
Title: From trees to seeds: on the inference of the seed from large random trees 
September 7: Monash Workshop on Selfinteracting processes, Melbourne, Australia.
Title: Multidimensional sticky Brownian motions as limits of exclusion processes 
July 11: International Symposium on Information Theory (ISIT), Barcelona, Spain.
Title: Sequence assembly from corrupted shotgun reads 
March 10: MSR Theory Day, Microsoft Research, Redmond.
Title: Sequence assembly from corrupted shotgun reads 
February 12: Probability Seminar, University of Minnesota.
Title: Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors 
January 27: Theory Lunch, UC Berkeley.
Title: Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors

December 29: Statistical Physics Holiday Seminar, Eotvos Lorand University (ELTE).
Title: Braess's paradox for the spectral gap in random graphs 
November 23: Random Matrix Seminar, Princeton University.
Title: Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors 
October 13: Theory Seminar, University of Washington.
Title: From trees to seeds: on the inference of the seed from large random trees 
August 6: 4 minute short talk and poster presentation at the IMS New Researchers in Statistics and Probability conference, Seattle, WA.
Title: Braess's paradox for the spectral gap in random graphs 
July 29: Theory Lunch, Microsoft Research, Redmond.
Title: Braess's paradox for the spectral gap in random graphs 
March 27: Probability Seminar, University of Bristol.
Title: From trees to seeds: on the inference of the seed from large random trees 
January 22: Probability Seminar, UCSD.
Title: From trees to seeds: on the inference of the seed from large random trees 
January 15: Probability Seminar, University of WisconsinMadison.
Title: Testing for highdimensional geometry in random graphs 
January 14: SILO Seminar, University of WisconsinMadison.
Title: From trees to seeds: on the inference of the seed from large random trees 
January 12: Probability Seminar, Stanford University.
Title: From trees to seeds: on the inference of the seed from large random trees 
January 6: Probability Seminar, Budapest University of Technology and Economics.
Title: From trees to seeds: on the inference of the seed from large random trees

December 29: Statistical Physics Holiday Seminar, Eotvos Lorand University (ELTE).
Title: From trees to seeds: on the inference of the seed from large random trees 
December 3: Probability Seminar, UCLA.
Title: From trees to seeds: on the inference of the seed from large random trees 
November 5: Mathematical Physics & Probability Seminar, UC Davis.
Title: From trees to seeds: on the inference of the seed from large random trees 
October 22: Probability Seminar, UC Berkeley.
Title: From trees to seeds: on the inference of the seed from large random trees 
August 27: Theory Lunch, Microsoft Research, Redmond.
Title: Testing for highdimensional geometry in random graphs 
June 2: PIMS Summer School in Probability, UBC.
Title: Coexistence in preferential attachment networks 
April 15: Risk Management Seminar, UC Berkeley.
Title: Coexistence in preferential attachment networks

November 14: Probability Seminar, University of WisconsinMadison.
Title: Multidimensional sticky Brownian motions as limits of exclusion processes 
October 5: Bay Area Population Genomics Conference, UC Berkeley.
Title: Can one hear the shape of a population history? 
July 25: Cornell Probability Summer School.
Title: Coexistence in preferential attachment networks 
June 5: Theory Lunch, Microsoft Research, Redmond.
Title: Coexistence in preferential attachment networks 
May 15: Probability Seminar, UCLA.
Title: Coexistence in preferential attachment networks 
April 9: EconCS Seminar, UC Berkeley.
Title: Election manipulation: the average case 
March 13: Probability Seminar, UC Berkeley.
Title: Coexistence in preferential attachment networks

November 14: Mathematical Physics & Probability Seminar, UC Davis.
Title: Modeling Flocks and Prices: Jumping Particles with an Attractive Interaction 
June 7: PIMS Summer School in Probability, UBC.
Title: Modeling Flocks and Prices: Jumping Particles with an Attractive Interaction 
May 22: Symposium on Theory of Computing (STOC), New York, NY.
Title: Election manipulation: the average case 
April 18: PostDoc / Graduate Student Seminar, MSRI, Berkeley, CA.
Title: Election manipulation: the average case 
January 4: Probability Seminar, Budapest University of Technology and Economics.
Title: Election manipulation: the average case