Emergence and coexistence of periodic and unstructured motion in future-avoiding random walks

arXiv:2602.03308 · nlin.AO, physics.soc-ph · Submitted 2026-02-03 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Nonlinear Sciences. The day in nonlinear science: chaos, patterns, networks and adaptation.

Kai: We're looking at the paper: "Emergence and coexistence of periodic and unstructured motion in future-avoiding random walks".

Mira: Here's the gist of the paper. Emergence and co-existence of periodic and unstructured motion in future-avoiding random walks shows that periodic behavior emerges spontaneously in mutual future avoiding random walks (MFARWs), providing a first example of chimera style behavior where coherent and noncoherent states coexist on networks The paper investigates Mutual future avoiding random walks (MFARWs), which model stochastically driven walkers avoiding each others planned future trajectories, arising naturally in conceptual models of shared mobility.

Kai: These systems are compared to self-avoiding random walks on graphs, which represent walkers interacting with their own past history and are inspired by ride-pooling fleets.

Mira: The concept of chimera states, where a system spontaneously splits into coexisting coherent and noncoherent subpopulations, has been broadened to include neural models, fluid flows, and reaction-diffusion systems.

Kai: In the context of mobility, coherent routes equate to line services (public transport), while unstructured routes correspond to flexible trajectories without periodicity.

Paper summary: Kai: So looking at the title again, "Emergence and co-existence of periodic and unstructured motion in future-avoiding random walks," what's the core message they want us to get from this work?

Mira: The main point is that when you couple walkers who are planning their future moves, periodic behavior pops out on its own, and it doesn't have to fight against the flexible, unstructured paths Lev.

Lev: It’s about the self-amplifying coupling they found in the stochastic drivers that pushes things toward these periodic components Kai.

Kai: And they are showing this is a discovery of chimera style behavior arising from non-oscillatory dynamics, which is a new way to think about these kinds of systems Mira.

Mira: It suggests that even without inherent oscillations in the underlying math, you can get structured coexistence if the coupling mechanism is right Lev.

Kai: The implication for mobility is that we might find natural states where flexible transport and fixed line services can just exist together without constant external tuning Mira.

Lev: From a hardware or system design standpoint, it means you have to account for these multiple stable behaviors, not just the simplest one that comes out of the math Kai.

Mira: It’s about moving away from assuming pure unstructured flow and instead recognizing that structure can emerge from interaction alone Lev.

Kai: So they're demonstrating this emergence across different dispatching strategies, which is a strong point for validating this finding Mira.

Conclusion: Mira: So, basically, this paper is about how these random walks that are trying to avoid each other's future paths start doing weird stuff on their own Kai.

Kai: Right, they call it mutual future avoiding random walks Lev, and the main thing they found is that periodic motion doesn't need to be programmed in; it just pops out because of the way these walkers are interacting with each other’s plans Mira.

Lev: It's like watching a crowd move on a busy street, and suddenly you see people forming a predictable rhythm even though no one told them to Kai.

Mira: Exactly. The authors show that depending on how you set up the simulation—the network structure and how many requests there are—you can end up with just unstructured paths, or you can get these coexisting patterns of flexible routes and fixed line services Lev.

Kai: That’s the chimera thing they are pointing to, where these two different types of motion exist at the same time on a network Mira.

Lev: It's interesting because it's not like a simple oscillation where one thing just turns on and off; it’s this self-organized emergence from non-linear coupling Kai.

Mira: Which means we aren't just looking for patterns that are programmed in, but patterns that naturally arise when things are interacting in complex ways Lev.

Kai: The authors found periodic routes by looking at how often they went back to the same spots on a recurrence plot, showing those diagonal lines dominating Mira.

Lev: And they linked this to two different dispatching algorithms—one heuristic and one minimal fleet distance—showing it happens regardless of the specific rule you use Kai.

Mira: So, even when you have totally random origin destination pairs, you can still get these structured coexistence states in mobility models Lev.

Kai: It suggests that in real-world systems where agents are constantly planning ahead, we might see these mixed behaviors instead of just one simple flow Mira.

Lev: What this means for us is that when we design transportation systems, we can't just aim for the most efficient single path; we have to anticipate these coexisting possibilities Kai.

Mira: It opens up a whole new way to think about how complex, dynamic systems settle into multiple stable states Lev.

A. Schmaus, K. Stiller, N. Molkenthin

Potsdam Institute for Climate Impact Research · Technical University Berlin

nlin.AO, physics.soc-ph

Submitted: 2026-02-03

Updated: 2026-10-30

Journal ref: Phys. Rev. E 114, 044219 , 23 October, 2026

DOI: 10.1103/9q1j-dlw8

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 82/100

The gist: Emergence and co-existence of periodic and unstructured motion in future-avoiding random walks shows that periodic behavior emerges spontaneously in mutual future avoiding random walks (MFARWs)…

Key concepts

Mutual Future Avoiding Random Walks (MFARWs)
These are models representing walkers who actively try to avoid the planned future paths of other walkers. They arise in conceptual models of shared mobility, where vehicles or agents plan routes while trying to maintain distance from others' intended destinations.
Chimera States
This refers to a system spontaneously splitting into two distinct types of behavior—coherent (periodic) and non-coherent (unstructured). In this context, it means that in the mobility system, some routes become fixed and predictable (like public transport), while others remain flexible and unpredictable.
Coherent vs. Unstructured Routes
Coherent routes are those exhibiting periodic behavior, often resembling line services like public transport with fixed schedules. Unstructured routes are flexible trajectories without a set periodicity, representing more spontaneous or on-demand travel patterns.

Terminology

Summary

Emergence and co-existence of periodic and unstructured motion in future-avoiding random walks shows that periodic behavior emerges spontaneously in mutual future avoiding random walks (MFARWs), providing a first example of chimera style behavior where coherent and noncoherent states coexist on networks

Introduction to the System

The paper investigates Mutual future avoiding random walks (MFARWs), which model stochastically driven walkers avoiding each others planned future trajectories, arising naturally in conceptual models of shared mobility. These systems are compared to self-avoiding random walks on graphs, which represent walkers interacting with their own past history and are inspired by ride-pooling fleets. p. 0

Where the paper says it

molkenthin@pik-potsdam. de) (Dated: February 4, 2026) Self-avoiding random walks on graphs can be seen as walkers interacting with their own past history.

The concept of chimera states, where a system spontaneously splits into coexisting coherent and noncoherent subpopulations, has been broadened to include neural models, fluid flows, and reaction-diffusion systems. p. 0
Where the paper says it

If a system of identical units governed by symmetric rules spontaneously splits into coexisting coherent and noncoherent subpopulations, this is called a chimera state. While introduced in the analysis of coupled oscillators [1], the concept has significantly broadened since [16].

In the context of mobility, coherent routes equate to line services (public transport), while unstructured routes correspond to flexible trajectories without periodicity. p. 0
Where the paper says it

public transport), periodically visiting the same sequence of nodes. Conversely, non-coherent or unstructured routes correspond to flexible trajectories without periodicity, as commonly found in on-demand systems.

Simulation Methodology

The routes are generated using simulations with the python package ridepy. The simulation requires a stop network and timed origin-destination pairs, where origin-destination (OD) pairs are uniformly random. p. 0

Where the paper says it

Methods– The routes presented in this study are generated from simulations with the python package ridepy [21]. As input the simulation requires a stop network together with timed origin-destination pairs.

Request occurrence times are generated using a Poisson process with rate λ = ∆t−1, where ∆t is the average time between requests. p. 0
Where the paper says it

The occurrence times of requests are generated using a Poisson process, with rate λ = ∆t −1 , where ∆t is the average time between requests. To facilitate the comparison between different parameter settings, we use the normalized request load x [24] as: x = λ⟨l⟩ B , (1) where B denotes the number of routes in the system and ⟨l⟩ the 0 1 3 2 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 (a) (b) (c) (d) (e) (f) 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 34 33 32 35 36 37 38 39 FIG.

Two dispatcher algorithms, the No-Detour-Heuristic (NDH) and the Minimal-Fleet-Distance (MFD), are used to process requests sequentially. p. 1
Where the paper says it

The simulations process the requests sequentially using two dispatcher algorithms: the No-Detour-Heuristic dispatcher (NDH) and the Minimal-Fleet-Distance dispatcher (MFD). The NDH dispatcher is based on the dispatcher used in [22].

The link usage of an edge is defined as the fraction of edge i in the edges that form any route in the fleet T = T0,TB. p. 1
Where the paper says it

Note that in both cases, the trajectories interact by competing for requests, which is decided on the basis of the future part of the route. The link usage ρ(i) of edge i is defined as the fraction of edge i in the edges that form any route in the fleet T = {T0,.

Evidence for Coexistence

The simulations reveal evidence for the emergence of chimera-like coexistence of coherent and non-coherent states. The results imply a self-reinforcing mechanism that preferentially adds detours to shorter routes, leaving the straight additions for longer, straighter routes. p. 0

Where the paper says it

We find evidence for the emergence of chimera-like coexistence of coherent and non-coherent states in numerical simulations, and derive an analytic approximation that describes the onset of structure in the paths. The results imply a self-reinforcing mechanism, which preferentially adds detours to shorter routes, leaving the straight additions for longer, straighter routes.

The final trajectories are analyzed using recurrence plots to identify recurring nodes and periodic patterns. p. 1
Where the paper says it

The final trajectories Tb from simulations and theoretical models are also analyzed using recurrence plots [23]. To identify recurring nodes on a route and find periodic patterns, we go beyond the binary recurrence matrix and replace the ones of the recurrence matrix with the trajectory value corresponding to these indices.

For a single route, traveling salesperson (TS) like paths seem to play a central role in explaining link usage patterns. p. 1
Where the paper says it

the average diagonal line length, as defined in [23]: L = ∑ N lmin lP(l) ∑ N l=1 lP(l) , (4) where we chose lmin = 2 and P(l) is the histogram of diagonal line lengths. Periodic routes explain single route link usage patterns– Even for a single route, the dynamics show significant structural richness, with traveling salesperson (TS) like paths seemingly playing a central role.

Emergence of Periodic Behavior

Periodic routes are observed in the simulations, with the routes depicted in Fig. 3 a, b, e, and f being periodic over the entire simulation time. p. 2

Where the paper says it

The routes depicted in Fig. 3 a, b, e, and f) are periodic over the entire simulation time.

This periodicity is evidenced by the dominance of diagonal lines in the recurrence plots for these routes. p. 2
Where the paper says it

3 a, b, e, and f) are periodic over the entire simulation time. This is evidenced by the dominance of diagonal lines in the recurrence plots in Fig.

The MFD dispatcher reserves periodic routes for long-distance requests going from corner to opposite corner, while the NDH dispatcher equally selects all OD-pairs on the periodic route to be served by a periodic vehicle.

Analysis of Periodicity Fraction

The normalized average diagonal line length, defined as F = L⟨T⟩/2, is used as a measure of route periodicity fraction. For the cycle graph, the analysis suggests that some routes accumulate reversals while others establish periodicity. p. 3

Where the paper says it

time between requests being assigned to each route. As a result, some routes accumulate reversals, while others establish periodicity.

The analytic approximation for the cycle graph suggests a mechanism of preferential addition of detours to shorter routes, while longer routes attract shortest path additions. p. 4
Where the paper says it

This finding constitutes the discovery of chimera-like states in a novel type of not intrinsically oscillatory dynamics with nonlinear coupling. The analytic approximation for the cycle graph suggests a mechanism of preferential addition of detours to shorter routes, while longer routes attract shortest path additions.

This finding hints at the possibility of a natural state of co-existence between flexible and line-based transport options. p. 4
Where the paper says it

