Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups

DOI10.1007/S10801-024-01302-5MaRDI QIDQ6491168

Unnamed Author, Maksim Vaskouski

Publication date: 24 April 2024

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Geometric group theory (20F65) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective graph resistance
• Spectra of Cayley graphs of complex reflection groups
• Reflection groups in analysis and applications
• Isoperimetricity for groups and manifolds
• The electrical resistance of a graph captures its commute and cover times
• Painlevé equations and complex reflections.
• Resistance distances in Cayley graphs on symmetric groups
• A resistance bound via an isoperimetric inequality
• Formula for the reflection length of elements in the group \(G(m,p,n)\).
• The diameter of long-range percolation clusters on finite cycles
• Probability on Trees and Networks
• Hitting and commute times in large graphs are often misleading
• Group Coding With Complex Isometries
• On the bisection width of the transposition network
• Every monotone graph property has a sharp threshold
• Percolation on Finite Cayley Graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Finite Unitary Reflection Groups
• Metric and ultrametric spaces of resistances

This page was built for publication: Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups