CURRICULUM VITAE

Name: PAUL NEVILLE BALISTER Department:MATHEMATICAL SCIENCES


EDUCATION
DEGREES DISCIPLINE INSTITUTION YEAR
PhD Mathematics Cambridge University, England 1992
MA Mathematics Cambridge University, England 1990
BA Mathematics Cambridge University, England 1987

EXPERIENCE
RANK/POSITION DEPARTMENT/DIVISION INSTITUTION/COMPANY/ORGANIZATION PERIOD
PhD Student DPMMS (Pure Math) Cambridge University, UK 1988-1992
Benjamin Peirce Fellow Dept. of Math Harvard University 1992-1995
Research Associate DPMMS (Pure Math) Cambridge University, UK 1996-1998
Assistant Professor Math Sciences University of Memphis 1998-2002
Associate Professor Math Sciences University of Memphis 2002-2006
Full Professor Math Sciences University of Memphis 2006-Present
Associate Chair Math Sciences University of Memphis 2013-Present
Visiting Fellow Commoner Trinity College Cambridge University, UK Jaunary 2016-June 2016

HONORS/AWARDS
HONOR/AWARD INSTITUTION/COMPANY/ORGANIZATION YEAR
Bronze medal International Mathematics Olympiad 1982
Silver medal International Mathematics Olympiad 1983
Gold medal International Mathematics Olympiad 1984
Yeates Essay prize Cambridge University, England 1986
de Lancey prize Cambridge University, England 1987
Smith's prize Cambridge University, England 1990
Senior Rouse Ball Scholarship Trinity College, Cambridge University, England 1991
Alumni Association Award for Distinguished Research in Science, Engineering and Mathematics University of Memphis 2017
Paul Erdos Professor Department of Math Sciences, Memphis 2013-2016

TEACHING EXPERIENCE
SUBJECT INSTITUTION
Calculus, Multivariable Calculus (U) Harvard University
Elliptic Curves and Modular Forms Tutorial (U) Harvard University
Number Theory (Iwasawa Theory, Class Field Theory) (G) Harvard University
Graduate Algebra (G) Harvard University
Galois Theory (U) Cambridge University, UK
Calculus III (Math 2322), Elementary Calculus (Math 1312/1830) (U) University of Memphis
Foundations of Math I & II (Math 1181,1182,1420) (U) University of Memphis
Mathematics for Elementary School Teachers I & II (Math 1480,2015) (U) University of Memphis
Experiences in Math (Math 2000) (U) University of Memphis
Discrete Mathematics (Math 2701) (U) University of Memphis
Elementary Number Theory (Math 3221) (U) University of Memphis
Complex Variable (Math 4361/6361,7361) (U/G) University of Memphis
Abstract Algebra (Math 4261/6261) (U/G) University of Memphis
Algebraic Theory I and II (Math 7261,7262) (G) University of Memphis
Real Variables I and II (Math 7350,7351) (G) University of Memphis
P-adic Analysis and Number Theory (Math 7027/8027, 7291) (G) University of Memphis
Linear Algebra for Teachers (Math 7281) (G) University of Memphis
Random Geometric Graphs (Math 7021/8021) (G) University of Memphis
Probability and Statistics (Math 4614/6614) (U/G) University of Memphis
Percolation Theory (Math 7029/8029) (G) University of Memphis


STUDENT ADVISING/MENTORING
CURRENT DEGREE NAME YEAR OF GRADUATION
Ph.D. Ali Dogan 2016
MS (Thesis advisor) Stephen Smith 2013
Ph.D. (Joint advisor) Neal Bushaw 2012
Ph.D. Jeffrey Wheeler 2007
Ph.D. Stephen Smith 2019

Refereed Journal Publications

Paul Balister, Béla Bollobás, Alan Stacey. Upper bounds for the critical probability of oriented percolation in two dimensions. Proc. Royal Soc. London Ser. A 440 (1993), no. 1908, 201–220.   

Paul Balister, Béla Bollobás, Alan Stacey. Improved upper bounds for the critical probability of oriented percolation in two dimensions. Random Structures & Algorithms 5 (1994), no. 4, 573–589.    

