Related papers: Local Large deviation: A McMillian Theorem for Col…

We initiate an investigation of node differential privacy for graphs in the local model of private data analysis. In our model, dubbed LNDP*, each node sees its own edge list and releases the output of a local randomizer on this input.…

Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the…

We recover the Donsker-Varadhan large deviations principle (LDP) for the empirical measure of a continuous time Markov chain on a countable (finite or infinite) state space from the joint LDP for the empirical measure and the empirical flow…

We present the analysis of the topological graph descriptor Local Degree Profile (LDP), which forms a widely used structural baseline for graph classification. Our study focuses on model evaluation in the context of the recently developed…

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

We investigate the behavior of the empirical neighbourhood distribution of marked graphs in the framework of local weak convergence. We establish a large deviation principle for such families of empirical measures. The proof builds on…

We prove a large deviation principle for the greedy exploration of configuration models, building on a time-discretized version of the method proposed by Bermolen et al. and Brightwell et al. for jointly constructing a random graph from a…

In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…

Let $\lambda_{1}(G)$ and $\mu_{1}(G)$ denote the spectral radius and the Laplacian spectral radius of a graph $G$, respectively. Li in [Electronic J. Linear Algebra 34 (2018) 389-392] proved sharp upper bounds of $\lambda_{1}(G)$ based on…

We study a singular elliptic problem driven by a mixed local-nonlocal operator of the form \begin{equation*} \begin{aligned} -\Delta_p u + (-\Delta_q)^s u &= \frac{\lambda}{u^{\delta}} + u^r \text{ in } \Omega\newline u > 0 \text{ in }…

The empirical mean of $n$ independent and identically distributed (i.i.d.) random variables $(X_1,\dots,X_n)$ can be viewed as a suitably normalized scalar projection of the $n$-dimensional random vector $X^{(n)}\doteq(X_1,\dots,X_n)$ in…

Consider the projection of an $n$-dimensional random vector onto a random $k_n$-dimensional basis, $k_n \leq n$, drawn uniformly from the Haar measure on the Stiefel manifold of orthonormal $k_n$-frames in $\mathbb{R}^n$, in three different…

Moderate deviation principles (MDPs) for random walks on covering graphs with groups of polynomial volume growth are discussed in a geometric point of view. They deal with any intermediate spatial scalings between those of laws of large…

We provide a short-time large deviation principle (LDP) for stochastic volatility models, where the volatility is expressed as a function of a Volterra process. This LDP does not require strict self-similarity assumptions on the Volterra…

We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada. A main result in this paper is that the spectral density function of DMLs…

We extend the recent spectral approach for quenched limit theorems developed for piecewise expanding dynamics under general random driving [DrFrGTVa18] to quenched random piecewise hyperbolic dynamics including some classes of billiards.…

Letting~$N=\left\{N(t), t\geq0\right\}$ be a standard Poisson process, Stroock~ \cite{Stroock-1981} constructed a family of continuous processes by $$\Theta_{\epsilon}(t)=\int_0^t\theta_{\epsilon}(r)dr, \ \ \ \ \ 0 \le t \le 1,$$ where…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…

In this paper we study two natural models of \textit{random temporal} graphs. In the first, the \textit{continuous} model, each edge $e$ is assigned $l_e$ labels, each drawn uniformly at random from $(0,1]$, where the numbers $l_e$ are…

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…