相关论文: Ergodic Effects in Token Circulation
We show how to construct an overlay network of constant degree and diameter $O(\log n)$ in time $O(\log n)$ starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to…
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for representing peer-to-peer networks. We focus on two central…
We consider first passage percolation on the Erd\H{o}s--R\'{e}nyi graph with $n$ vertices in which each pair of distinct vertices is connected independently by an edge with probability $\lambda/n$ for some $\lambda>1$. The edges of the…
In this paper we study the maximum degree of interaction which may emerge in distributed systems. It is assumed that a distributed system is represented by a graph of nodes interacting over edges. Each node has some amount of data. The…
Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so…
We consider weakly interacting diffusions on time varying random graphs. The system consists of a large number of nodes in which the state of each node is governed by a diffusion process that is influenced by the neighboring nodes. The…
We follow the time sequence of binary elastic collisions in a small collection of hard-core particles. Intervals between the collisions are characterized by the numbers of collisions of different pairs in a given time. It was shown…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We characterize throughout the spectral range of an optical trap the nature of the noise at play and the ergodic properties of the corresponding Brownian motion of an overdamped trapped single microsphere, comparing experimental, analytical…
We investigate the entanglement within a system undergoing a random, local process. We find that there is initially a phase of very fast generation and spread of entanglement. At the end of this phase the entanglement is typically maximal.…
We provide a detailed multiscale analysis of a system of particles interacting through a dynamical network of links. Starting from a microscopic model, via the mean field limit, we formally derive coupled kinetic equations for the particle…
The transport of independent active Brownian particles within a two-dimensional narrow channel, modeled as an open-wedge, is studied both numerically and theoretically. We show that the active force tends to localize the particles near the…
Dynamic processes in dispersions of charged spherical particles are of importance both in fundamental science, and in technical and bio-medical applications. There exists a large variety of charged-particles systems, ranging from…
We consider a classic two-state switching diffusion model from a single-particle tracking perspective. The mean and the variance of the time-averaged mean square displacement (TAMSD) are computed exactly. When the measurement time (i.e.,…
We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…
We study the ergodic behaviour of a discrete-time process $X$ which is a Markov chain in a stationary random environment. The laws of $X_t$ are shown to converge to a limiting law in (weighted) total variation distance as $t\to\infty$.…
Intervals between discrete events representing human activities, as well as other types of events, often obey heavy-tailed distributions, and their impacts on collective dynamics on networks such as contagion processes have been intensively…
We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithms for online topological ordering have many applications,…
We propose the Temporal Walk Centrality, which quantifies the importance of a node by measuring its ability to obtain and distribute information in a temporal network. In contrast to the widely-used betweenness centrality, we assume that…
We consider the single-file dynamics of $N$ identical random walkers moving with diffusivity $D$ in one dimension (walkers bounce off each other when attempting to overtake). Additionally, we require that the separation between neighboring…