Paul Balister, Susan Howson. Note on Nakayama’s lemma for compact Λ-Modules. Asian J. Math. 1 (1997), no. 2, 224–229.       

Paul Balister. Characteristic distributions for non-torsion ?-modules. Elliptic Curves, Modular Forms and Fermat’s Last Theorem (Hong Kong, 1993). Series in Number Theory, Vol I, 2nd Edition, 141–151, International Press Inc, Cambridge MA, (1997).

Paul Balister, Béla Bollobás, Alan Stacey. Counting boundary paths for oriented percolation clusters. Random Structures & Algorithms 14 (1999), no. 1, 1–28.

Paul Balister, Béla Bollobás, Alan Stacey. Dependent percolation in two dimensions. Probability Theory and Related Fields 117 (2000), no. 4, 495–513.

Paul Balister, Béla Bollobás, Oliver Riordan, Alex Scott. Alternating knot diagrams, Euler circuits and the interlace polynomial. European Journal of Combinatorics 22 (2001), no. 1, 1–4.

Paul Balister. On the Alspach conjecture. Combinatorics, Probability and Computing 10 (2001), no. 2, 95–125.   

Paul Balister. Packing circuits into KN. Combinatorics, Probability and Computing 10 (2001), no. 6, 463–499.   

Paul Balister. Vertex-distinguishing edge colorings of random graphs. Random Structures & Algorithms 20 (2002), no. 1, 89–97.

Paul Balister, Richard Schelp, Miklos Simonovits. A note on Ramsey size-linear graphs. Journal of Graph Theory 39 (2002), no. 1, 1–5.

Paul Balister, Béla Bollobás, Richard Schelp. Vertex-distinguishing colorings of graphs with Δ(G)=2. Discrete Mathematics 252 (2002), no. 1–3, 17–29.

Paul Balister, Béla Bollobás, Jonathan Cutler, Luke Pebody. The interlace polynomial of graphs at −1. European Journal of Combinatorics 23 (2002), no. 7, 761–767.

Paul Balister, Yair Caro, Cecil Rousseau, Raphael Yuster. Zero-sum square matrices. European Journal of Combinatorics 23 (2002), no. 5, 489–497.   

Paul Balister, Béla Bollobás, Anthony Quas. Entropy along convex shapes, random tilings and shifts of finite type. Illinois Journal of Math. 46 (2002), no. 3, 781–795.

Paul Balister, Oliver Riordan, Richard Schelp. Vertex-distinguishing edge colorings of graphs. Journal of Graph Theory 42 (2003), no. 2, 95–109.   

Paul Balister, Béla Bollobás, Oliver Riordan, Richard Schelp. Graphs with large maximum degree containing no odd cycles of a given length. Journal of Combin. Theory B 87 (2003), no. 2, 366–373.   

Paul Balister. Packing digraphs with directed closed trails. Combinatorics, Probability and Computing 12 (2003), no. 1, 1–15.

Paul Balister. Packing closed trails into dense graphs. Journal of Combin. Theory B 88 (2003), no. 1, 107–118.

Paul Balister, Alexandr Kostochka, Hao Li, Richard Schelp. Balanced edge colorings. Journal of Combin. Theory B 90 (2004), no. 1, 3–20.

Paul Balister, Ervin Győri, Jenö Lehel, Richard Schelp. Longest paths in circular arc graphs. Combinatorics, Probability and Computing 13 (2004), no. 3, 311–317.

Paul Balister, Béla Bollobás, Mark Walters. Continuum percolation with steps in an annulus. Annals of Applied Probability 14 (2004), no. 4, 1869–1879.

Paul Balister, Béla Bollobás, Anthony Quas. Percolation in Voronoi tilings. Random Structures & Algorithms 26 (2005), no. 3, 310–318.

Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. Connectivity of random k-nearest-neighbour graphs. Advances in Applied Probability 37 (2005), no. 1, 1–24.

Paul Balister, Béla Bollobás, Mark Walters. Continuum percolation with steps in the square or the disc. Random Structures & Algorithms 26 (2005), no. 4, 392–403.

Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter Freeman. Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions, Biological Cybernetics 92 (2005), no. 6, 367–379.

