14 citations · 23 across the 7 of their papers we have counts for
11 papers
A law of large numbers for the range of rotor walks on periodic trees
Wilfried Huss, Ecaterina Sava-Huss
The aim of the current work is to prove a law of large numbers for the range size of recurrent rotor walks with random initial configuration on a general class of trees, called per…
Range and speed of rotor walks on trees
Wilfried Huss, Ecaterina Sava-Huss
We prove a law of large numbers for the range of rotor walks with random initial configuration on regular trees and on Galton-Watson trees. More precisely, we show that on the clas…
Divisible sandpile on Sierpinski gasket graphs
Wilfried Huss, Ecaterina Sava-Huss
The divisible sandpile model is a growth model on graphs that was introduced by Levine and Peres as a tool to study internal diffusion limited aggregation. In this work we investig…
Internal DLA on Sierpinski gasket graphs
Joe P. Chen, Wilfried Huss, Ecaterina Sava-Huss +1
Internal diffusion-limited aggregation (IDLA) is a stochastic growth model on a graph which describes the formation of a random set of vertices growing from the origin (some fi…
Interpolating between random walk and rotor walk
Wilfried Huss, Lionel Levine, Ecaterina Sava-Huss
We introduce a family of stochastic processes on the integers, depending on a parameter and interpolating between the deterministic rotor walk (p=0) and the simple ra…
Rotor-routing on Galton-Watson trees
Wilfried Huss, Sebastian Mueller, Ecaterina Sava-Huss
A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first…
The rotor-router group of directed covers of graphs
Wilfried Huss, Ecaterina Sava
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here dir…
Transience and recurrence of rotor-router walks on directed covers of graphs
Wilfried Huss, Ecaterina Sava-Huss
The aim of this note is to extend the result of Angel and Holroyd concerning the transience and the recurrence of transfinite rotor-router walks, for random initial configuration o…
Internal Aggregation Models on Comb Lattices
Wilfried Huss, Ecaterina Sava
The two-dimensional comb lattice is a natural spanning tree of the Euclidean lattice . We study three related cluster growth models on : internal diffusion…
Rotor-Router Aggregation on the Comb
Wilfried Huss, Ecaterina Sava
We prove a shape theorem for rotor-router aggregation on the comb, for a specific initial rotor configuration and clockwise rotor sequence for all vertices. Furthermore, as an appl…
Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
Wilfried Huss, Ecaterina Sava, Wolfgang Woess
A language L over a finite alphabet is growth-sensitive (or entropy sensitive) if forbidding any set of subwords F yields a sub-language L^F whose exponential growth rate (entropy)…