Searcharxiv⌕ Search

arXiv subjects

Nikolai Kriukov

Publications and source records attributed to Nikolai Kriukov.

11 recordsLinked to original sources
arXiv2026

Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs

In this paper we consider two-opinion voter models on dynamic random graphs, in which the joint dynamics of opinions and graphs acts as one-way feedback, i.e., edges appear and disappear over time depending on the opinions of the two connected vertices, while the opinion dynamics is not affected by the graph structure. Our goal is to investigate the joint evolution of the entries of a voter subgraph count vector, i.e., vector of subgraphs where each vertex has a specific opinion, in the regime that the number of vertices grows large. The main result of this paper is a functional central limit theorem. In particular, we prove that, under a proper centering and scaling, the joint functional of the vector of subgraph counts converges to a specific multidimensional Gaussian process.

math.PR↗
arXiv2026

Lévy-driven queuing networks in multi-scale light and heavy traffic

We study a queueing network with a strictly upper-triangular routing matrix, where each column contains at most one non-negative entry, and the root node receives input from a spectrally positive Lévy process. Our aim is to characterize the distribution of the multivariate stationary workload under a specific scaling of the service rates. Under mild conditions on the Laplace exponent of the driving Lévy process, we identify the limiting law of an appropriately scaled joint stationary workload in both light-traffic and heavy-traffic regimes. In particular, we establish conditions under which certain queueing workloads within the network asymptotically decouple, becoming independent in the limiting regime.

math.PR↗
arXiv2025

Extremes of Brownian Decision Trees

We consider a Brownian motion with linear drift that splits at fixed time points into a fixed number of branches, which may depend on the branching point. For this process, which we shall refer to as the Brownian decision tree, we investigate the exact asymptotics of high exceedance probabilities in finite time horizon, including: the probability that at least one branch exceeds some high threshold, the probability that the largest distance between branches gets large and the probability that all branches simultaneously exceed some high barrier. Additionally, we find the asymptotics for the probability that all branches of at least one of $M$ independent Brownian decision trees exceed a high threshold.

math.PR↗
arXiv2025

Functional Central Limit Theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs

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 subgraph count vector. The main result of this paper is a functional central limit theorem: we establish, under an appropriate centering and scaling, the joint functional convergence of the vector of subgraph counts to a specific multidimensional Gaussian process. The result holds under mild assumptions on the edge processes, most notably a Lipschitz-type condition.

math.PR↗
arXiv2025

Functional limit theorems for Gaussian-fed queueing network in light and heavy traffic

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 with stationary increments. Our aim is to characterize the distribution of the multivariate stationary workload process under a specific scaling of the queue's service rates. In the main results of this paper we identify, under mild conditions on the standard deviation function of the driving Gaussian process, in both light and heavy traffic parameterization, the limiting law of an appropriately scaled version (in both time and space) of the joint stationary workload process. In particular, we develop conditions under which specific queueing processes of the network effectively decouple, i.e., become independent in the limiting regime.

math.PR↗
arXiv2024

Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs

In this paper we consider a dynamic version of the Erdős-Rényi random graph, in which edges independently appear and disappear in time, with the on- and off times being exponentially distributed. The focus lies on the evolution of the principle eigenvalue of the adjacency matrix in the regime that the number of vertices grows large. The main result is a functional central limit theorem, which displays that the principal eigenvalue essentially inherits the characteristics of the dynamics of the individual edges.

math.PR↗
arXiv2022

Uniform bounds for ruin probability in Multidimensional Risk Model

In this paper we consider some generalizations of the classical d-dimensional Brownian risk model. This contribution derives some non-asymptotic bounds for simultaneous ruin probabilities of interest. In addition, we obtain non-asymptotic bounds also for the case of general trend functions and convolutions of our original risk model.

math.PR↗
arXiv2021

Simultaneous ruin probability for multivariate gaussian risk model

Let $\textbf{Z}(t)=(Z_1(t) ,\ldots, Z_d(t))^\top , t \in \mathbb{R}$ where $Z_i(t), t\in \mathbb{R}$, $i=1,...,d$ are mutually independent centered Gaussian processes with continuous sample paths a.s. and stationary increments. For $\textbf{X}(t)= A \textbf{Z}(t),\ t\in\mathbb{R}$, where $A$ is a nonsingular $d\times d$ real-valued matrix, $\textbf{u}, \textbf{c}\in\mathbb{R}^d$ and $T>0$ we derive tight bounds for \[ \mathbb{P}\left\{\exists_{t\in [0,T]}: \cap_{i=1}^d \{ X_i(t)- c_i t > u_i\}\right\} \] and find exact asymptotics as $(u_1,...,u_d)^{\top}= (u a_1,..., ua_d)^\top$ and $u\to\infty$.

math.PR↗
arXiv2021

Pandemic-type Failures in Multivariate Brownian Risk Models

Modelling of multiple simultaneous failures in insurance, finance and other areas of applied probability is important especially from the point of view of pandemic-type events. A benchmark limiting model for the analysis of multiple failures is the classical $d$-dimensional Brownian risk model (Brm), see [1]. From both theoretical and practical point of view, of interest is the calculation of the probability of multiple simultaneous failures in a given time horizon. The main findings of this contribution concern the approximation of the probability that at least $k$ out of $d$ components of Brm fail simultaneously. We derive both sharp bounds and asymptotic approximations of the probability of interest for the finite and the infinite time horizon. Our results extend previous findings of [2,3].

math.PR↗
arXiv2020

Parisian & Cumulative Parisian Ruin Probability for Two-Dimensional Brownian Risk Model

Parisian ruin probability in the classical Brownian risk model, unlike the standard ruin probability can not be explicitly calculated even in one-dimensional setup. Resorting on asymptotic theory, we derive in this contribution an asymptotic approximations of both Parisian and cumulative Parisian ruin probability and simultaneous ruin time for the two-dimensional Brownian risk model when the initial capital increases to infinity.

math.PR↗