English
Related papers

Related papers: Peaks over Threshold in Scale-Free Random Graphs

200 papers

For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…

Probability · Mathematics 2021-09-16 Tyler Helmuth , Matthew Jenssen , Will Perkins

We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…

Probability · Mathematics 2020-04-03 Srikanth K. Iyer , Sanjoy Kr. Jhawar

We describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…

Probability · Mathematics 2025-03-27 Loïc Gassmann

We provide large deviations estimates for the upper tail of the number of triangles in scale-free inhomogeneous random graphs where the degrees have power law tails with index $-\alpha, \alpha \in (1,2)$. We show that upper tail…

Probability · Mathematics 2024-03-25 Clara Stegehuis , Bert Zwart

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

Probability · Mathematics 2007-05-23 K. B. Athreya , A. P. Ghosh , S. Sethuraman

An important question in statistical network analysis is how to estimate models of discrete and dependent network data with intractable likelihood functions, without sacrificing computational scalability and statistical guarantees. We…

Statistics Theory · Mathematics 2026-03-06 Jonathan R. Stewart , Michael Schweinberger

We consider random rectangles in $\mathbb{R}^2$ that are distributed according to a Poisson random measure, i.e., independently and uniformly scattered in the plane. The distributions of the length and the width of the rectangles are…

Probability · Mathematics 2018-06-29 Frank Aurzada , Sebastian Schwinn

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…

Probability · Mathematics 2021-08-02 Guillaume Conchon--Kerjan , Christina Goldschmidt

We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the…

Probability · Mathematics 2007-05-23 Norio Konno , Naoki Masuda , Rahul Roy , Anish Sarkar

We introduce a dynamic random hypergraph model constructed from a bipartite graph. In this model, both vertex sets of the bipartite graph are generated by marked Poisson point processes. Vertices of both vertex sets are equipped with marks…

Probability · Mathematics 2025-07-23 Christian Hirsch , Benedikt Jahnel , Péter Juhász

We study concentration properties of vertex degrees of $n$-dimensional Erdos-R\'enyi random graphs with the edge probability $\rho/n$ by means of high moments of these random variables in the limit when $n$ and $\rho$ tend to infinity.…

Probability · Mathematics 2020-07-23 O. Khorunzhiy

Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…

Probability · Mathematics 2020-09-09 Cécile Mailler , Peter Mörters , Anna Senkevich

We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largest eigenvalues of the adjacency matrix and its…

Probability · Mathematics 2017-04-11 Florent Benaych-Georges , Charles Bordenave , Antti Knowles

The Peaks-Over Threshold is a fundamental method in the estimation of rare events such as small exceedance probabilities, extreme quantiles and return periods. The main problem with the Peaks-Over Threshold method relates to the selection…

Methodology · Statistics 2018-12-11 Richard Minkah , Tertius de Wet

We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…

Probability · Mathematics 2024-12-10 Benedikt Jahnel , Lukas Lüchtrath

The classical modeling of spatial extremes relies on asymptotic models (i.e., max-stable processes or $r$-Pareto processes) for block maxima or peaks over high thresholds, respectively. However, at finite levels, empirical evidence often…

Methodology · Statistics 2020-09-15 Raphaël Huser , Jennifer L. Wadsworth

We study the asymptotic nature of geometric structures formed from a point cloud of observations of (generally heavy tailed) distributions in a Euclidean space of dimension greater than one. A typical example is given by the Betti numbers…

Probability · Mathematics 2016-01-11 Takashi Owada , Robert J. Adler

This work is motivated by the analysis of the extremal behavior of buoy and satellite data describing wave conditions in the North Atlantic Ocean. The available data sets consist of time series of significant wave height (Hs) with irregular…

Applications · Statistics 2018-10-11 Nicolas Raillard , Pierre Ailliot , Jianfeng Yao

We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…

Probability · Mathematics 2021-07-12 Souvik Dhara , Remco van der Hofstad

In this work, we study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on a hyperbolic space and any two of them are joined by an edge with probability that depends on their hyperbolic…

Combinatorics · Mathematics 2012-05-15 Nikolaos Fountoulakis