2 citations · 4 across the 4 of their papers we have counts for
6 papers
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…
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…
Lamplighter Random Walks and Entropy-Sensitivity of Languages
Ecaterina Sava
The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmo…
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)…
A note on the Poisson boundary of lamplighter random walks
Ecaterina Sava
The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups endowed with a rich boundary. The starting…