We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of " curvature " in discrete spaces. An appealing feature of this discrete version of the so-called Γ 2-calculus (of Bakry-´ Emery) seems to be that it is fairly straightforward to compute this notion of curvature parameter for several specific graphs of… (More)
We formulate and prove inverse mixing lemmas in the settings of simplicial complexes and k-uniform hypergraphs. In the hypergraph setting, we extend results of Bilu and Linial for graphs. In the simplicial complex setting, our results answer a question of Parzanchevski et al.
Along with the emergence and public acceptance of different operating systems and platforms during the past few years, came the need for quick cross-platform development solutions. This need was partially fulfilled by cross-compilers, due to the variety of underlying hardware. Virtual machines (VMs), whose technology was revived by the evolution of hardware… (More)