Paul Balister, Jenö Lehel, Richard Schelp. Ramsey unsaturated and saturated Graphs. Journal of Graph Theory 51 (2006), no. 1, 22–32.

Paul Balister, András Gyárfás, Jenö Lehel, Richard Schelp. Mono-multi bipartite Ramsey numbers, designs, and matrices. Journal of Combinatorial Theory A 113 (2006), no. 1, 101–112.

Paul Balister, Béla Bollobás. Pair dominating graphs. European Journal of Combinatorics 27 (2006), no. 2, 322–328.

Paul Balister, Béla Bollobás, Robert Kozma. Large deviations for mean field models of probabilistic cellular automata. Random Structures & Algorithms 29 (2006), no. 3, 399–415.

Paul Balister, Ervin Győri, Jenö Lehel, Richard Schelp. Adjacent vertex distinguishing edge-colorings. SIAM J. Discrete Math. 21 (2007), no. 1, 237–250.

Paul Balister, Béla Bollobás. Counting regions with bounded surface area. Communication in Mathematical Physics 273 (2007), no. 2, 305–315. 

Paul Balister, Béla Bollobás, Stefanie Gerke. The generalized Randić index of trees. Journal of Graph Theory 56 (2007), no. 4, 270–286.

Paul Balister, Béla Bollobás, Stefanie Gerke. Connectivity of addable graph classes. Journal of Combinatorial Theory B 98 (2008), no. 3, 577–584.

Paul Balister, Béla Bollobás, Stefanie Gerke. Sequences with changing dependencies. SIAM J. of Discrete Math 22 (2008), no. 3, 1149–1154.

Paul Balister, Ervin Győri, Jenö Lehel, Richard Schelp. Connected graphs without long paths. Discrete Math. 308 (2008), no. 19, 4487–4494.

Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. Connectivity of a Gaussian network, International Journal of Ad Hoc and Ubiquitous Computing 3 (2008), no. 3, 204–213.

Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. Highly connected random geometric graphs. Discrete Applied Mathematics 157 (2009), no. 2, 309–320.

Paul Balister, Stefanie Gerke, Gregory Gutin. Convex sets in acyclic digraphs. Order 26 (2009), no. 1, 95–100.

Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. A critical constant for the k-nearest-neighbour model. Advances in Applied Probability 41 (2009), no. 1, 1–12.

Paul Balister, Béla Bollobás, Mark Walters. Random transceiver networks. Advances in Applied Probability 41 (2009), no. 2, 323–343.

Paul Balister, Jeffrey Wheeler. The Erdős–Heilbronn problem for finite groups. Acta Arithmetica 140 (2009), no. 2, 105–118.

Paul Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo. Algorithms for generating convex sets in acyclic digraphs. Journal of Discrete Algorithms 7 (2009), no. 4, 509–51

Paul Balister, Béla Bollobás, Amites Sarkar. Percolation, connectivity, coverage and colouring of random geometric graphs. Handbook of Large-Scale Random Networks 117–142, Bolyai Society Mathematical Studies 18, Springer, Berlin, (2009). Editors: Béla Bollobás, Robert Kozma, Dezső Mikl

Paul Balister, Steven Kalikow, Amites Sarkar. The Linus sequence. Combinatorics, Probability and Computing 19 (2010), no. 1, 21–46.

Paul Balister, Béla Bollobás. Bond percolation with attenuation in high dimensional Voronoĭ tilings. Random Structures & Algorithms 36 (2010), no. 1, 5–10.

Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters. Random majority percolation. Random Structures & Algorithms 36 (2010), no. 3, 315–340.

Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. Sentry selection in wireless networks. Advances in Applied Probability 42 (2010), no. 1, 1–25.

Paul Balister, Ervin Győri, Richard Schelp. Coloring vertices and edges of a graph by nonempty subsets of a set. European J. Combin. 32 (2011), no. 4, 533–537.

Paul Balister, Balázs Patkós. Random partial orders defined by angular domains. Order 28 (2011), no. 2, 341–355.

Paul Balister, Béla Bollobás. Critical probabilities of 1-independent percolation models. Combintorics, Probability and Computing 21 (2012), no. 1–2, 11–22.

Paul Balister, Béla Bollobás. Projections, entropy and sumsets. Combinatorica 32 (2012), no 2, 125–141.

