Related papers: Graphon-valued processes with vertex-level fluctua…

The goal of this paper is to develop a theory of graphon-valued stochastic processes, and to construct and analyse a natural class of such processes arising from population genetics. We consider finite populations where individuals change…

The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…

We study the dynamics of the Internet topology based on the empirical data on the level of the autonomous systems. It is found that the fluctuations occurring in the stochastic process of connecting and disconnecting edges are important…

We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…

Many signals evolve in time as a stochastic process, randomly switching between states over discretely sampled time points. Here we make an explicit link between the underlying stochastic process of a signal that can take on a bounded…

We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…

The statistical properties of a stochastic process may be described (1)by the expectation values of the observables, (2)by the probability distribution functions or (3)by probability measures on path space. Here an analysis of level (3) is…

We compute the joint large deviation rate functional in the limit of large time for the current flowing through the edges of a finite graph on which a boundary-driven system of stochastic particles evolves with zero-range dynamics.This…

We establish tightness of graph-based stochastic processes in the space $D[0+\epsilon,1-\epsilon]$ with $\epsilon >0$ that allows for discontinuities of the first kind. The graph-based stochastic processes are based on statistics…

We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathcal{H}_k$ from all labeled $k$-vertex graphs into itself ($k$…

We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…

We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…

We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…

We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…

We investigate local-density dependent Markov processes on a class of large graphs sampled from a graphon, where the transition rates of the vertices are influenced by the states of their neighbors. We show that as the average degree…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…

We study the global fluctuations for a class of determinantal point processes coming from large systems of non-colliding processes and non-intersecting paths. Our main assumption is that the point processes are constructed by biorthogonal…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…