Spectral radius of finite and infinite planar graphs and of graphs of bounded genus

It is well known that the spectral radius of a tree whose maximum degree is $D$ cannot exceed $2\sqrt{D-1}$. In this paper we derive similar bounds for arbitrary planar graphs and for graphs of bounded genus. It is proved that a the spectral radius $\rho(G)$ of a planar graph $G$ of maximum vertex degree $D\ge 4$ satisfies $\sqrt{D}\le \rho(G)\le \sqrt{8D-16}+7.75$. This result is best possible up to the additive constant--we construct an (infinite) planar graph of maximum degree $D$, whose spectral radius is $\sqrt{8D-16}$. This generalizes and improves several previous results and solves an open problem proposed by Tom Hayes. Similar bounds are derived for graphs of bounded genus. For every $k$, these bounds can be improved by excluding $K_{2,k}$ as a subgraph. In particular, the upper bound is strengthened for 5-connected graphs. All our results hold for finite as well as for infinite graphs. At the end we enhance the graph decomposition method introduced in the first part of the paper and apply it to tessellations of the hyperbolic plane. We derive bounds on the spectral radius that are close to the true value, and even in the simplest case of regular tessellations of type $\{p,q\}$ we derive an essential improvement over known results, obtaining exact estimates in the first order term and non-trivial estimates for the second order asymptotics

Random tessellations associated with max-stable random fields

36 pagesWith any max-stable random process $\eta$ on $\mathcal{X}=\mathbb{Z}^d$ or $\mathbb{R}^d$, we associate a random tessellation of the parameter space $\mathcal{X}$. The construction relies on the Poisson point process representation of the max-stable process $\eta$ which is seen as the pointwise maximum of a random collection of functions $\Phi=\{\phi_i, i\geq 1\}$. The tessellation is constructed as follows: two points $x,y\in \mathcal{X}$ are in the same cell if and only if there exists a function $\phi\in\Phi$ that realizes the maximum $\eta$ at both points $x$ and $y$, i.e. $\phi(x)=\eta(x)$ and $\phi(y)=\eta(y)$. We characterize the distribution of cells in terms of coverage and inclusion probabilities. Most interesting is the stationary case where the asymptotic properties of the cells are strongly related to the ergodic properties of the non-singular flow generating the max-stable process. For example, we show that: i) the cells are bounded almost surely if and only if $\eta$ is generated by a dissipative flow; ii) the cells have positive asymptotic density almost surely if and only if $\eta$ is generated by a positive flow

Asymptotic statistics of the n-sided planar Voronoi cell: II. Heuristics

We develop a set of heuristic arguments to explain several results on planar Poisson-Voronoi tessellations that were derived earlier at the cost of considerable mathematical effort. The results concern Voronoi cells having a large number n of sides. The arguments start from an entropy balance applied to the arrangement of n neighbors around a central cell. It is followed by a simplified evaluation of the phase space integral for the probability p_n that an arbitrary cell be n-sided. The limitations of the arguments are indicated. As a new application we calculate the expected number of Gabriel (or full) neighbors of an n-sided cell in the large-n limit.Comment: 22 pages, 10 figure