SKSupanat Kamtue

Supanat Kamtue

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Supanat Kamtue has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A generalized Cheeger inequality and the Steklov Problem on finite graphs

    by Bobo Hua, Supanat Kamtue, Shiping Liu, Florentin Münch, Norbert Peyerimhoff

    We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we get a sharp estimate for the first non-trivial Steklov eigenvalue via Escobar Cheeger constant. At the end, we extend Hassannezhad and Miclo's convergence result to non-reversible Markov chains via a different method based on resolvent convergence, answering one of their questions.

  • Open Access

    Bakry-Émery and Ollivier Ricci Curvature of Cayley Graphs

    by David Cushing, Supanat Kamtue, Riikka Kangaslampi, Shiping Liu, Florentin Münch, Norbert Peyerimhoff

    In this article we study two discrete curvature notions, Bakry-Émery curvature and Ollivier Ricci curvature, on Cayley graphs. We introduce Right Angled Artin-Coxeter Hybrids (RAACHs) generalizing Right Angled Artin and Coxeter groups (RAAGs and RACGs) and derive the curvatures of Cayley graphs of certain RAACHs. Moreover, we show for general finitely presented groups $\Gamma = \langle S \, \mid\, R \rangle$ that addition of relators does not lead to a decrease in the weighted curvatures of their Cayley graphs with adapted weighting schemes.

  • Open Access

    Bakry-Émery curvature sharpness and curvature flow in finite weighted graphs: theory

    by David Cushing, Supanat Kamtue, Shiping Liu, Florentin Münch, Norbert Peyerimhoff, Ben Snodgrass

    In this sequence of two papers, we introduce a curvature flow on (mixed) weighted graphs which is based on the Bakry-Émery calculus. The flow is described via a time-continuous evolution through the weighting schemes. By adapting this flow to preserve the Markovian property, its limits turn out to be curvature sharp. Our aim is to present the flow in the most general case of not necessarily reversible random walks allowing laziness, including vanishing transition probabilities along some edges (“degenerate” edges). This approach requires to extend all concepts (in particular, the Bakry-Émery curvature related notions) to this general case and it leads to a distinction between the underlying topology (a mixed combinatorial graph) and the weighting scheme (given by transition rates). We present various results about curvature sharp vertices and weighted graphs as well as some fundamental properties of this new curvature flow. This paper is accompanied by another paper discussing the curvature flow implementation in Python for practical use, where we present various examples and exhibit further properties of the flow, like stability properties of curvature flow equilibria.