Related papers: Spiral Structures in the Rotor-Router Walk
In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$ and obtain its correct asymptotic in…
Transport networks, such as vasculature or river networks, provide key functions in organisms and the environment. They usually contain loops whose significance for the stability and robustness of the network is well documented. However,…
In this supplementary note, we study the traces of multiple SLE(0) systems with two or more additional marked points. For general chordal configurations, the traces correspond to the real locus of real rational functions; in the radial…
We study a number of combinatorial and algebraic structures arising from walks on the two-dimensional integer lattice. To a given step set $X\subseteq\mathbb Z^2$, there are two naturally associated monoids: $\mathscr F_X$, the monoid of…
An LR-structure is a tetravalent vertex-transitive graph together with a special type of a decomposition of its edge-set into cycles. LR-structures were introduced in a paper by P. Poto\v{c}nik and S. Wilson, titled `Linking rings…
Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.
We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.
Oriented self-avoiding walks (OSAWs) on a square lattice are studied, with binding energies between steps that are oriented parallel across a face of the lattice. By means of exact enumeration and Monte Carlo simulation, we reconstruct the…
We study the set of periods of degree 1 continuous maps from sigma into itself, where sigma denotes the space shaped like the letter sigma (i.e., a segment attached to a circle by one of its endpoints). Since the maps under consideration…
We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
The space of invariants for a single matrix is generated by traces containing at most $N$ matrices per trace. We extend this analysis to multi-matrix models at finite $N$. Using the Molien-Weyl formula, we compute partition functions for…
In this and in a previous paper (Romero-Gomez et al. 2006) we propose a theory to explain the formation of both spirals and rings in barred galaxies using a common dynamical framework. It is based on the orbital motion driven by the…
The loop clusters of a Poissonian ensemble of Markov loops on a finite or countable graph have been studied in \cite{Markovian-loop-clusters-on-graphs}. In the present article, we study the loop clusters associated with a rotation invariant…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…
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 periodic trees or directed covers of graphs.
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…