Paul Balister, Randall McCutcheon. A concentration function estimate and intersective sets from matrices. Israel J. Math. 189 (2012), 413–436.

Paul Balister, Béla Bollobás. Percolation in the k-nearest neighbor graph. In Recent Results in Designs and Graphs: a Tribute to Lucia Gionfriddo, Quaderni di Matematica, Volume 28, edited by Marco Buratti, Curt Lindner, Francesco Mazzocca, and Nicola Melone (2013) 83-100.

Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne. Repeated degrees in random uniform hypergraphs. SIAM J. Discrete Math. 27 (2013), 145–154.

Paul Balister, Béla Bollobás, Interference Percolation. Random Structures & Algorithms 44 (2014) 399-418.

Paul Balister, Béla Bollobás. Random union-closed families. Number theory, analysis, and combinatorics, 1–9, De Gruyter Proc. Math., De Gruyter, Berlin, 2014.

Paul Balister, Béla Bollobás, Zoltán Füredi, John Thompson. Minimal symmetric differences of lines in projective planes. Journal of Combinatorial Designs 22 (2014) 435-451.

Paul Balister, Stefanie Gerke. Controllability and matchings in random bipartite graphs. Surveys in combinatorics 2015, 119-145, London Math. Soc. Lecture Note Ser., 424, Cambridge Univ. Press, Cambridge, 2015.

Paul Balister, Béla Bollobás, Michal Przykucki, Paul Smith. Subcritical U-bootstrap percolation models have non-trivial phase transitions. Trans. Amer. Math. Soc. 368 (2016), no. 10, 7385-7411.

Paul Balister, Béla Bollobás, Jenö Lehel, Michał Morayne. Random Hypergraph Irregularity. SIAM J. Discrete Math. 30 (2016), no. 1, 465-473.

Paul Balister, Béla Bollobás, Karen Gunderson. Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. European J. Combin. 57 (2016), 85-93.

Paul Balister, Béla Bollobás, Zoltán Füredi, Imre Leader, Mark Walters. Subtended Angles. Israel Journal of Mathematics 214 (2016), no. 2, 995-1012.

Paul Balister, Béla Bollobás, Amites Sarkar. Barrier coverage. Random Structures & Algorithms 49 (2016), no. 3, 429-478.

Paul Balister, Béla Bollobás, Paul Smith. The time of bootstrap percolation in two dimensions Probab. Theory Relat. Fields 166 (2016) no. 1-2, 321-364.

Paul Balister, Stefanie Gerke, Andrew McDowell. Adversarial resilience of matchings in bipartite random graphs. Journal of Combinatorics 8 (2017), no. 1, 79-92.

Paul Balister, Amy Shaw, Béla Bollobás, Bhargav Narayanan. Catching a fast robber on the grid. Journal of Combinatorial Theory A 152 (2017), 341–352.

Paul Balister, Hao Li, Richard Schelp. Decompositions of graphs into cycles with chords, Journal of Combinatorial Theory B 128 (2018), 47–65.

Paul Balister, Béla Bollobás, Robert Morris. The sharp threshold for making squares. Ann. of Math. (2) 188 (2018), no. 1, 49-143.

Paul Balister, József Balogh, Enrico Bertuzzo, Béla Bollobás, Guido Caldarelli, Amos Maritan, Rossana Mastrandrea, Robert Morris, Andrea Rinaldo. River landscapes and optimal channel networks. Proc. Natl. Acad. Sci. USA 115 (2018), no. 26, 6548–6553.

Paul Balister, Béla Bollobás, Karen Gunderson, Imre Leader, Mark Walters. Random geometric graphs and isometries of normed spaces. Trans. Amer. Math. Soc. 370 (2018), no. 10, 7361–7389.

Paul Balister, Ali Dogan. On the edge spectrum of saturated graphs for paths and stars. Journal of Graph Theory 89 (2018), 364–385.

Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav Narayanan. Coalescence on the real line. Trans. Amer. Math. Soc. 371 (2019), 1583–1619.

Paul Balister, Béla Bollobás, Jonathan Lee, Robert Morris, Oliver Riordan. A note on Linnik's Theorem on quadratic non-residues. Arch. Math. (Basel) 112 (2019), 371–375.

