#### Filter Results:

#### Publication Year

2012

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- T. A. Kesselring, G. Franzese, S. V. Buldyrev, H. J. Herrmann, H. E. Stanley
- Scientific reports
- 2012

One hypothesized explanation for water's anomalies imagines the existence of a liquid-liquid (LL) phase transition line separating two liquid phases and terminating at a LL critical point. We simulate the classic ST2 model of water for times up to 1000 ns and system size up to N = 729. We find that for state points near the LL transition line, the entire… (More)

- Christian M Schneider, Tobias A Kesselring, José S Andrade, Hans J Herrmann
- Physical review. E, Statistical, nonlinear, and…
- 2012

The self-similarity of complex networks is typically investigated through computational algorithms, the primary task of which is to cover the structure with a minimal number of boxes. Here we introduce a box-covering algorithm that outperforms previous ones in most cases. For the two benchmark cases tested, namely, the E. coli and the World Wide Web (WWW)… (More)

- T A Kesselring, E Lascaris, G Franzese, S V Buldyrev, H J Herrmann, H E Stanley
- The Journal of chemical physics
- 2013

The liquid-liquid critical point scenario of water hypothesizes the existence of two metastable liquid phases--low-density liquid (LDL) and high-density liquid (HDL)--deep within the supercooled region. The hypothesis originates from computer simulations of the ST2 water model, but the stability of the LDL phase with respect to the crystal is still being… (More)

We simulate the ST2 water model for time periods up to 1000 ns, and for four different system sizes, N = 6 3 , 7 3 , 8 3 , and 9 3. We locate the liquid-liquid phase transition line and its critical point in the supercooled region. Near the liquid-liquid phase transition line, we observe that the system continuously flips between the low-density and… (More)

The self-similarity of complex networks is typically investigated through computational algorithms the primary task of which is to cover the structure with a minimal number of boxes. Here we introduce a box-covering algorithm that not only outperforms previous ones, but also finds optimal solutions. For the two benchmark cases tested, namely, the E. Coli… (More)

- ‹
- 1
- ›