activity
20012026
most citedPrinciples of seed banks: complexity emerging from dormancy

117 citations · 561 across the 64 of their papers we have counts for

collaborators
Showing 2017Show all

6 papers · 1 filter

math-ph2017★ 11 cited

Covariance structure behind breaking of ensemble equivalence in random graphs

Diego Garlaschelli, Frank den Hollander, Andrea Roccaverde

For a random graph subject to a topological constraint, the microcanonical ensemble requires the constraint to be met by every realisation of the graph (`hard constraint'), while t…

math.PR2017★ 17 cited

Metastability of hard-core dynamics on bipartite graphs

Frank den Hollander, Francesca R. Nardi, Siamak Taati

We study the metastable behaviour of a stochastic system of particles with hard-core interactions in a high-density regime. Particles sit on the vertices of a bipartite graph. New…

math-ph2017★ 2 cited

Annealed scaling for a charged polymer in dimensions two and higher

Quentin Berger, Frank den Hollander, Julien Poisat

This paper considers an undirected polymer chain on , , with i.i.d.\ random charges attached to its constituent monomers. Each self-intersection of the poly…

math.PR2017

Ensemble equivalence for dense graphs

F. den Hollander, M. Mandjes, A. Roccaverde +1

In this paper we consider a random graph on which topological restrictions are imposed, such as constraints on the total number of edges, wedges, and triangles. We work in the dens…

cond-mat.dis-nn2017★ 8 cited

Synchronization of phase oscillators on the hierarchical lattice

Diego Garlaschelli, Frank den Hollander, Janusz Meylahn +1

Synchronization of neurons forming a network with a hierarchical structure is essential for the brain to be able to function optimally. In this paper we study synchronization of ph…

math.PR2017★ 7 cited

Expansion of percolation critical points for Hamming graphs

Lorenzo Federico, Remco van der Hofstad, Frank den Hollander +1

The Hamming graph is the Cartesian product of complete graphs on vertices. Let be the degree and be the number of vertices of . Let $p…