Refereed Conference Publications

Robert Kozma, Paul Balister, Béla Bollobás, and Walter Freeman. Dynamical percolation models of phase transitions in the cortex, Proceedings: NOLTA 2001 Nonlinear Theory and its Applications. Miyagi, Japan. Oct 28 – Nov 1, 2001. Vol I 55–58.

Robert Kozma, Paul Balister, and Béla Bollobás. Self-organized development of behaviors in spatio-temporal dynamical systems. International Joint Conference on Neural Networks IJCNN 2002, World Congress on Computational Intelligence WCCI 2002, Honolulu, Hawaii, May 12–17, 2002, pp.2261–2

Paul Balister, Bela Bollobás, Mark Walters. Fast transmission in ad hoc networks. Information Theory, 2004. ISIT 2004.

Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter Freeman. Neuropercolation: A Random Cellular Automata Approach to Spatio-Temporal Neurodynamics. Proc. ACRI 2004. Lecture Notes in Computer Science, vol. 3305, (2004) pp. 435–443.

Paul Balister, Béla Bollobás, Santosh Kumar, Amites Sarkar. Reliable density estimates for deployment of sensors in thin strips. ACM MobiCom 2007, 75–86.

Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun Sinha. Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks. INFOCOM 2009, 136-144.

Paul Balister, Santosh Kumar. Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors, INFOCOM 2009, 2896-2900.

Paul Balister, Béla Bollobás, Stefanie Gerke. Connectivity of random addable graphs, Advances in discrete mathematics and applications: Mysore, 2008, 125–132, Ramanujan Math. Soc. Lect. Notes Ser., 13, Ramanujan Math. Soc., Mysore, 2010.

Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan Willsky. Energy-latency tradeoff for in-network function computation in random networks, INFOCOM 2011, 1575-1583.

Presentations - Conference (refereed *)

Graph Coloring Workshop, June 23-July 2, 1999, Budapest, Hungary. 1 hour talk on Balanced Edge Colorings. Work by P.N. Balister, A. Kostochka, Hao Li, R.H. Schelp.  

Ninth Quadrennial International Conference in Graph Theory, Combinatorics, Algorithms, and Applications, June 4-9, 2000, Kalamazoo. 20 minute talk on Packing cycles into Kn. Work by P.N. Balister.   

LA/MS MAA Conference, March 23-24, 2001, University of Mississippi. 15 minute talk on Vertex distinguishing Colorings. Work by P.N. Balister, O.M. Riordan, R.H. Schelp.  

Erdos Lecture, March 2, 2002, University of Memphis. 25 minute talk on Graphs with large maximum degree containing no C_{2k+1}. Work by P.N. Balister, B. Bollobas, O.M. Riordan, R.H. Schelp.     

15th Cumberland Conference, May 15-17, 2002, University of Mississippi. 20 minute talk on Voronoi Percolation. Work by P.N. Balister, B. Bollob s, A. Quas.  

CMS Summer Meeting, June 15-17, 2002, Universit Leval, Quebec. 15 minute talk on Cycle Decompositions. Work by P.N. Balister.  

AMS Fall Southeastern Section Meeting, October 16-17, 2004, Nashville TN. 20 minute talk on Mono-multi bipartite Ramsey numbers, designs, and matrices. Work by P.N. Balister, A. Gyarfas, J. Lehel, R.H. Schelp.   

Random Graphs and Large-Scale Real-World Networks, 6 May - 16 Jun 2006, Singapore. 30 minute talk on Interference Percolation. Work by P.N. Balister and B. Bollobas.   

AMS Meeting at Fayetteville, Arkansas, November 3–4, 2006. 25 minute talk on Pair dominating graphs. Work by P.N. Balister and B. Bollobas. 

EXCILL Conference, University of Illinois at Urbana-Champaign, November 18–20, 2006. 30 minute talk on Interference Percolation. Work by P.N. Balister and B. Bollobas.  

Lincoln, Nebraska, April 21, 2007. 40 minute conference talk on 1-dependent percolation. Work by P.N. Balister and B. Bollobas.     

