相关论文: Ergodic Effects in Token Circulation

Heavy particles suspended in turbulent flow possess inertia and are ejected from violent vortical structures by centrifugal forces. Once piled up along particle paths, this small-scale mechanism leads to an effective large-scale drift. This…

In this work we consider temporal graphs, i.e. graphs, each edge of which is assigned a set of discrete time-labels drawn from a set of integers. The labels of an edge indicate the discrete moments in time at which the edge is available. We…

We consider an independently identically distributed random dynamical system generated by finitely many, non-uniformly expanding Markov interval maps with a finite number of branches. Assuming a topologically mixing condition and the…

We study weighted ensemble, an interacting particle method for sampling distributions of Markov chains that has been used in computational chemistry since the 1990s. Many important applications of weighted ensemble require the computation…

We put forward a conjecture of recurrence for a gas of hard spheres that collide elastically in a finite volume. The dynamics consists of a sequence of instantaneous binary collisions. We study how the numbers of collisions of different…

In the classic online graph balancing problem, edges arrive sequentially and must be oriented immediately upon arrival, to minimize the maximum in-degree. For adversarial arrivals, the natural greedy algorithm is $O(\log n)$-competitive,…

The random order graph streaming model has received significant attention recently, with problems such as matching size estimation, component counting, and the evaluation of bounded degree constant query testable properties shown to admit…

We show an $\widetilde{O}(m^{1.5} \epsilon^{-1})$ time algorithm that on a graph with $m$ edges and $n$ vertices outputs its spanning tree count up to a multiplicative $(1+\epsilon)$ factor with high probability, improving on the previous…

In this paper, we tackle a challenging problem inherent in a series of applications: tracking the influential nodes in dynamic networks. Specifically, we model a dynamic network as a stream of edge weight updates. This general model…

Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision or becomes infected -- but the connectivity, transmission…

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…

We provide a probabilistic analysis of the banker algorithm when transition probabilities may depend on time and space. The transition probabilities evolve, as time goes by, along the trajectory of an ergodic Markovian environment, whereas…

We study the transport of self-propelled particles in dynamic complex environments. To obtain exact results, we introduce a model of run-and-tumble particles (RTPs) moving in discrete time on a $d$-dimensional cubic lattice in the presence…

We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…

We study the long time evolution and stationary speed distribution of N point particles in 2D moving under the action of an external field E, and undergoing elastic collisions with either a fixed periodic array of convex scatterers, or with…

In this paper we consider generalized flow problems where there is an $m$-edge $n$-node directed graph $G = (V,E)$ and each edge $e \in E$ has a loss factor $\gamma_e >0$ governing whether the flow is increased or decreased as it crosses…

This paper deals with (globally) random substitutions on a finite set of prototiles. Using renormalization tools applied to objects from operator algebras we establish upper and lower bounds on the rate of deviations of ergodic averages for…

It has been observed that an interesting class of non-Gaussian stationary processes is obtained when in the harmonics of a signal with random amplitudes and phases, frequencies can also vary randomly. In the resulting models, the…

This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in…

We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…