Combinatorial models of rigidity and renormalization

DOI10.1007/S10955-011-0394-5MaRDI QIDQ664590zbMATH OpenOpenAlexFDO

Authors Julien Barré

Publication date 2 March 2012

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1109.0719

zbMATH Keywords

graph theoryhierarchical latticesrigidity percolation

Mathematics Subject Classification ID

Phase transitions (general) in equilibrium statistical mechanics (82B26) Renormalization group methods in equilibrium statistical mechanics (82B28) Percolation (82B43)

Abstract: We first introduce the percolation problems associated with the graph theoretical concepts of $(k,l)$-sparsity, and make contact with the physical concepts of ordinary and rigidity percolation. We then devise a renormalization transformation for $(k,l)$-percolation problems, and investigate its domain of validity. In particular, we show that it allows an exact solution of $(k,l)$-percolation problems on hierarchical graphs, for $kleql<2k$. We introduce and solve by renormalization such a model, which has the interesting feature of showing both ordinary percolation and rigidity percolation phase transitions, depending on the values of the parameters.

Recommendations

• scientific article; zbMATH DE number 501471
• Renormalization and rigidity
• A combinatorial study of the rigidity of planar structures
• Probabilistic existence of rigid combinatorial structures
• Combinatorial genericity and minimal rigidity
• Applications of combinatorics to statics -- rigidity of grids
• Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
• Rigidity theory for matroids
• Combinatorics of the hyperplane arrangements and integrable models
• Integrable models and combinatorics

Cites work

• An algorithm for two-dimensional rigidity percolation: The pebble game
• An efficient algorithm for testing the generic rigidity of graphs in the plane
• Conditions for Unique Graph Realizations
• Generic rigidity in three-dimensional bond-bending networks
• On graphs and rigidity of plane skeletal structures
• On matroidal families
• On the rigidity of molecular graphs
• Pebble game algorithms and sparse graphs

Cited in

(3)

• Hierarchical renormalization-group study on the planar bond-percolation problem
• Renormalization-group theory of the abnormal singularities at the critical-order transition in bond percolation on pointed hierarchical graphs
• On the dynamics of the combinatorial model of the real line

This page was built for publication: Combinatorial models of rigidity and renormalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664590)