31st SIAM Southeastern-Atlantic Section Conference, University of Memphis, May 4, 2007. 30 minute talk on Critical constant for the k-nearest neighbor graph in the plane. Work by P.N. Balister, B. Bollobas, A. Sarkar, M. Walters.   

MobiCom 2007 conference, Montreal, Canada. September 11, 2007. 30 minute talk on Reliable Density Estimates for Coverage and Connectivity in Thin Strips of Finite Length. Work by P.N. Balister, B. Bollobas, S. Kumar, A. Sarkar.

CVE conference, April 18–19, 2008,  Illinois State University. 25 minute talk on Sentry selection. Work by P.N. Balister, B. Bollobas, A. Sarkar, M. Walters.

AMS Spring Central Sectional Meeting, March 27-29, 2009, Urbana, Illinois. 25 minute talk on Random transceiver networks.

24th MCCCC Conference, Normal IL, September 10–12, 2010. 20 min talk on Decompositions of graphs into cycles with chords.

CLION Mini-conference, Memphis, September 20, 2010. 45 min talk on Energy vs. Latency.

2nd Atlanta Series on Graph Theory and Combinatorics, Georgia State University February 26-27, 2011. Talk given on Mean-field k-nearest neighbor graph.

28th Brazilian Colloquium of Mathematics, IMPA, Rio de Janeiro July 25-29, 2011. Talk given on Barrier Coverage.

Paul Erdös Memorial Lecture Series, University of Memphis, May 17-18, 2012. Talk on Hamiltonicity in the k-nerarest neighbor graphs.

EXCILL2: Extremal Combinatorics at Illinois, March 16-18, 2013. Talk on Controllability, matchings, and the Karp-Sipser algorithm on random graphs.

26th Cumberland Conference on Combinatorics, Graph Theory & Computing, MTSU, May 24-26, 2013. Plenary talk on Controllability, Matchings, and the Karp-Sipser Algorithm on Random Graphs

Combinatorics in Cambridge 2013. Cambridge University, August 1-3, 2013. Talk on Random vertex orderings of graphs.

Fall Southeastern Sectional Meeting, University of Louisville, Louisville, KY. October 5-6, 2013. Talk on Random vertex orderings of graphs.

AMS Sectional meeting, University of North Carolina, Greensboro, November 8, 2014. 20 minute talk on The speed of Bootstrap Percolation.

3rd annual Mississippi Discrete Mathematics Workshop, Mississippi State University, November 15-16, 2014. Featured speaker (1 hour talk) on Minimal symmetric differences of lines in projective planes.

Atlanta Lecture Series in Combinatorics, Georgia Tech, April 11-12, 2015. 1 hour talk on Coalescence on the Real Line.

AMS Sectional meeting, Las Vegas, Nevada. April 18, 2015. 25 minute talk on Independence Densities of Graphs and Hypergraphs.

Oberwolfach, April 19, 2016. 50 minute talk on The sharp threshold for making squares

Newton Institute, Cambridge, UK. 45 minute talk on Barrier Coverage in Thin Strips.

AMS sectional meeting, Raleigh, November 13, 2016. 25 minute talk on Independence densities of hypergraphs.

AMS Sectional Meeting, Vanderbilt, Nashville TN, April 14-15, 2018. 1 hour talk on The sharp threshold for making squares.

Combinatorics: extremal, probabilistic and additive, Sao Paulo, 23rd to 27th July 2018. 40 minute talk on The sharp threshold for making squares.

Recent Advances in Extremal Combinatorics University of Oxford, December 4, 2018. 40 minute lecture on Covering systems.

Oberwolfach workshop on Combinatorics, Probability and Computing, April 16, 2019. 25 minute talk On Erdos Covering systems.

Presentations - Universities/Industry (refereed *)

Random Graphs and Large-Scale Real-World Networks , 6 May - 16 Jun 2006, Singapore. Presented 4 one-hour lectures in lecture series on Branching processes.  

ETH Zurich, December 19, 2006. 30 minute seminar talk on Cycle Decompositions. Work by P.N. Balister.  

Royal Holloway, London, England. June 19, 2007. Seminar talk on Cycle decompositions. Work by P.N. Balister.    

DPMMS, University of Cambridge, England. June, 2007. Seminar talk on Interference Percolation. Work by P.N. Balister and B. Bollobas.   

