Abstract We Survey the Published Work of Harry Kesten in Probability Theory, with Emphasis on His Contributions to Random Walks
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
I. Overview of Activities, April, 2005-March, 2006 …
MATHEMATICAL SCIENCES RESEARCH INSTITUTE ANNUAL REPORT FOR 2005-2006 I. Overview of Activities, April, 2005-March, 2006 …......……………………. 2 Innovations ………………………………………………………..... 2 Scientific Highlights …..…………………………………………… 4 MSRI Experiences ….……………………………………………… 6 II. Programs …………………………………………………………………….. 13 III. Workshops ……………………………………………………………………. 17 IV. Postdoctoral Fellows …………………………………………………………. 19 Papers by Postdoctoral Fellows …………………………………… 21 V. Mathematics Education and Awareness …...………………………………. 23 VI. Industrial Participation ...…………………………………………………… 26 VII. Future Programs …………………………………………………………….. 28 VIII. Collaborations ………………………………………………………………… 30 IX. Papers Reported by Members ………………………………………………. 35 X. Appendix - Final Reports ……………………………………………………. 45 Programs Workshops Summer Graduate Workshops MSRI Network Conferences MATHEMATICAL SCIENCES RESEARCH INSTITUTE ANNUAL REPORT FOR 2005-2006 I. Overview of Activities, April, 2005-March, 2006 This annual report covers MSRI projects and activities that have been concluded since the submission of the last report in May, 2005. This includes the Spring, 2005 semester programs, the 2005 summer graduate workshops, the Fall, 2005 programs and the January and February workshops of Spring, 2006. This report does not contain fiscal or demographic data. Those data will be submitted in the Fall, 2006 final report covering the completed fiscal 2006 year, based on audited financial reports. This report begins with a discussion of MSRI innovations undertaken this year, followed by highlights -
Strength in Numbers: the Rising of Academic Statistics Departments In
Agresti · Meng Agresti Eds. Alan Agresti · Xiao-Li Meng Editors Strength in Numbers: The Rising of Academic Statistics DepartmentsStatistics in the U.S. Rising of Academic The in Numbers: Strength Statistics Departments in the U.S. Strength in Numbers: The Rising of Academic Statistics Departments in the U.S. Alan Agresti • Xiao-Li Meng Editors Strength in Numbers: The Rising of Academic Statistics Departments in the U.S. 123 Editors Alan Agresti Xiao-Li Meng Department of Statistics Department of Statistics University of Florida Harvard University Gainesville, FL Cambridge, MA USA USA ISBN 978-1-4614-3648-5 ISBN 978-1-4614-3649-2 (eBook) DOI 10.1007/978-1-4614-3649-2 Springer New York Heidelberg Dordrecht London Library of Congress Control Number: 2012942702 Ó Springer Science+Business Media New York 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. -
Robert L Wolpert Curriculum Vitæ 2021 September 1. Personal
Robert L Wolpert Curriculum Vitæ 2021 September 1. Personal Information: Name: Robert Lee Wolpert Addr: Duke Univ Dept Statistical Science 211c Old Chem, Box 90251 Born: San Gabriel, California USA Durham, NC 27708-0251 USA 1950July22 Tel: +1-919-812-3235 Citizen: USA Net: [email protected] Web: www.stat.duke.edu/~rlw/ 2. Education: Ph.D. Princeton University, 1976 A.B. Cornell University, 1972 Department of Mathematics Department of Mathematics NSF Fellow, Princeton Fellow Cornell College Scholar Advs: Edward Nelson & Gilbert Hunt Advs: Frank Spitzer & Jack Kiefer Diss: Wiener Path Intersections and Local Times 3. Academic Appointments: Present: 2021- Emeritus Professor, Duke Univ. Department of Statistical Science 2021-24 Emeritus Professor, Duke Univ. Nicholas School of the Environment Previous: 2000-21 Professor, Duke Univ. Department of Statistical Science 2000-21 Professor, Duke Univ. Nicholas School of the Environment 2006-14 Adjunct Professor, Queensland University of Technology, Fac. of Math. Sci. 1999-06HonoraryProfessor, ImperialCollege,LondonDept. of Epi. & Pub. Health 1992-00 Associate Professor with Tenure, Duke Univ. Institute of Statistics and Decision Sciences 1987-92 Associate Professor, Duke Univ. Institute of Statistics and Decision Sciences 1986-88Research Associate Professor, Duke Center for Health Policy Research and Education 1984-90 Assistant Medical Research Professor, Duke Department of Pharmacology and 1982-84ResearchAssociate, LaboratoryofEnviron. Pharmacology and Toxicology 1982-83 Visiting Professor, UNC Department -
Divergence of Shape Fluctuation for General Distributions in First-Passage Percolation
DIVERGENCE OF SHAPE FLUCTUATION FOR GENERAL DISTRIBUTIONS IN FIRST-PASSAGE PERCOLATION SHUTA NAKAJIMA d Abstract. We study the shape fluctuation in the first-passage percolation on Z . It is known that it diverges when the distribution obeys Bernoulli in [Yu Zhang. The divergence of fluctuations for shape in first passage percolation. Probab. Theory. Related. Fields. 136(2) 298–320, 2006]. In this paper, we extend the result to general distributions. 1. Introduction First-passage percolation is a random growth model, which was first introduced by Hammersley and Welsh in 1965. The model is defined as follows. The vertices are the d d elements of Z . Let us denote the set edges by E : d d E = ffv; wgj v; w 2 Z ; jv − wj1 = 1g; Pd where we set jv − wj1 = i=1 jvi − wij for v = (v1; ··· ; vd), w = (w1; ··· ; wd). Note that we consider non-oriented edges in this paper, i.e., fv; wg = fw; vg and we sometimes d regard fv; wg as a subset of Z with a slight abuse of notation. We assign a non-negative d random variable τe on each edge e 2 E , called the passage time of the edge e. The collec- tion τ = fτege2Ed is assumed to be independent and identically distributed with common distribution F . d A path γ is a finite sequence of vertices (x1; ··· ; xl) ⊂ Z such that for any i 2 d f1; ··· ; l − 1g, fxi; xi+1g 2 E . It is customary to regard a path as a subset of edges as follows: given an edge e 2 Ed, we write e 2 γ if there exists i 2 f1 ··· ; l − 1g such that e = fxi; xi+1g. -
Ericsson's Conjecture on the Rate of Escape Of
TRANSACTIONS of the AMERICAN MATHEMATICAL SOCIETY Volume 240, lune 1978 ERICSSON'SCONJECTURE ON THE RATEOF ESCAPEOF ¿-DIMENSIONALRANDOM WALK BY HARRYKESTEN Abstract. We prove a strengthened form of a conjecture of Erickson to the effect that any genuinely ¿-dimensional random walk S„, d > 3, goes to infinity at least as fast as a simple random walk or Brownian motion in dimension d. More precisely, if 5* is a simple random walk and B, a Brownian motion in dimension d, and \j/i [l,oo)-»(0,oo) a function for which /"'/^(OiO, then \¡/(n)~'\S*\-» oo w.p.l, or equivalent^, ifr(t)~'\Bt\ -»oo w.p.l, iff ffif/(tY~2t~d/2 < oo; if this is the case, then also $(ri)~'\S„\ -» oo w.p.l for any random walk Sn of dimension d. 1. Introduction. Let XX,X2,... be independent identically distributed ran- dom ¿-dimensional vectors and S,, = 2"= XX¡.Assume throughout that d > 3 and that the distribution function F of Xx satisfies supp(P) is not contained in any hyperplane. (1.1) The celebrated Chung-Fuchs recurrence criterion [1, Theorem 6] implies that1 |5n|->oo w.p.l irrespective of F. In [4] Erickson made the much stronger conjecture that there should even exist a uniform escape rate for S„, viz. that «""iSj -* oo w.p.l for all a < \ and all F satisfying (1.1). Erickson proved his conjecture in special cases and proved in all cases that «-a|5„| -» oo w.p.l for a < 1/2 — l/d. Our principal result is the following theorem which contains Erickson's conjecture and which makes precise the intuitive idea that a simple random walk S* (which corresponds to the distribution F* which puts mass (2d)~x at each of the points (0, 0,..., ± 1, 0,..., 0)) goes to infinity slower than any other random walk. -
An Interview with Martin Davis
Notices of the American Mathematical Society ISSN 0002-9920 ABCD springer.com New and Noteworthy from Springer Geometry Ramanujan‘s Lost Notebook An Introduction to Mathematical of the American Mathematical Society Selected Topics in Plane and Solid Part II Cryptography May 2008 Volume 55, Number 5 Geometry G. E. Andrews, Penn State University, University J. Hoffstein, J. Pipher, J. Silverman, Brown J. Aarts, Delft University of Technology, Park, PA, USA; B. C. Berndt, University of Illinois University, Providence, RI, USA Mediamatics, The Netherlands at Urbana, IL, USA This self-contained introduction to modern This is a book on Euclidean geometry that covers The “lost notebook” contains considerable cryptography emphasizes the mathematics the standard material in a completely new way, material on mock theta functions—undoubtedly behind the theory of public key cryptosystems while also introducing a number of new topics emanating from the last year of Ramanujan’s life. and digital signature schemes. The book focuses Interview with Martin Davis that would be suitable as a junior-senior level It should be emphasized that the material on on these key topics while developing the undergraduate textbook. The author does not mock theta functions is perhaps Ramanujan’s mathematical tools needed for the construction page 560 begin in the traditional manner with abstract deepest work more than half of the material in and security analysis of diverse cryptosystems. geometric axioms. Instead, he assumes the real the book is on q- series, including mock theta Only basic linear algebra is required of the numbers, and begins his treatment by functions; the remaining part deals with theta reader; techniques from algebra, number theory, introducing such modern concepts as a metric function identities, modular equations, and probability are introduced and developed as space, vector space notation, and groups, and incomplete elliptic integrals of the first kind and required. -
Notices of the American Mathematical Society
CALENDAR OF AMS MEETINGS THIS CALENDAR lists all meetings which have been approved by the Council prior to the date this issue of the NOTICES was sent to press. The summer and annual meetings are joint meetings of the Mathematical Association of America and the American Mathematical Society. The meeting dates which fall rather far in the future are subject to change; this is particularly true of meetings to which no numbers have yet been assigned. Programs of the meetings will appear in the issues indicated below. First and second announcements of the meetings will have appeared in earlier issues. ABSTRACTS OF CONTRIBUTED PAPERS should be submitted on special forms which are available in most de partments of mathematics; forms can also be obtained by writing to the headquarters of the Society. Abstracts of papers to be presented at the meeting in person must be received at the headquarters of the Society in Providence, Rhode Island, on or before the deadline for the meeting. Note that the deadline for abstracts to be considered for presentation at special sessions is three weeks earlier than that given below. For additional information consult the meeting announcement and the list of organizers of special sessions. MEETING ABSTRACTS NUMBER DATE PLACE DEADLINE for ISSUE 768 August 21-25, 1979 Duluth, Minnesota JUNE 12 August (83rd Summer Meeting) 769 October 20-21, 1979 Washington, D.C. AUGUST 22} October 770 November 2-3, 1979 Kent, Ohio AUGUST 27 771 November 9-10, 1979 Birmingham, Alabama SEPTEMBER 19 } November 772 November 16-17, -
Harry Kesten's Work in Probability Theory
Abstract We survey the published work of Harry Kesten in probability theory, with emphasis on his contributions to random walks, branching processes, perco- lation, and related topics. A complete bibliography is included of his publications. Keywords Probability, random walk, branching process, random matrix, diffusion limited aggregation, percolation. Mathematics Subject Classification (2010) 60-03, 60G50, 60J80, 60B20, 60K35, 82B20. arXiv:2004.03861v2 [math.PR] 13 Nov 2020 Noname manuscript No. 2(will be inserted by the editor) Geoffrey R. Grimmett Harry Kesten's work in probability theory Geoffrey R. Grimmett In memory of Harry Kesten, inspiring colleague, valued friend Submitted 20 April 2020, revised 26 October 2020 Contents 1 Overview . .2 2 Highlights of Harry Kesten's research . .4 3 Random walk . .8 4 Products of random matrices . 17 5 Self-avoiding walks . 17 6 Branching processes . 19 7 Percolation theory . 20 8 Further work . 31 Acknowledgements . 33 References . 34 Publications of Harry Kesten . 40 1 Overview Harry Kesten was a prominent mathematician and personality in a golden period of probability theory from 1956 to 2018. At the time of Harry's move from the Netherlands to the USA in 1956, as a graduate student aged 24, much of the foundational infrastructure of probability was in place. The central characters of probability had long been identified (including random walk, Brownian motion, the branching process, and the Poisson process), and connections had been made and developed between `pure theory' and cognate areas ranging from physics to finance. In the half-century or so since 1956, a coordinated and refined theory has been developed, and probability has been recognised as a crossroads discipline in mathematical science. -
Jennifer Tour Chayes March 2016 CURRICULUM VITAE Office
Jennifer Tour Chayes March 2016 CURRICULUM VITAE Office Address: Microsoft Research New England 1 Memorial Drive Cambridge, MA 02142 e-mail: [email protected] Personal: Born September 20, 1956, New York, New York Education: 1979 B.A., Physics and Biology, Wesleyan University 1983 Ph.D., Mathematical Physics, Princeton University Positions: 1983{1985 Postdoctoral Fellow in Mathematical Physics, Departments of Mathematics and Physics, Harvard University 1985{1987 Postdoctoral Fellow, Laboratory of Atomic and Solid State Physics and Mathematical Sciences Institute, Cornell University 1987{1990 Associate Professor, Department of Mathematics, UCLA 1990{2001 Professor, Department of Mathematics, UCLA 1997{2005 Senior Researcher and Head, Theory Group, Microsoft Research 1997{2008 Affiliate Professor, Dept. of Physics, U. Washington 1999{2008 Affiliate Professor, Dept. of Mathematics, U. Washington 2005{2008 Principal Researcher and Research Area Manager for Mathematics, Theoretical Computer Science and Cryptography, Microsoft Research 2008{ Managing Director, Microsoft Research New England 2010{ Distinguished Scientist, Microsoft Corporation 2012{ Managing Director, Microsoft Research New York City Long-Term Visiting Positions: 1994-95, 1997 Member, Institute for Advanced Study, Princeton 1995, May{July ETH, Z¨urich 1996, Sept.{Dec. AT&T Research, New Jersey Awards and Honors: 1977 Johnston Prize in Physics, Wesleyan University 1979 Graham Prize in Natural Sciences & Mathematics, Wesleyan University 1979 Graduated 1st in Class, Summa Cum Laude, -
Annual Report 1998–99
Department of Mathematics Cornell University Annual Report 1998Ð99 The image on the cover is taken from a catalogue of several hundred “symmetric tensegrities” developed by Professor Robert Connelly and Allen Back, director of our Instructional Computer Lab. (The whole catalogue can be viewed at http://mathlab.cit.cornell.edu/visualization/tenseg/tenseg.html.) The 12 balls represent points in space placed at the midpoints of the edges of a cube. The thin dark edges represent “cables,” each connecting a pair of vertices. If two vertices are connected by a cable, then they are not permitted to get further apart. The thick lighter shaded diagonals represent “struts.” If two vertices are connected by a strut, then they are not permitted to get closer together. The examples in the catalogue — including the one represented on the cover — are constructed so that they are “super stable.” This implies that any pair of congurations of the vertices satisfying the cable and strut constraints are congruent. So if one builds this structure with sticks for the struts and string for the cables, then it will be rigid and hold its shape. The congurations in the catalogue are constructed so that they are “highly” symmetric. By this we mean that there is a congruence of space that permutes all the vertices, and any vertex can be superimposed onto any other by one of those congruences. In the case of the image at hand, all the congruences can be taken to be rotations. Department of Mathematics Annual Report 1998Ð99 Year in Review: Mathematics Instruction and Research Cornell University Þrst among private institutions in undergraduates who later earn Ph.D.s. -
Random Graph Dynamics
1 Random Graph Dynamics Rick Durrett Copyright 2007, All rights reserved. Published by Cambridge University Press 2 Preface Chapter 1 will explain what this book is about. Here I will explain why I chose to write the book, how it is written, where and when the work was done, and who helped. Why. It would make a good story if I was inspired to write this book by an image of Paul Erd¨osmagically appearing on a cheese quesadilla, which I later sold for thousands on dollars on eBay. However, that is not true. The three main events that led to this book were (i) the use of random graphs in the solution of a problem that was part of Nathanael Berestycki’s thesis, (ii) a talk that I heard Steve Strogatz give on the CHKNS model, which inspired me to prove some rigorous results about their model, and (iii) a book review I wrote on the books by Watts and Barab´asifor the Notices of the American Math Society. The subject of this book was attractive for me, since many of the papers were outside the mathematics literature, so the rigorous proofs of the results were, in some cases, interesting mathematical problems. In addition, since I had worked for a number of years on the proper- ties of stochastic spatial models on regular lattices, there was the natural question of how did the behavior of these systems change when one introduced long range connections between individuals or considered power law degree distributions. Both of these modifications are reasonable if one considers the spread of influenza in a town where children bring the disease home from school, or the spread of sexually transmitted diseases through a population of individuals that have a widely varying number of contacts. -
A Model for Random Chain Complexes
A MODEL FOR RANDOM CHAIN COMPLEXES MICHAEL J. CATANZARO AND MATTHEW J. ZABKA Abstract. We introduce a model for random chain complexes over a finite field. The randomness in our complex comes from choosing the entries in the matrices that represent the boundary maps uniformly over Fq, conditioned on ensuring that the composition of consecutive boundary maps is the zero map. We then investigate the combinatorial and homological properties of this random chain complex. 1. Introduction There have been a variety of attempts to randomize topological constructions. Most famously, Erd¨os and R´enyi introduced a model for random graphs [6]. This work spawned an entire industry of probabilistic models and tools used for under- standing other random topological and algebraic phenomenon. These include vari- ous models for random simplicial complexes, random networks, and many more [7, 13]. Further, this has led to beautiful connections with statistical physics, for exam- ple through percolation theory [1, 3, 12]. Our ultimate goal is to understand higher dimensional topological constructions arising in algebraic topology from a random perspective. In this manuscript, we begin to address this goal with the much sim- pler objective of understanding an algebraic construction commonly associated with topological spaces, known as a chain complex. Chain complexes are used to measure a variety of different algebraic, geoemtric, and topological properties Their usefulness lies in providing a pathway for homolog- ical algebra computations. They arise in a variety of contexts, including commuta- tive algebra, algebraic geometry, group cohomology, Hoschild homology, de Rham arXiv:1901.00964v1 [math.CO] 4 Jan 2019 cohomology, and of course algebraic topology [2, 4, 9, 10, 11].