Related papers: Non-existence probabilities and lower tails in the…
There remain theoretical gaps in deep neural network estimators for the nonparametric Cox proportional hazards model. In particular, it is unclear how gradient-based optimization error propagates to population risk under partial likelihood,…
We develop an asymptotic theory for extremes in decomposable graphical models by presenting results applicable to a range of extremal dependence types. Specifically, we investigate the weak limit of the distribution of suitably normalised…
Extreme value theory offers a statistical framework for quantifying the risk of rare events, with the generalized Pareto (GP) distribution providing the canonical limit model for univariate threshold exceedances. In many applications,…
This article introduces a non-parametric information-theoretic approach to inference about the tail of a continuous or a discrete distribution. Leveraging a new concept named tail profile -- a set of information-theoretic quantities…
We study the lower tail large deviation problem for subgraph counts in a random graph. Let $X_H$ denote the number of copies of $H$ in an Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. We are interested in estimating the lower tail…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…
Consider a nonparametric regression model with one-sided errors and regression function in a general H\"older class. We estimate the regression function via minimization of the local integral of a polynomial approximation. We show uniform…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added,…
Belief propagation is known to perform extremely well in many practical statistical inference and learning problems using graphical models, even in the presence of multiple loops. The iterative use of belief propagation algorithm on loopy…
We consider the diffusion approximation of branching processes in random environment (BPREs). This diffusion approximation is similar to and mathematically more tractable than BPREs. We obtain the exact asymptotic behavior of the survival…
We investigate the nonparametric, composite hypothesis testing problem for arbitrary unknown distributions in the asymptotic regime where both the sample size and the number of hypotheses grow exponentially large. Such asymptotic analysis…
Given a sequence of $s$-uniform hypergraphs $\{H_n\}_{n \geq 1}$, denote by $T_p(H_n)$ the number of edges in the random induced hypergraph obtained by including every vertex in $H_n$ independently with probability $p \in (0, 1)$. Recent…
Branching processes in a random environment are natural generalisations of Galton-Watson processes. In this paper we analyse the asymptotic decay of the survival probability for a sequence of slightly supercritical branching processes in an…
We establish some asymptotic expansions for infinite weighted convolution of distributions having regular varying tails. Various applications to statistics and probability are developed.
We consider the tail distribution of the edge cover time of a specific non-Markov process, $\delta$ once-reinforced random walk, on finite connected graphs, whose transition probability is proportional to weights of edges. Here the weights…
We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random. These matrices have a one-to-one correspondence with the adjacency…
In a complete bipartite graph with vertex sets of cardinalities $n$ and $m$, assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as $n\rightarrow\infty$, with $m = \lceil…