Supanat Kamtue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Supanat Kamtue has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Norbert Peyerimhoff
Department of Mathematical Sciences Mathematical Sciences and Computer Science Building Durham University Upper Mountjoy Campus Stockton Road
3 shared publications - Shiping Liu
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
3 shared publications - David Cushing
The University of Manchester
2 shared publications - Florentin Münch
Faculty of Mathematics and Computer Science, Leipzig University, Leipzig, Germany
2 shared publications - Ben Snodgrass
Department of Mathematical Sciences, Durham University, Durham, Great Britain
1 shared publication - Bobo Hua
School of Mathematical Sciences, LMNS, Fudan University, Shanghai, China
1 shared publication
Latest Publications
- Open Access
A generalized Cheeger inequality and the Steklov Problem on finite graphs
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 AccessA generalized Cheeger inequality and the Steklov Problem on finite graphs
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
- 4 July 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (3) , P3.21
Bakry-Émery and Ollivier Ricci Curvature of Cayley Graphs
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.- 4 July 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (3) , P3.21
Open AccessBakry-Émery and Ollivier Ricci Curvature of Cayley Graphs
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
- 24 January 2025
- Published by Springer Nature in manuscripta mathematica
- Vol. 176 (1) , 1-53
Bakry-Émery curvature sharpness and curvature flow in finite weighted graphs: theory
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.
- 24 January 2025
- Published by Springer Nature in manuscripta mathematica
- Vol. 176 (1) , 1-53
Open AccessBakry-Émery curvature sharpness and curvature flow in finite weighted graphs: theory
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.