#### Filter Results:

#### Publication Year

1994

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Paul N. Balister, Béla Bollobás, Mark Walters
- Random Struct. Algorithms
- 2005

In 1961 Gilbert defined a model of continuum percolation in which points are placed in the plane according to a Poisson process of density one, and two are joined if one lies within a disc of area A about the other. We prove some good bounds on the critical area A c for percolation in this model. The proof is in two parts: first we give a rigorous reduction… (More)

Let P be a Poisson process of intensity one in a square S n of area n. We construct a random geometric graph G n,k by joining each point of P to its k = k(n) nearest neighbours. Recently, Xue and Kumar proved that if k ≤ 0.074 log n then the probability that G n,k is connected tends to zero as n → ∞, while if k ≥ 5.1774 log n then the probability that G n,k… (More)

- Paul N. Balister, Béla Bollobás, Stefanie Gerke
- J. Comb. Theory, Ser. B
- 2008

A non-empty class A of labelled graphs is weakly addable if for each graph G ∈ A and any two distinct components of G, any graph that can be obtain by adding an edge between the two components is also in A. For a weakly addable graph class A, we consider a random element R n chosen uniformly from the set of all graph in A on the vertex set {1,. .. , n}.… (More)

- Robert Kozma, Marko Puljic, Paul N. Balister, Béla Bollobás, Walter J. Freeman
- Biological Cybernetics
- 2005

We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phase transitions modeled by percolation theory of random graphs, motivated by properties of neurons and neural populations. The generalization includes (1) a noisy component in the… (More)

- Paul N. Balister
- Combinatorics, Probability & Computing
- 2003

It has been shown [Balister, 2001] that if n is odd and m 1 ,. .. , mt are integers with m i ≥ 3 and t i=1 m i = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m 1 ,. .. , mt. This result was later generalized [Balister, to appear] to all sufficiently dense Eulerian graphs G in place of Kn. In this article we… (More)

Let P be a Poisson process of intensity one in a square S n of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geometric graph G n,k. We prove that there exists a critical constant c crit such that for c < c crit , G n,⌊c log n⌋ is disconnected with probability tending to 1 as n → ∞, and for c… (More)

- Paul N. Balister, Jenö Lehel, Richard H. Schelp
- Journal of Graph Theory
- 2006

A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. We present some conjectures and results concerning both Ramsey saturated and unsaturated graphs. In particular, we show that cycles C n and paths P n on n vertices are Ramsey unsaturated for all n ≥ 5. the minimum… (More)

- Paul N. Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar
- MobiCom
- 2007

Deriving the critical density (which is equivalent to deriving the critical radius or power) to achieve coverage and/or connectivity for random deployments is a fundamental problem in the area of wireless networks. The probabilistic conditions normally derived, however, have limited appeal among practitioners because they areoften asymptotic, i.e., they… (More)

- Paul N. Balister, Zizhan Zheng, Santosh Kumar, Prasun Sinha
- INFOCOM
- 2009

—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype systems have been deployed and hence the issue of scale has not become critical. Real-life deployments, however, will be at large scale and achieving this scale will become… (More)

- Paul N. Balister, O. M. Riordan, Richard H. Schelp
- Journal of Graph Theory
- 2003

We consider lower bounds on the the vertex-distinguishing edge chromatic number of graphs and prove that these are compatible with a conjecture of Burris and Schelp [8]. We also find upper bounds on this number for certain regular graphs G of low degree and hence verify the conjecture for a reasonably large class of such graphs.