Dr. Paul Balister

Professor
Department of Mathematical Sciences
The University of Memphis
Memphis, TN 38152-3240

Office: 345 Dunn Hall
Telephone: (901) 678-3138
Fax: (901) 678-2480
email: pbalistr@memphis.edu

Research interests: Graph theory, Combinatorics.

Picture

This page is no longer being maintained. Go to http://www.msci.memphis.edu/faculty/pbalistr.html for my current webpage.

Course webpages

Spring 2014: MATH 4614/6614 Probability and statistics
Older: MATH 7361 Complex Analysis
  MATH 1480 Math for Elementary School Teachers
  MATH 1830 Elementary Calculus
  MATH 2015 Math for Elementary School Teachers II
  MATH 2701 Discrete Mathematics
  MATH 7261 Algebraic Theory I
  MATH 7262 Algebraic Theory II
  MATH 7281 Linear Algebra for Teachers
  MATH 7350 Real Analysis I
  MATH 7351 Real Analysis II
  MATH 7411 Point set topology

Some Mathematical Java Applets

Bootstrap percolation: simulates 2-neighbor bootstrap percolation on the torus.

Majority percolation: simulates majority percolation on the torus.

Erdős-Rényi: simulates the evolution of the component structure of an Erdős-Rényi random graph.

Mandelbrot set: uses high precision arithmetic to zoom in and explore the Mandelbrot set.

Logistic map: explores iterates of the logistic map and the corresponding bifurcation map.


