activity
19942021
most citedResilience of the Internet to random breakdowns

2.4k citations · 7.3k across the 76 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

39 papers · 1 filter

cond-mat.stat-mech2018★ 2 cited

Ordering statistics of 4 random walkers on the line

Brian Helenbrook, Daniel ben-Avraham

We study the ordering statistics of 4 random walkers on the line, obtaining a much improved estimate for the long-time decay exponent of the probability that a particle leads to ti…

cond-mat.stat-mech2011★ 17 cited

Entropy production in nonequilibrium steady states: A different approach and an exactly solvable canonical model

Daniel ben-Avraham, Sven Dorosz, Michel Pleimling

We discuss entropy production in nonequilibrium steady states by focusing on paths obtained by sampling at regular (small) intervals, instead of sampling on each change of the syst…

cond-mat.stat-mech2011★ 11 cited

Exact solution of the Nonconsensus Opinion Model on the line

Daniel ben-Avraham

The nonconcensus opinion model (NCO) introduced recently by Shao et al., [Phys. Rev. Lett.103, 018701 (2009)] is solved exactly on the line. Although, as expected, the model exhibi…

cond-mat.stat-mech2010★ 9 cited

Realm of Validity of the Crooks Relation

Daniel ben-Avraham, Sven Dorosz, Michel Pleimling

We consider the distribution of the Hatano-Sasa entropy, , in reversible and irreversible processes, finding that the Crooks relation for the ratio of the pdf's of the fo…

cond-mat.stat-mech2010

Small-scale behaviour in deterministic reaction models

Paolo Politi, Daniel ben-Avraham

In a recent paper published in this journal [J. Phys. A: Math. Theor. 42 (2009) 495004] we studied a one-dimensional particles system where nearest particles attract with a force i…

cond-mat.stat-mech2010★ 5 cited

Greedy Connectivity of Geographically Embedded Graphs

Jie Sun, Daniel ben-Avraham

We introduce a measure of {\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information,…