We introduce the random exponential recursive tree in which at each point of discrete time
every node recruits a child (new leaf) with probability p, or fails to do so with probability 1− p …

We construct critical percolation clusters on the diamond hierarchical lattice and show that
the scaling limit is a graph directed random recursive fractal. A Dirichlet form can be …

Algorithmics of Nonuniformity is a solid presentation about the analysis of algorithms, and
the data structures that support them. Traditionally, algorithmics have been approached …

We prove a distributional limit theorem conjectured in Clark (J Stat Phys 174 (6): 1372–
1403, 2019) for partition functions defining models of directed polymers on diamond …

We study a polymer model on hierarchical lattices very close to the one introduced and
studied in Derrida and Griffith (1989)[19] and Cook and Derrida (1989)[16]. For this model …

The theory of sparse graph limits concerns itself with versions of local convergence and
global convergence, see eg [44]. Informally, in local convergence we look at a large …

We study a directed polymer model defined on a hierarchical diamond lattice, where the
lattice is constructed recursively through a recipe depending on a branching number b∈ N …

We introduce polymer graphs, a class of fast-growing networks endowed with a designated
hook. We study the structure of these polymer graphs by investigating numerous average …

It is well known in biology that ants are able to find shortest paths between their nest and the
food by successive random explorations, without any mean of communication other than the …

We study asymptotic percolation as $ N\to\infty $ in an infinite random graph ${\cal G} _N $
embedded in the hierarchical group of order $ N $, with connection probabilities depending …