Publications

  1. 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), 201-220.
  2. 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), 573-589.
  3. Paul Balister, Susan Howson. Note on Nakayama's lemma for compact Λ-Modules, Asian J. Math. 1 (1997), 224-229.
  4. 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).
  5. Paul Balister, Béla Bollobás, Alan Stacey. Counting boundary paths for oriented percolation clusters, Random Structures & Algorithms 14 (1999), 1-28.
  6. Paul Balister, Béla Bollobás, Alan Stacey. Dependent percolation in two dimensions, Probability Theory and Related Fields 117 (2000), 495-513.
  7. 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), 1-4.
  8. Paul Balister. On the Alspach conjecture, Combinatorics, Probability and Computing 10 (2001), 95-125.
  9. Paul Balister. Packing Circuits into Kn, Combinatorics, Probability and Computing 10 (2001), 463-499.
  10. 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.
  11. Paul Balister. Vertex-distinguishing edge colorings of random graphs, Random Structures & Algorithms 20 (2002), 89-97.
  12. Paul Balister, Richard Schelp, Miklos Simonovits. A note on Ramsey size-linear graphs, Journal of Graph Theory 39 (2002), 1-5.
  13. Paul Balister, Béla Bollobás, Richard Schelp. Vertex-distinguishing colorings of graphs with Δ(G)=2, Discrete Mathematics 252 (2002), 17-29.
  14. Paul Balister, Béla Bollobás, Jonathan Cutler, Luke Pebody. The Interlace Polynomial of Graphs at -1, European Journal of Combinatorics 23 (2002), 761-767.
  15. Paul Balister, Yair Caro, Cecil Rousseau, Raphael Yuster. Zero-Sum square matrices, European Journal of Combinatorics 23 (2002), no. 5, 489-497.
  16. 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.
  17. Robert Kozma, Paul Balister, 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-2265.
  18. Paul Balister, Oliver Riordan, Richard Schelp. Vertex-Distinguishing edge colorings of graphs, Journal of Graph Theory 42 (2003), 95-109.
  19. 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), 366-373.
  20. Paul Balister. Packing digraphs with directed closed trails, Combinatorics, Probability and Computing 12 (2003), 1-15.
  21. Paul Balister. Packing closed trails into dense graphs, Journal of Combin. Theory B 88 (2003), 107-118.
  22. Paul Balister, Alexandr Kostochka, Hao Li, Richard Schelp. Balanced Edge Colorings, Journal of Combin. Theory B 90 (2004), 3-20.
  23. Paul Balister, Ervin Györi, Jenö Lehel, Richard Schelp. Longest paths in circular arc graphs, Combinatorics, Probability and Computing 13 (2004), 311-317.
  24. Paul Balister, Béla Bollobás, Mark Walters. Continuum percolation with steps in an annulus, Annals of Applied Probability 14 (2004), 1869-1879.
  25. 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, pp. 435-443.
  26. Paul Balister, Béla Bollobás, Anthony Quas. Percolation in a Voronoi Process, Random Structures & Algorithms 26 (2005), 310-318.
  27. Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. Connectivity of random k-nearest neighbour graphs, Advances in Applied Probability 37 (2005), 1-24.
  28. Paul Balister, Béla Bollobás, Mark Walters. Continuum Percolation in the square and the disk, Random Structures & Algorithms 26 (2005), 392-403.
  29. Robert Kozma, Marko Puljic, Paul Balister, BBé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), 367-379.
  30. Paul Balister, Jenö Lehel, Richard Schelp. Ramsey Unsaturated and Saturated Graphs, Journal of Graph Theory 51 (2006), 22-32.
  31. Paul Balister, András Gyárfás, Jenö Lehel, Richard Schelp. Mono-multi bipartite Ramsey numbers, designs, and matrices, Journal of Combin. Theory A 113 (2006), 101-112.
  32. Paul Balister, Béla Bollobás. Pair dominating graphs, European Journal of Combinatorics 27 (2006), 322-328.
  33. Paul Balister, Béla Bollobás, Robert Kozma, Large deviations for mean field models of probabilistic cellular automata, Random Structures & Algorithms 29 (2006), 399-415.
  34. Paul Balister, Ervin Györi, Jenö Lehel, Richard Schelp. Adjacent vertex distinguishing edge-colorings, SIAM Journal of Discrete Math. 21 (2007), 237-250.
  35. Paul Balister, Béla Bollobás. Counting Regions With Bounded Surface Area, Communication in Mathematical Physics 273 (2007), 305-315.
  36. Paul Balister, Béla Bollobás, Stefanie Gerke. The generalized Randic index of trees, Journal of Graph Theory 56 (2007), 270-286.
  37. Paul Balister, Béla Bollobás, Santosh Kumar, Amites Sarkar. Reliable Density Estimates for Coverage and Connectivity in Thin Strips of Finite Length, ACM MobiCom 2007, 75-86.
  38. Paul Balister, Béla Bollobás, Stefanie Gerke. Connectivity of addable graph classes, Journal of Combin. Theory B 98 (2008), 577-584.
  39. Paul Balister, Béla Bollobás, Stefanie Gerke. Sequences with changing dependencies, SIAM Journal of Discrete Math. 22 (2008), 1149-1154.
  40. Paul Balister, Ervin Györi, Jenö Lehel, Richard Schelp. Connected graphs without long paths, Discrete Math. 308 (2008), 4487-4494.
  41. 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), 204-213.
  42. Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. Highly Connected Random Geometric Graphs, Discrete Appl. Math. 157 (2009), 309-320.
  43. Paul Balister, Stefanie Gerke, Gregory Gutin. Convex sets in acyclic digraphs, Order 26 (2009), 95--100.
  44. 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), 1-12.
  45. Paul Balister, Béla Bollobás, Mark Walters. Random Transceiver Networks, Advances in Applied Probability 41 (2009), 323-343.
  46. Paul Balister, Jeffrey Wheeler. The Erdös-Heilbronn conjecture for finite groups, Acta Arithmetica 140 (2009), 105-118.
  47. 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), 509-518.
  48. 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ós.
  49. Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun Sinha. Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks, INFOCOM 2009, 136-144.
  50. Paul Balister, Santosh Kumar. Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors, INFOCOM 2009, 2896-2900.
  51. Paul Balister, Steven Kalikow, Amites Sarkar. The Linus sequence, Combinatorics, Probability and Computing 19 (2010), 21-46.
  52. Paul Balister, Béla Bollobás. Bond percolation with attenuation in high dimensional Voronoi tilings, Random Structures & Algorithms 36 (2010), 5-10.
  53. Paul Balister, Béla Bollobás, Robert Johnson, Mark Walters. Random Majority Percolation, Random Structures & Algorithms 36 (2010), 315-340.
  54. Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters. Sentry selection in wireless networks, Advances in Applied Probability 42 (2010), 1-25.
  55. 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.
  56. 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), 533-537.
  57. Paul Balister, Balázs Patkós. Random partial orders defined by angular domains, Order 28 (2011), 341-355.
  58. 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.
  59. Paul Balister, Béla Bollobás. Critical probabilities of 1-independent percolation models. Combin. Probab. Comput. 21 (2012), 1122.
  60. Paul Balister, Béla Bollobás. Projections, Entropy and Sumsets Combinatorica 32 (2012), 125141.
  61. Paul Balister, Randall McCutcheon. A concentration function estimate and intersective sets from matrices. Israel J. Math. 189 (2012), 413436.
  62. Paul Balister, Béla Bollobás, Interference Percolation. To appear in RSA.
  63. Paul Balister, Béla Bollobás, Percolation in the k-nearest neighbor graph. Submitted.
  64. Paul Balister, Branching Processes Lecture Note Series, IMS, NUS.

Valid HTML 4.01!