The analytic approximation for the cycle graph suggests a mechanism of preferential addition of detours to shorter routes, while longer routes attract shortest path additions. The self-organized emergence of coexisting periodic and unstructured routes is especially interesting, as it hints at the possibility of a natural state of co-existence between flexible and line-based transport options, contributing to the debate whether shared pooled mobility competes with or complements public transport [8, 29].

Conclusion on Chimera States

The analysis demonstrates that periodic trajectories spontaneously emerge from future-driven interacting path dynamics with uniformly distributed origin-destination pairs for two distinct dispatching dynamics. Depending on the underlying network and request density as well as the number of requests and the fleet size, there may be only unstructured routes or coexisting periodic and unstructured routes. p. 3

Where the paper says it

self-avoiding random walks). Depending on the underlying network and the request density as well as the number of requests and the fleet size, there may be i) only unstructured routes or ii) coexisting

This discovery constitutes the finding of chimera-like states in a novel type of not intrinsically oscillatory dynamics with nonlinear coupling. p. 4
Where the paper says it

Although these general categories were observed in both dispatcher dynamics, the conditions under which they occurred varied. This finding constitutes the discovery of chimera-like states in a novel type of not intrinsically oscillatory dynamics with nonlinear coupling.

The self-organized emergence hints at the possibility of a natural state of co-existence between flexible and line-based transport options. p. 4
Where the paper says it

The analytic approximation for the cycle graph suggests a mechanism of preferential addition of detours to shorter routes, while longer routes attract shortest path additions. The self-organized emergence of coexisting periodic and unstructured routes is especially interesting, as it hints at the possibility of a natural state of co-existence between flexible and line-based transport options, contributing to the debate whether shared pooled mobility competes with or complements public transport [8, 29].

Acknowledgments

The authors thank Malte Schroeder and Norbert Marwan for fruitful discussions. Alexander Schmaus acknowledges support from the German Federal Environmental Foundation (Deutsche Bundesstiftung Umwelt). p. 4

Where the paper says it

We thank Malte Schroeder and Norbert Marwan for fruitful discussions. Alexander Schmaus acknowledges support from the German Federal Environmental Foundation (Deutsche Bundesstiftung Umwelt).

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Develop predictive models for ride-pooling fleet dynamics by utilizing a novel mechanism of selfamplifying coupling to periodic components of stochastic drivers, which can predict when and how periodic behavior emerges in future-avoiding random walks.

  2. Create an AI system capable of identifying and leveraging chimera states in mobility networks, allowing the system to maintain a regime of naturally stable coexistence between flexible, unstructured routes and line-based public transport routes.

  3. Implement routing algorithms that prioritize detours based on the analytic approximation derived from the paper, which states that a self-reinforcing mechanism, which preferentially adds detours to shorter routes. This improves route planning by favoring longer, straighter connections when serving specific demand patterns.

  4. Design a system for optimizing transportation service provision by predicting the route periodicity fraction F using equation 7, which estimates the probability that a route is periodic over the entire simulation time based on request arrival times and direction change probabilities.

  5. Enhance demand response systems by using recurrence plots to analyze route structure, enabling the AI to distinguish between periodic routes and unstructured routes in real-time to inform dynamic service adjustments.

Abstract

Self-avoiding random walks on graphs can be seen as walkers interacting with their own past history. Here, we consider a complementary class of dynamics, mutual future-avoiding random walks (MFARWs), where stochastically driven walkers are avoiding each other's planned future trajectories. Such systems arise naturally in conceptual models of shared mobility. We show that periodic behavior emerges spontaneously in two different MFARWs, and that periodic and unstructured behavior coexist, providing an example of chimera like behavior of nonoscillatory paths on networks. Further, we analytically describe and predict the onset of structure. We find that the transition from unstructured to periodic behavior is driven by a mechanism of self-amplifying coupling to the periodic components of the stochastic drivers of the system. In the context of shared mobility applications, these states imply a regime of naturally stable coexistence between flexible and line-based public transport.

Related papers