5 papers · 1 filter
Functional central limit theorem for subgraph counts in a dynamic random connection model
Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes +1
We prove a functional central limit theorem for subgraph counts in a dynamic version of the random connection model. To establish tightness, we develop a dynamic extension of the c…
Functional limit theorems for Gaussian-fed queueing network in light and heavy traffic
Nikolai Kriukov, Krzysztof Dȩbicki, Michel Mandjes
We consider a queueing network operating under a strictly upper-triangular routing matrix with per column at most one non-negative entry. The root node is fed by a Gaussian process…
Parameter estimation in a dynamic Chung-Lu random graph
Rajat Subhra Hazra, Michel Mandjes, Jiesen Wang
In this paper we consider a dynamic version of the Chung-Lu random graph in which the edges alternate between being present and absent. The main contribution concerns a technique b…
Functional Central Limit Theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs
Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes
In this paper we consider a dynamic Erdős-Rényi random graph with independent identically distributed edge processes. Our aim is to describe the joint evolution of the entries of a…
Inference for dynamic Erdős-Rényi random graphs under regime switching
Michel Mandjes, Jiesen Wang
This paper examines a model involving two dynamic Erdős-Rényi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according…