English
Related papers

Related papers: A conditional compound Poisson process approach to…

200 papers

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r(\tfrac{i}{N},\tfrac{j}{N})$,…

Probability · Mathematics 2020-08-20 Arijit Chakrabarty , Rajat Subhra Hazra , Frank den Hollander , Matteo Sfragara

We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…

Probability · Mathematics 2024-04-04 Nicholas A. Cook , Amir Dembo

We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…

Probability · Mathematics 2022-10-06 Johannes Alt , Raphael Ducatez , Antti Knowles

We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…

Probability · Mathematics 2025-12-25 Magnus H. Haaland , Anđela Šarković

This paper deals with U-statistics of Poisson processes and multiple Wiener-It\^o integrals on the Poisson space. Via sharp bounds on the cumulants for both classes of random variables, moderate deviation principles, concentration…

Probability · Mathematics 2023-04-13 Matthias Schulte , Christoph Thaele

In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results…

Probability · Mathematics 2011-05-05 Bela Bollobas , Svante Janson , Oliver Riordan

We study the typical structure of a sparse Erd\H{o}s--R\'enyi random graph conditioned on the lower tail subgraph count event. We show that in certain regimes, a typical graph sampled from the conditional distribution resembles the entropy…

Combinatorics · Mathematics 2025-01-08 Byron Chin

In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by some causal structure. This corresponds to a family of…

Machine Learning · Computer Science 2014-08-12 Ricardo Silva , Robert B. Gramacy

In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by some causal structure. This corresponds to a family of…

Machine Learning · Computer Science 2010-03-15 Ricardo Silva , Robert B. Gramacy

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

Probability · Mathematics 2018-10-10 Alessandra Faggionato , Hlafo Alfie Mimun

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

Probability · Mathematics 2016-04-08 Charles Bordenave , Pietro Caputo

This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the one-dimensional setting, we derive closed-form expressions…

Probability · Mathematics 2020-07-14 Christian Hirsch , Sarat B. Moka , Thomas Taimre , Dirk P. Kroese

We consider random graphs $\mathcal{G}$ built on a homogeneous Poisson point process on $\mathbb{R}^d$, $d\geq 2$, with points $x$ marked by i.i.d. random variables $E_x$. Fixed a symmetric function $h(\cdot, \cdot)$, the vertexes of…

Probability · Mathematics 2021-02-25 Alessandra Faggionato , Hlafo Alfie Mimun

This paper derives normal approximation results for subgraph counts written as multiparameter stochastic integrals in a random-connection model based on a Poisson point process. By combinatorial arguments we express the cumulants of general…

Probability · Mathematics 2025-11-11 Qingwei Liu , Nicolas Privault

The theory of sparse stochastic processes offers a broad class of statistical models to study signals. In this framework, signals are represented as realizations of random processes that are solution of linear stochastic differential…

Probability · Mathematics 2017-02-17 Julien Fageot , Virginie Uhlmann , Michael Unser

We present a general construction for dependent random measures based on thinning Poisson processes on an augmented space. The framework is not restricted to dependent versions of a specific nonparametric model, but can be applied to all…

Machine Learning · Statistics 2012-11-21 Nicholas J. Foti , Joseph D. Futoma , Daniel N. Rockmore , Sinead Williamson

We present an algorithm to identify sparse dependence structure in continuous and non-Gaussian probability distributions, given a corresponding set of data. The conditional independence structure of an arbitrary distribution can be…

Machine Learning · Computer Science 2017-11-07 Rebecca E. Morrison , Ricardo Baptista , Youssef Marzouk

We prove a large deviation principle for the point process associated to $k$-element connected components in $\mathbb R^d$ with respect to the connectivity radii $r_n\to\infty$. The random points are generated from a homogeneous Poisson…

Probability · Mathematics 2022-10-19 Christian Hirsch , Takashi Owada

Research on Poisson regression analysis for dependent data has been developed rapidly in the last decade. One of difficult problems in a multivariate case is how to construct a cross-correlation structure and at the meantime make sure that…

Methodology · Statistics 2017-10-05 A'yunin Sofro , Jian Qing Shi , Chunzheng Cao

Consider the complete graph \(K_n\) on \(n\) vertices where each edge \(e\) is independently open with probability \(p_n(e)\) or closed otherwise. Here \(\frac{C-\alpha_n}{n} \leq p_n(e) \leq \frac{C+\alpha_n}{n}\) where \(C > 0\) is a…

Probability · Mathematics 2017-04-04 Ghurumuruhan Ganesan