Related papers: Rotor-routing on Galton-Watson trees
We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications in reconfigurable datacenter networks. We are given a fixed…
Motile biological cells in tissue often display the phenomenon of durotaxis, i.e. they tend to move towards stiffer parts of substrate tissue. The mechanism for this behavior is not completely understood. We consider simplified models for…
Consider the following routing problem in the context of a large scale network $G$, with particular interest paid to power law networks, although our results do not assume a particular degree distribution. A small number of nodes want to…
Consider a random walk in random environment on a supercritical Galton--Watson tree, and let $\tau_n$ be the hitting time of generation $n$. The paper presents a large deviation principle for $\tau_n/n$, both in quenched and annealed cases.…
We show that the trace of the null recurrent biased random walk on a Galton-Watson tree properly renormalized converges to the Brownian forest. Our result extends to the setting of the random walk in random environment on a Galton-Watson…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…
Consider a branching random walk, where the branching mechanism is governed by a Galton-Watson process, and the migration by a finite range symmetric irreducible random walk on the integer lattice $\mathbb{Z}^d$. Let $Z_n(z)$ be the number…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
In this paper, we deal with the problem of full-body path planning for walking robots. The state of walking robots is defined in multi-dimensional space. Path planning requires defining the path of the feet and the robot's body. Moreover,…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
Tracking the movement of tracer particles has long been a strategy for uncovering complex structures. Here, we study discrete-time random walks on finite Cayley trees to infer key parameters such as tree depth and geometric bias toward the…
Next-token predictors often appear to develop internal representations of the latent world and its rules. The probabilistic nature of these models suggests a deep connection between the structure of the world and the geometry of probability…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…
We work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…
Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…
We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…
We consider a generalized Derrida-Retaux model on a Galton-Watson tree with a geometric offspring distribution. For a class of recursive systems, including the Derrida-Retaux model with either a geometric or exponential initial…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…