Related papers: From heavy-tailed Boolean models to scale-free Gil…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
In this paper we provide general conditions on a one parameter family of random infinite subsets of Z^d to contain a unique infinite connected component for which the chemical distances are comparable to the Euclidean distances, focusing…
The size of the giant component in the configuration model, measured by the asymptotic fraction of vertices in the component, is given by a well-known expression involving the generating function of the degree distribution. In this note, we…
In this paper, we investigate and develop a new approach to the numerical analysis and characterization of random fluctuations with heavy-tailed probability distribution function (PDF), such as turbulent heat flow and solar flare…
We model power grids as graphs with heavy-tailed sinks, which represent demand from cities, and study cascading failures on such graphs. Our analysis links the scale-free nature of blackout sizes to the scale-free nature of city sizes,…
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…
In this paper, we study the level-set of the zero-average Gaussian Free Field on a uniform random $d$-regular graph above an arbitrary level $h\in (-\infty, h_{\star})$, where $h_{\star}$ is the level-set percolation threshold of the GFF on…
Although the ``scale-free'' literature is large and growing, it gives neither a precise definition of scale-free graphs nor rigorous proofs of many of their claimed properties. In fact, it is easily shown that the existing theory has many…
We obtain a number of new general properties, related to the closedness of the class of long-tailed distributions under convolutions, that are of interest themselves and may be applied in many models that deal with "plus" and/or "max"…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
We consider a two-node fluid network with batch arrivals of random size having a heavy-tailed distribution. We are interested in the tail asymptotics for the stationary distribution of a two-dimensional queue-length process. The tail…
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes…
We develop a statistical mechanics approach for random networks with uncorrelated vertices. We construct equilibrium statistical ensembles of such networks and obtain their partition functions and main characteristics. We find simple…
In this paper we are concerned with the analysis of heavy-tailed data when a portion of the extreme values is unavailable. This research was motivated by an analysis of the degree distributions in a large social network. The degree…
Based on suitable left-truncated or censored data, two flexible classes of $M$-estimations of Weibull tail coefficient are proposed with two additional parameters bounding the impact of extreme contamination. Asymptotic normality with…
The paper focuses on a class of light-tailed multivariate probability distributions. These are obtained via a transformation of the margins from a heavy-tailed original distribution. This class was introduced in Balkema et al. (J.…
We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…
We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos-Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is…