Related papers: Grid method for divergence of averages
For a graph $G$ and $p\in [0,1]$, let $G_p$ arise from $G$ by deleting every edge mutually independently with probability $1-p$. The random graph model $(K_n)_p$ is certainly the most investigated random graph model and also known as the…
We study time series concerning rare events. The occurrence of a rare event is depicted as a jump of constant intensity always occurring in the same direction, thereby generating an asymmetric diffusion process. We consider the case where…
We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function…
We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…
Let B be a p-uniformly convex Banach space, with p >= 2. Let T be a linear operator on B, and let A_n x denote the ergodic average (1 / n) sum_{i< n} T^n x. We prove the following variational inequality in the case where T is power bounded…
An edge stream is a common form of presentation of dynamic networks. It can evolve with time, with new types of nodes or edges being continuously added. Existing methods for anomaly detection rely on edge occurrence counts or compare…
Stochastic gradient algorithm is a key ingredient of many machine learning methods, particularly appropriate for large-scale learning.However, a major caveat of large data is their incompleteness.We propose an averaged stochastic gradient…
Detecting Out-of-distribution (OOD) inputs have been a critical issue for neural networks in the open world. However, the unstable behavior of OOD detection along the optimization trajectory during training has not been explored clearly. In…
We study the evolution of fast blackout cascades in the model of the Polish (transmission) power grid (2700 nodes and 3504 transmission lines). The cascade is initiated by a sufficiently severe initial contingency tripping. It propagates…
Recently, there has been growing interest in developing optimization methods for solving large-scale machine learning problems. Most of these problems boil down to the problem of minimizing an average of a finite set of smooth and strongly…
Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…
Log-normal continuous random cascades form a class of multifractal processes that has already been successfully used in various fields. Several statistical issues related to this model are studied. We first make a quick but extensive review…
The electric power system is one of the cornerstones of modern society. One of its most serious malfunctions is the blackout, a catastrophic event that may disrupt a substantial portion of the system, playing havoc to human life and causing…
Given a positive integer $N$ and real number $\alpha\in [0, 1]$, let $m(\alpha,N)$ denote the minimum, over all sets $A\subset \mathbb{Z}/N\mathbb{Z}$ of size at least $\alpha N$, of the normalized count of 3-term arithmetic progressions…
We study the distribution of the occurrence of rare patterns in sufficiently mixing Gibbs random fields on the lattice $\mathbb{Z}^d$, $d\geq 2$. A typical example is the high temperature Ising model. This distribution is shown to converge…
Various important and useful quantities or measures that characterize the topological network structure are usually investigated for a network, then they are averaged over the samples. In this paper, we propose an explicit representation by…
We introduce three forms of generalized contraction (GC). Roughly speaking, these are motivated by allowing contraction to take place after small transients in time and/or amplitude. Indeed, contraction is usually used to prove asymptotic…
A fundamental problem in the analysis of network data is the detection of network communities, groups of densely interconnected nodes, which may be overlapping or disjoint. Here we describe a method for finding overlapping communities based…
We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…
This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…