相关论文: Extremes of the zero-average Gaussian Free Field o…

Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and…

Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…

Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…

Let $G$ be a graph of order $n$, and let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of $G$ respectively. Define the convex linear combinations $A_\alpha (G)$ of $A (G)$ and $D (G) $ by $$A_\alpha (G)=\alpha…

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…

We quantify the large deviations of Gaussian extreme value statistics on closed convex sets in d-dimensional Euclidean space. The asymptotics imply that the extreme value distribution exhibits a rate function that is a simple quadratic…

For each $n \ge 1$, let $\mathrm{d}^n=(d^{n}(i),1 \le i \le n)$ be a sequence of positive integers with even sum $\sum_{i=1}^n d^n(i) \ge 2n$. Let $(G_n,T_n,\Gamma_n)$ be uniformly distributed over the set of simple graphs $G_n$ with degree…

We study the size and the lifetime distributions of scale-free random branching tree in which $k$ branches are generated from a node at each time step with probability $q_k\sim k^{-\gamma}$. In particular, we focus on finite-size trees in a…

We consider the zero-average Gaussian free field on a certain class of finite $d$-regular graphs for fixed $d\ge 3$. This class includes $d$-regular expanders of large girth and typical realisations of random $d$-regular graphs. We show…

This work aims to extend the existing results on the Hausdorff dimension of the classical thick point sets of a Gaussian free field (GFF) to a more general class of exceptional sets. We adopt the circle or sphere averaging regularization to…

We make use of the empirical process theory to approximate the adapted Hill estimator, for censored data, in terms of Gaussian processes. Then, we derive its asymptotic normality, only under the usual second-order condition of regular…

For $\{X(t), t \in G_\delta\}$ a centered Gaussian process with stationary increments and a.s. sample paths on a discrete grid $G_\delta=\{0,\delta,2\delta, ...\}$, where $\delta>0$, we investigate the stationary reflected process…

Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…

In this paper, we study the critical level-set of Gaussian free field (GFF) on the metric graph $\widetilde{\mathbb{Z}}^d,d>6$. We prove that the one-arm probability (i.e. the probability of the event that the origin is connected to the…

We study the level lines of a Gaussian free field in a planar domain with general boundary data $F$. We show that the level lines exist as continuous curves under the assumption that $F$ is regulated (i.e., admits left and right limits at…

In this work, we deal with extreme value theory in the context of continued fractions using techniques from probability theory, ergodic theory and real analysis. We give an upper bound for the rate of convergence in the Doeblin-Iosifescu…

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…

In many biological, agricultural, military activity problems and in some quality control problems, it is almost impossible to have a fixed sample size, because some observations are always lost for various reasons. Therefore, the sample…

We use point processes theory to describe the asymptotic distribution of all upper order statistics for observations collected at renewal times. As a corollary, we obtain limiting theorems for corresponding extremal processes.