Are there any studies or reports about the analysis of cyclic structures?

I am studying the traditional gc algorithm - reference counting(RC). A major weakness for RC is the inability to reclaim cyclic garbage. Many studies proposed their cyclic reference counting algorithms to deal with this problem in different efficient manners. 

However, I can not find any studies or reports on the analysis of cyclic structures. I mean, in real programs execution (especially for that written in Object-Oriented language), what is the likely proportion of cyclic garbage? What is the average size of cyclic structures? ...


tomylin