Correlation bounds, mixing and m-dependence under random time-varying network distances with an application to Cox-Processes

06/07/2019
by   Alexander Kreiss, et al.
0

We will consider multivariate stochastic processes indexed either by vertices or pairs of vertices of a dynamic network. Under a dynamic network we understand a network with a fixed vertex set and an edge set which changes randomly over time. We will assume that the spatial dependence-structure of the processes is linked with the network in the following way: Two neighbouring vertices (or two adjacent pairs of vertices) are dependent, while we assume that the dependence decreases as the distance in the network increases. We make this intuition mathematically precise by considering three concepts based on correlation, beta-mixing with time-varying beta-coefficients and conditional independence. Then, we will use these concepts in order to prove weak-dependence results, e.g. an exponential inequality, which might be of independent interest. In order to demonstrate the use of these concepts in an application we study the asymptotics (for growing networks) of a goodness of fit test in a dynamic interaction network model based on a multiplicative Cox-type hazard model. This model is then applied to bike-sharing data.

READ FULL TEXT
research
03/09/2023

The joint node degree distribution in the Erdős-Rényi network

The Erdős-Rényi random graph is the simplest model for node degree distr...
research
07/03/2018

Time Series Modeling on Dynamic Networks

We consider multivariate time series on dynamic networks with a fixed nu...
research
07/01/2020

Inheritance of strong mixing and weak dependence under renewal sampling

Let X be a continuous-time strongly mixing or weakly dependent process a...
research
12/06/2019

Diversity, Dependence and Independence

We introduce the concepts of dependence and independence in a very gener...
research
06/14/2017

Alignment Distances on Systems of Bags

Recent research in image and video recognition indicates that many visua...
research
08/29/2016

Discovering Patterns in Time-Varying Graphs: A Triclustering Approach

This paper introduces a novel technique to track structures in time vary...
research
07/06/2022

Networks with Correlated Edge Processes

This article proposes methods to model nonstationary temporal graph proc...

Please sign up or login with your details

Forgot password? Click here to reset