Emory University, December 5, 2008. 1 hour seminar talk on Sentry Selection. Work by P.N. Balister, B. Bollobas, A. Sarkar, M. Walters.  

Wroclaw University of Technology, Poland, May 2009. Special International Semester Lecture series on random networks (10 hours).

Newton Institute, Cambridge UK, May 10–31, 2010. 1 hour talk given on Energy vs. Latency.

DPMMS Cambridge, UK, June 24, 2010. 1 hour seminar on The Linus sequence.

Wroclaw University of Technology, Poland, June 14–19, 2010. 1 hour seminar on Energy vs. Latency.

Microsoft Research, Redmond, Seattle 28 March – 3 April, 2011. Talk given on The Linus sequence.

Memphis–Budapest Summer School in Combinatorics, 7 August – 20 August 2011. Lecture course given on Branching processes.

Seminar on Subtending many angles with few points at University of Mississippi, March 18, 2015.

LSE London, UK, March 18, 2016. Seminar on The sharp threshold for making squares

Queen Mary University of London, UK, April 29, 2016. Seminar on The sharp threshold for making squares

Oxford University, UK, June 7, 2016. Seminar on The sharp threshold for making squares


SUPPORT

(External)

ACTIVITY AGENCY/SOURCE AMOUNT PERIOD
14th Cumberland ConferenceUS Army Research Office (CO-PI) $5,576 May 2001
Dynamical behavior in percolation models related to phase transitions in the cortex during perceptual information processingNSF (CO-PI) $652,194 Feb 1, 2002 to Jan 31, 2005
Foundations of coverage and connectivity for wireless sensor networks deployed in thin stripsNSF (CO-PI) $350,000 Sep 15, 2007 to Aug 31, 2010
Phase transitions for physical intelligence (DARPA Physical Intelligence Program)DARPA (CO-PI) $384,926 Nov 1, 2011 to Oct 31, 2013
Random Geometric graphsNSF (CO-PI) $330,000 Aug 1, 2013 to Jul 31, 2016
Probabilistic and Extremal CombinatoricsNSF (CO-PI) $405,000 Sep 1, 2016 to Aug 31, 2019
Internal Support
ACTIVITY AGENCY/SOURCE AMOUNT PERIOD
CLION FedEx Institute of Technology approx $205,000 2007-Present

OUTREACH

Project/s summary

PROJECT PARTICIPANTS PERIOD SPONSORSHIP
Siemens Competition for Math, Science and Technology (on math judging panel) High school students 2013-2017 ETS, Discovery Communications, Siemens
Gate Graduate school applicants January 2015, 2017, 2019 Gate
Coordinator, International Mathematics Olympiad High school students 2002, 2019  

SERVICE
UNIVERSITY COMMITTEE/ACTIVITY PERIOD
Memphis, Math Dept. Associate Chair 2013-Present
Memphis, Math Dept. Advisory Committee 2013-Present
Memphis, Math Dept. Scheduler of math courses 2012-Present
Memphis, Math Dept. Web and newsletter committee 2013-Present
Memphis, Math Dept. Web and Department reinvention committee 2012-2013
Memphis, Math Dept. Graduate committee 2000-2009; 2011-2013
Memphis, Math Dept. Departmental Chair Search committee 2011-2012
Memphis, Math Dept. Blaylock colloquium committee 2011-2012
Memphis, Math Dept. Web page committee 2001-2005; 2008
Memphis, Math Dept. Recruiting committee 2005-2007
Memphis, Math Dept. Scheduling committee 2002-2005
Memphis, CAS College of Arts and Sciences Graduate Committee 2003-2005
Memphis, Math Dept. Technology advisory committee 2001-2002
Memphis, Math Dept. Electronic Resources committee 1999-2000
Memphis, Math Dept Library committee 1998-2000
Memphis, Math Dept. PhD Committee: Michael Ackerman, Jozsef Balogh, Luke Pebody, Jonathan Cutler, Alice Hubenko. 2000-2004
Memphis, Math Dept. PhD Committee: Balazs Montagh, Marko Puljic, Robert Morris, Henry Liu, Jeffrey Wheeler (Chair). 2005-2009
Memphis, Math Dept. MS thesis committee: Daniel Boboc, David Bond 2008
Memphis, Math Dept. PhD Committee: Fabricio Benevides, Karen Johannson, Andrew Uzzell, Neal Bushaw, Ago Riet, Dominik Vu. 2010-2014
Memphis, Math Dept. MS Thesis committee: Stephen Smith 2013
Math Community NSF grant awards panelist Various

