Survival Analysis of Re-resection Versus Radiofrequency Ablation for Intrahepatic Recurrence After Hepatectomy for Hepatocellular Carcinoma

Ó The Author(s) 2011. This article is published with open access at Springerlink.com Background Tumor recurrence after resection of hepatocellular carcinoma is a common phenomenon. Re-resection and radiofrequency ablation (RFA) are good options for treating recurrent HCC. This study compared the efficacy of these two modalities in the treatment of intrahepatic HCC recurrence after hepatectomy. Methods From January 2001 to December 2008, a total of 179 patients developed intrahepatic HCC recurrence after hepatectomy. To treat the recurrence, 29 patients underwent re-resection and 45 patients had RFA. Patient characteristics, clinicopathologic data, and survival outcomes were reviewed. Results Child-Pugh status, time to develop first recurrence (12.2 vs. 8.7 months), and recurrent tumor size (2.1 vs. 2.1 cm) were comparable for the two groups. Time to develop a second intrahepatic recurrence after re-resection and RFA was 5.9 and 4.0 months respectively. The 1-, 3-, and 5-year disease-free survival rates were 41.4%, 24.2%, and 24.2 % after re-resection and 32.2%, 12.4%, and 9.3% after RFA (p = 0.14). The 1-, 3-, and 5-year overall survival rates were 89.7%, 56.5%, and 35.2 % after re-resection and 83.7%, 43.1%, and 29.1 % after RFA (p = 0.48). For the second recurrence, 33.3 % of patients underwent a second round of RFA and 10.0 % underwent a third resection

Diameters in preferential attachment models

In this paper, we investigate the diameter in preferential attachment (PA-) models, thus quantifying the statement that these models are small worlds. The models studied here are such that edges are attached to older vertices proportional to the degree plus a constant, i.e., we consider affine PA-models. There is a substantial amount of literature proving that, quite generally, PA-graphs possess power-law degree sequences with a power-law exponent \tau>2. We prove that the diameter of the PA-model is bounded above by a constant times \log{t}, where t is the size of the graph. When the power-law exponent \tau exceeds 3, then we prove that \log{t} is the right order, by proving a lower bound of this order, both for the diameter as well as for the typical distance. This shows that, for \tau>3, distances are of the order \log{t}. For \tau\in (2,3), we improve the upper bound to a constant times \log\log{t}, and prove a lower bound of the same order for the diameter. Unfortunately, this proof does not extend to typical distances. These results do show that the diameter is of order \log\log{t}. These bounds partially prove predictions by physicists that the typical distance in PA-graphs are similar to the ones in other scale-free random graphs, such as the configuration model and various inhomogeneous random graph models, where typical distances have been shown to be of order \log\log{t} when \tau\in (2,3), and of order \log{t} when \tau>3

Analysis of a large-scale weighted network of one-to-one human communication

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbors any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modeling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.Comment: 25 pages, 17 figures, 2 table