Showing 2007 · cond-mat.stat-mechShow all

15 papers · 2 filters

cond-mat.stat-mech2007★ 19 cited

Evolution equation for a model of surface relaxation in complex networks

C. E. La Rocca, L. A. Braunstein, P. A. Macri

In this paper we derive analytically the evolution equation of the interface for a model of surface growth with relaxation to the minimum (SRM) in complex networks. We were inspire…

cond-mat.stat-mech2007★ 18 cited

Transition from small to large world in growing networks

S. N. Dorogovtsev, P. L. Krapivsky, J. F. F. Mendes

We examine the global organization of growing networks in which a new vertex is attached to already existing ones with a probability depending on their age. We find that the networ…

cond-mat.stat-mech2007★ 20 cited

Discrete surface growth process as a synchronization mechanism for scale free complex networks

A. L. Pastore y Piontti, P. A. Macri, L. A. Braunstein

We consider the discrete surface growth process with relaxation to the minimum [F. Family, J. Phys. A {\bf 19} L441, (1986).] as a possible synchronization mechanism on scale-free…

cond-mat.stat-mech2007★ 10 cited

Unzipping Vortices in Type-II Superconductors

Yariv Kafri, David R. Nelson, Anatoli Polkovnikov

The unzipping of vortex lines using magnetic-force microscopy from extended defects is studied theoretically. We study both the unzipping isolated vortex from common defects, such…

cond-mat.stat-mech2007★ 15 cited

Renormalization flow for unrooted forests on a triangular lattice

Sergio Caracciolo, Claudia De Grandi, Andrea Sportiello

We compute in small temperature expansion the two-loop renormalization constants and the three-loop coefficient of the beta-function, that is the first non-universal term, for the…

cond-mat.stat-mech2007★ 99 cited

Homogeneous and heterogeneous nucleation of Lennard-Jones liquids

Hui Wang, Harvey Gould, W. Klein

The homogeneous and heterogeneous nucleation of a Lennard-Jones liquid is investigated using the umbrella sampling method. The free energy cost of forming a nucleating droplet is d…

cond-mat.stat-mech2007★ 258 cited

Breakdown of the adiabatic limit in low dimensional gapless systems

Anatoli Polkovnikov, Vladimir Gritsev

It is generally believed that a generic system can be reversibly transformed from one state into another by sufficiently slow change of parameters. A standard argument favoring thi…

cond-mat.stat-mech2007★ 22 cited

Molecular Spiders in One Dimension

Tibor Antal, P. L. Krapivsky, Kirone Mallick

Molecular spiders are synthetic bio-molecular systems which have "legs" made of short single-stranded segments of DNA. Spiders move on a surface covered with single-stranded DNA se…

cond-mat.stat-mech2007★ 36 cited

Molecular Spiders with Memory

Tibor Antal, P. L. Krapivsky

Synthetic bio-molecular spiders with "legs" made of single-stranded segments of DNA can move on a surface which is also covered by single-stranded segments of DNA complementary to…

cond-mat.stat-mech2007★ 60 cited

The power of choice in network growth

Raissa M. D'Souza, Paul L. Krapivsky, Cristopher Moore

The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growt…

cond-mat.stat-mech2007★ 3 cited

Dynamics of single polymers under extreme confinement

Armin Rahmani, Claudio Castelnovo, Jeremy Schmit +1

We study the dynamics of a single chain polymer confined to a two dimensional cell. We introduce a kinetically constrained lattice gas model that preserves the connectivity of the…

cond-mat.stat-mech2007★ 4 cited

Approaching equilibrium and the distribution of clusters

Hui Wang, Kipton Barros, Harvey Gould +1

We investigate the approach to stable and metastable equilibrium in Ising models using a cluster representation. The distribution of nucleation times is determined using the Metrop…

cond-mat.stat-mech2007★ 37 cited

Addition-Deletion Networks

E. Ben-Naim, P. L. Krapivsky

We study structural properties of growing networks where both addition and deletion of nodes are possible. Our model network evolves via two independent processes. With rate r, a n…

cond-mat.stat-mech2007★ 10 cited

Graph Partitioning Induced Phase Transitions

Gerald Paul, Reuven Cohen, Sameet Sreenivasan +2

We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree . Optimal graph partitioning is directly related to optimal attack a…

cond-mat.stat-mech2007★ 26 cited

Transport and Percolation Theory in Weighted Networks

Guanliang Li, Lidia A. Braunstein, Sergey V. Buldyrev +2

We study the distribution of the equivalent conductance for Erdős-Rényi (ER) and scale-free (SF) weighted resistor networks with nodes. Each link has conductance $g\…