Related papers: General hypergeometric distribution: A basic stati…
The distribution of waiting times until the occurrence of a critical event is a crucial statistical problem across several disciplines in Science. In this work we present a statistical model in which a relevant quantity X accumulates until…
Extended geometric distribution is defined and its mixture is characterized by the property of having completely monotone probability sequence. Also, convolution equations and probability generating functions are used to characterize…
This paper presents a new derivation of the Generalized Poisson distribution. This distribution provides a good fit to the evolved, counts-in-cells distribution measured in numerical simulations of hierarchical clustering from Poisson…
A novel method to obtain hierarchical and overlapping clusters from network data -i.e., a set of nodes endowed with pairwise dissimilarities- is presented. The introduced method is hierarchical in the sense that it outputs a nested…
For the universal hypothesis testing problem, where the goal is to decide between the known null hypothesis distribution and some other unknown distribution, Hoeffding proposed a universal test in the nineteen sixties. Hoeffding's universal…
We propose the Generalized Probabilistic U-Net, which extends the Probabilistic U-Net by allowing more general forms of the Gaussian distribution as the latent space distribution that can better approximate the uncertainty in the reference…
The $G$-expectation framework is a generalization of the classical probabilistic system motivated by Knightian uncertainty, where the $G$-normal plays a central role. However, from a statistical perspective, $G$-normal distributions look…
In this paper, we investigate the limiting behavior of a continuous-time counterpart of the Stochastic Gradient Descent (SGD) algorithm applied to two-layer overparameterized neural networks, as the number or neurons (ie, the size of the…
The \emph{generalized sorting problem} is a restricted version of standard comparison sorting where we wish to sort $n$ elements but only a subset of pairs are allowed to be compared. Formally, there is some known graph $G = (V, E)$ on the…
In this work we study the set size distribution estimation problem, where elements are randomly sampled from a collection of non-overlapping sets and we seek to recover the original set size distribution from the samples. This problem has…
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
An {\it overlap representation} of a graph $G$ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other. The {\it overlap number} $\ol(G)$ (introduced by Rosgen)…
The general limit distributions of the sum of random variables described by a finite matrix product ansatz are characterized. Using a mapping to a Hidden Markov Chain formalism, non-standard limit distributions are obtained, and related to…
Diffusion generative models (DMs) have achieved promising results in image and graph generation. However, real-world graphs, such as social networks, molecular graphs, and traffic graphs, generally share non-Euclidean topologies and hidden…
Generative Adversarial Networks (GANs) have achieved a great success in unsupervised learning. Despite its remarkable empirical performance, there are limited theoretical studies on the statistical properties of GANs. This paper provides…
Let $S=\Gamma\backslash \mathbb{H}$ be a hyperbolic surface of finite topological type, such that the Fuchsian group $\Gamma \le \operatorname{PSL}_2(\mathbb{R})$ is non-elementary, and consider any generating set $\mathfrak S$ of $\Gamma$.…
Graphs Neural Networks (GNNs) demonstrate high-performance on the link prediction (LP) task. However, these models often rely on all dataset samples being drawn from the same distribution. In addition, graph generative models (GGMs) show a…
Detection of a target with known spectral signature when this target may occupy only a fraction of the pixel is an important issue in hyperspectral imaging. We recently derived the generalized likelihood ratio test (GLRT) for such sub-pixel…
Normal and anomalous diffusion are ubiquitous in many complex systems [1] . Here, we define a time and space generalized diffusion equation (GDE), which uses fractional-time derivatives and transformed d-path Laplacian operators on…