Related papers: Ergodic Effects in Token Circulation
We study how to spread $k$ tokens of information to every node on an $n$-node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be completed in $O(n + k)$ rounds in any static network, and…
We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every $I(n)$ time units, with the objective of minimizing the…
We study N interacting random walks on the positive integers. Each particle has drift {\delta} towards infinity, a reflection at the origin, and a drift towards particles with lower positions. This inhomogeneous mean field system is shown…
The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network,…
We study a population of $N$ particles, which evolve according to a diffusion process and interact through a dynamical network. In turn, the evolution of the network is coupled to the particles' positions. In contrast with the mean-field…
The generic behavior of quantum systems has long been of theoretical and practical interest. Any quantum process is represented by a sequence of quantum channels. We consider general ergodic sequences of stochastic channels with arbitrary…
By means of a novel variational approach we study ergodic properties of a model of a multi lane traffic flow, considered as a (deterministic) wandering of interacting particles on an infinite lattice. For a class of initial configurations…
We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
We study statistical properties of a family of maps acting in the space of integer valued sequences, which model dynamics of simple deterministic traffic flows. We obtain asymptotic (as time goes to infinity) properties of trajectories of…
We study distribution of orbits sampled at polynomial times for uniquely ergodic topological dynamical systems $(X, T)$. First, we prove that if there exists an increasing sequence $(q_n)$ for which the rigidity condition \[…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…
We study lower bounds on information dissemination in adversarial dynamic networks. Initially, k pieces of information (henceforth called tokens) are distributed among n nodes. The tokens need to be broadcast to all nodes through a…
The problem of stochastic advection of passive particles by circulating conserved flows on networks is formulated and investigated. The particles undergo transitions between the nodes with the transition rates determined by the flows…
Random walks are widely used for mining networks due to the computational efficiency of computing them. For instance, graph representation learning learns a d-dimensional embedding space, so that the nodes that tend to co-occur on random…
Quantum observables in the form of few-point correlators are the key to characterizing the dynamics of quantum many-body systems. In dynamics with fast entanglement generation, quantum observables generally become insensitive to the details…
We present results for the equilibrium statistics and dynamic evolution of moderately large ($n = {\mathcal{O}}(10^2 - 10^3)$) numbers of interacting point vortices on the unit sphere under the constraint of zero mean angular momentum. We…
In this paper we consider a class of interacting particle systems on dynamic random networks, in which the joint dynamics of vertices and edges acts as one-way feedback, i.e., edges appear and disappear over time depending on the state of…
Algorithms and dynamics over networks often involve randomization, and randomization may result in oscillating dynamics which fail to converge in a deterministic sense. In this paper, we observe this undesired feature in three applications,…