Harmonic labeling of graphs

@article{Benjamini2013HarmonicLO,
  title={Harmonic labeling of graphs},
  author={Itai Benjamini and Van Cyr and Eviatar B. Procaccia and Ran J. Tessler},
  journal={Discret. Math.},
  year={2013},
  volume={313},
  pages={1726-1745}
}
1 Citations

Figures from this paper

References

SHOWING 1-6 OF 6 REFERENCES
Sums and products along sparse graphs
TLDR
This work considers sum-product theorems for sparse graphs, and shows that this problem has important consequences already when G is a matching, and gives lower and upper bounds for this problem in different settings.
A new proof of Gromov's theorem on groups of polynomial growth
We give a new proof of Gromov’s theorem that any finitely generated group of polynomial growth has a finite index nilpotent subgroup. The proof does not rely on the MontgomeryZippin-Yamabe structure
Disorder, entropy and harmonic functions
We study harmonic functions on random environments with particular emphasis on the case of the infinite cluster of supercritical percolation on $\mathbb{Z}^d$. We prove that the vector space of
Lectures on Differential Geometry
In 1984, the authors gave a series of lectures on differential geometry in the Institute for Advanced Studies in Princeton, USA. These lectures are published in this volume, which describes the major
The surjectivity of the combinatorial Laplacian on infinite graphs
Given a connected locally finite simplicial graph $ G$ with vertex set $V$, the combinatorial Laplacian $\Delta_G \colon \R^V \to \R^V$ is defined on the space of all real-valued functions on $V$. We