Paul Balister & Santosh Kumar

http://www.msci.memphis.edu/~pbalistr/

Publications

1. P.N. Balister, B. Bollobás, A.M. 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.
2. P.N. Balister, B. Bollobás, A.M. Stacey. Improved upper bounds for the critical probability of oriented percolation in two dimensions, Random Structures & Algorithms 5 (1994), no. 4, 573-589.
3. P.N. Balister, S. Howson. Note on Nakayama's lemma for compact L-Modules, Asian J. Math. 1 (1997), no. 2, 224-229.
4. P.N. Balister, Characteristic distributions for non-torsion L-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. P.N. Balister, B. Bollobás, A.M. Stacey. Counting boundary paths for oriented percolation clusters, Random Structures & Algorithms 14 (1999), no. 1, 1-28.
6. P.N. Balister, B. Bollobás, A.M. Stacey. Dependent percolation in two dimensions, Probability Theory and Related Fields 117 (2000), no.4, 495-513.
7. P.N. Balister, B. Bollobás, O.M. Riordan, A.D. Scott. Alternating knot diagrams, Euler circuits and the interlace polynomial, European Journal of Combinatorics 22 (2001), no. 1, 1-4.
8. P.N. Balister. On the Alspach conjecture, Combinatorics, Probability and Computing 10 (2001), no. 2, 95-125.
9. P.N. Balister. Packing Circuits into K_n, Combinatorics, Probability and Computing 10 (2001), no. 6, 463-499.
10. P.N. Balister. Vertex-distinguishing edge colorings of random graphs, Random Structures & Algorithms 20 (2002), no. 1, 89-97.
11. P.N. Balister, R.H. Schelp, M. Simonovits. A note on Ramsey size-linear graphs, Journal of Graph Theory 39 (2002), no. 1, 1-5.
12. P.N. Balister, B. Bollobás, R.H. Schelp. Vertex-distinguishing colorings of graphs with Δ(G)=2, Discrete Mathematics252 (2002), 17-29.
13. P.N. Balister, B. Bollobás, J. Cutler, L. Pebody. The Interlace Polynomial of Graphs at -1, European Journal of Combinatorics 23 (2002), no. 7, 761-767.
14. P.N. Balister, Y. Caro, C. Rousseau, R. Yuster. Zero-Sum square matrices, European Journal of Combinatorics 23 (2002), no. 5, 489-497.
15. P.N. Balister, B. Bollobás, A. Quas. Entropy along convex shapes, random tilings and shifts of finite type, Illinois Journal of Math. 46 (2002), no. 3, 781-795.
16. P.N. Balister, O.M. Riordan, R.H. Schelp. Vertex-Distinguishing edge colorings of graphs, Journal of Graph Theory 42(2003), no. 2, 95-109.
17. P.N. Balister, B. Bollobás, O.M. Riordan, R.H. 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.
18. P.N. Balister. Packing digraphs with directed closed trails, Combinatorics, Probability and Computing 12 (2003), 1-15.
19. P.N. Balister. Packing closed trails into dense graphs, Journal of Combin. Theory B 88 (2003), no. 2, 107-118.
20. P.N. Balister, A. Kostochka, Hao Li, R.H. Schelp. Balanced Edge Colorings, Journal of Combin. Theory B 90 (2004) 3-20.
21. P.N. Balister, E. Györi, J. Lehel, R.H. Schelp. Longest paths in circular arc graphs, Combinatorics, Probability and Computing 13 (2004), 311-317.
22. P.N. Balister, B. Bollobás, M.J. Walters. Continuum percolation with steps in an annulus, Annals of Applied Probability 14 (2004), 1869-1879.
23. P.N. Balister, B. Bollobás, A. Quas. Percolation in a Voronoi Process, Random Structures & Algorithms 26 (2005) 310-318.
24. P.N. Balister, B. Bollobás, A. Sarkar, M.J. Walters. Connectivity of random k-nearest neighbour graphs, Advances in Applied Probability 37 (2005), 1-24.
25. P.N. Balister, B. Bollobás, M.J. Walters. Continuum Percolation in the square and the disk, Random Structures & Algorithms 26 (2005) 392-403.
26. R. Kozma, M. Puljic, P. Balister, B. Bollobas, W.J. Freeman. Phase Transitions in the Neuropercolation Model of Neural Populations with Mixed Local and Non-Local Interactions, Biological Cybernetics 92 (2005) 367-379.
27. P.N. Balister, J. Lehel, R.H. Schelp. Ramsey Unsaturated and Saturated Graphs, Journal of Graph Theory 51 (2006), 22-32.
28. P.N. Balister, A. Gyárfás, J. Lehel, R.H. Schelp. Mono-multi bipartite Ramsey numbers, designs, and matrices, Journal of Combinatorial Theory A 113 (2006), 101-112.
29. P.N. Balister, B. Bollobás. Pair dominating graphs, European Journal of Combinatorics 27 (2006), 322-328.
30. P.N. Balister, B. Bollobás, R. Kozma, Large deviations for mean field models of probabilistic cellular automata,Random Structures & Algorithms 29 (2006), 399-415.
31. P.N. Balister, E. Györi, J. Lehel, R.H. Schelp. Adjacent vertex distinguishing edge-colorings, SIAM J. Discrete Math.21 (2007), no. 1, 237-250.
32. P.N. Balister, B. Bollobás. Counting Regions With Bounded Surface Area, Communication in Mathematical Physics 273(2007), no. 2, 305-315.
33. P.N. Balister, B. Bollobás, S. Gerke. The generalized Randic index of trees, Journal of Graph Theory 56 (2007), 270-286.
34. P.N. Balister, B. Bollobás, S. Kumar, A. Sarkar, Reliable Density Estimates for Coverage and Connectivity in Thin Strips of Finite Length, ACM MobiCom 2007.
35. P.N. Balister, B. Bollobás, S. Gerke. Connectivity of addable graph classes, J. Combin. Theory Ser. B 98 (2008), 577-584.
36. P.N. Balister, B. Bollobas, S. Gerke. Sequences with changing dependencies, SIAM J. of Discrete Math. 22 (2008), 1149-1154.
37. P.N. Balister, E. Györi, J. Lehel, R.H. Schelp. Connected graphs without long paths, Discrete Math. 308 (2008), 4487-4494.
38. P.N. Balister, B. Bollobás, A. Sarkar, M.J. Walters. Highly Connected Random Geometric Graphs, Discrete Appl. Math.157 (2009), 309-320.
39. P.N. Balister, S. Gerke, G. Gutin. Convex sets in acyclic digraphs, Order 26 (2009), 95--100.
40. P.N. Balister, B. Bollobás, A. Sarkar, M.J. Walters. A critical constant for the k-nearest neighbour model, Adv. Appl. Prob. (SGSA) 41 (2009) 1-12.
41. P.N. Balister, B. Bollobás, A. Sarkar, M.J. Walters. Connectivity of a gaussian network, Int. J. Ad Hoc and Ubiquitous Computing. To appear.
42. P.N. Balister, J.P. Wheeler. The Erdös-Heilbronn conjecture for finite groups. To appear.
43. P.N. Balister, B. Bollobás, Critical probabilities of 1-dependent percolation models. Submitted.
44. P.N. Balister, B. Bollobás, Interference Percolation. Submitted.
45. P.N. Balister, S. Kalikow, A. Sarkar. The Linus sequence, To appear in Combinatorics, Probability and Computing.
46. P.N. Balister, B. Bollobás, R. Johnson, M.J. Walters, Random Majority Percolation, To appear in Random Structures & Algorithms.
47. P.N. Balister, B. Bollobás, M.J. Walters, Random Transceiver Networks To appear in Journal of Applied Probability.
48. P.N. Balister, B. Bollobás, Projections, Entropy and Sumsets To appear in Combinatorica.
49. P.N. Balister, S. Gerke, G. Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah, A. Yeo, Algorithms for Generating Convex Sets in Acyclic Digraphs. To appear.
50. P.N. Balister, B. Bollobás, A. Sarkar, M.J. Walters, Sentry selection in wireless networks. Submitted.
51. P.N. Balister, B. Bollobás, Percolation in the k-nearest neighbor graph. Submitted.
52. P.N. Balister, Z. Zheng, S. Kumar, P. Sinha, Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks. INFOCOM 2009.
53. P.N. Balister, S. Kumar, Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors. INFOCOM 2009 Mini-conference.
54. P.N. Balister, Branching Processes Lecture Note Series, IMS, NUS.
55. P.N. Balister, B. Bollobás, Bond percolation with attenuation in high dimensional Voronoi tilings To appear in Random Structures & Algorithms.