OTHER
SOCIETY/ORGANIZATION/JOURNAL COMMITTEE/EDITORIAL BOARD/OFFICE PERIOD
Math Department Co-Organizer for departmental seminars in Combinatorics 1999-Current
Combinatorics, Probability and Computing Managing editor 2008-Current

CONSULTING
ORGANIZATION/COMPANY PERIOD
Software Consultants, (cryptography and smartcard design). 1995-2010

Appendix A

Academic Year (please indicate year) Course # Course Name Credit Hours Percent Taught Enroll Labratory Supervised(S)/Instructed(I) New Preparation (Y) /(N)
Spring 2012 Math 1480 Math for Elem School Teachers 3 100 35 Instructed N
Spring 2012 Math 7262 Algebraic Theory II 3 100 7 Instructed N
Fall 2012 Math 7261 Algebraic Theory I 3 100 2 Instructed N
Fall 2012 Math 7361 Complex Analysis 3 100 11 Instructed N
Spring 2013 Math 7262 Algebraic Theory II 3 100 1 Instructed N
Fall 2013 Math7/8021 Random Geometric Graphs 3 100 13 Instructed Y
Spring 2014 Math 4614/6614 Probability and Statistics 3 100 49 Instructed Y
Fall 2014 Math 3221 Elementary Number Theory 3 100 20 Instructed N
Spring 2015 Math 7029/8029 Percolation Theory 3 100 10 Instructed Y
Fall 2015 Math 4261/6261 Abstract Algebra 3 100 8 Instructed Y
Fall 2016 Math 7261 Algebraic Theory I 3 100 5 Instructed N
Spring 2017 Math 7262 Algebraic Theory II 3 100 6 Instructed N
Fall 2017 Math 7261 Algebraic Theory I 3 100 6 Instructed N
Spring 2018 Math 7262 Algebraic Theory II 3 100 6 Instructed N
Fall 2018 Math 7261 Algebraic Theory I 3 100 5 Instructed N
Fall 2018 Math 8812 Ramsey Theory 3 100 5 Instructed Y
Spring 2019 Math 7262 Algebraic Theory II 3 100 5 Instructed N

Appendix B

I was Thesis advisor for Jeffrey Wheeler (PhD student, graduated 2008), who is now a Lecturer in the Department of Mathematics, University of Pittsburgh.
 
I was Thesis advisor for Ali Dogan (PhD student, graduated 2016), who is now an Assistant Professor at the University of Houston, Victoria.
 

Appendix C

Paul Balister, Béla Bollobás, Random Geometric Graphs. Book in preparation.
 
Paul Balister. Branching Processed. Lecture notes (on website).
 
Paul Balister, Béla Bollobás, Oliver Riordan. Essential enhancements revisited. On ArXiv.
 

Appendix D

14th Cumberland Conference  (ARO, May 17–19, 2001). Organizers: P.N. Balister, B. Bollobás, C.C. Rousseau. The 14th Cumberland Conference on Combinatorics, Graph Theory, and Computing was held at the University of Memphis on May 17–19, 2001. I was the main organizer of this conference and contributed to the writing of two grant applications, one to the NSF and one to the US Army Research Office. The US Army Research Office application was successful and provided funding for the conference. 
 

Appendix E

I have given several talks to the Math department Honors student seminar, and also to the Cantor Sect (undergraduate math club). For example, in February 2012 I gave a Cantor Sect talk on 10 trillion digits of pi and in November 2012 I gave an Honors seminar talk on p-adic numbers.
 
I have regularly given talks at the Departmental Combinatorics seminar.
 
Course redesign (Harvard). Redesign of computer based lab sessions for multivariate calculus course.
 
Course redesign (Memphis). Designed and taught first semester of Math 2015 - Mathematics for elementary school teachers II.