Wilfried Huss

From MaRDI portal
(Redirected from Person:410706)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Internal DLA on Sierpinski gasket graphs
Analysis and Geometry on Graphs and Manifolds
2021-09-23Paper
A law of large numbers for the range of rotor walks on periodic trees2020-09-17Paper
A law of large numbers for the range of rotor walks on periodic trees
(available as arXiv preprint)
2020-09-17Paper
Range and speed of rotor walks on trees
Journal of Theoretical Probability
2020-08-06Paper
Divisible sandpile on Sierpinski gasket graphs
Fractals
2020-04-22Paper
Interpolating between random walk and rotor walk
Random Structures & Algorithms
2018-06-07Paper
Rotor-routing on Galton-Watson trees
Electronic Communications in Probability
2015-08-17Paper
Erratum to: ``Transience and recurrence of rotor-router walks on directed covers of graphs
Electronic Communications in Probability
2015-02-03Paper
The rotor-router group of directed covers of graphs
The Electronic Journal of Combinatorics
2012-10-24Paper
The rotor-router group of directed covers of graphs
The Electronic Journal of Combinatorics
2012-10-24Paper
Transience and recurrence of rotor-router walks on directed covers of graphs
Electronic Communications in Probability
2012-10-23Paper
Internal aggregation models on comb lattices
Electronic Journal of Probability
2012-06-22Paper
Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
Theoretical Computer Science
2012-04-03Paper
Rotor-router aggregation on the comb
The Electronic Journal of Combinatorics
2012-03-06Paper
Rotor-router aggregation on the comb
The Electronic Journal of Combinatorics
2012-03-06Paper
Internal diffusion-limited aggregation on non-amenable graphs
Electronic Communications in Probability
2009-11-20Paper
Internal diffusion-limited aggregation on non-amenable graphs
Electronic Communications in Probability
2009-11-20Paper


Research outcomes over time


This page was built for person: Wilfried Huss