In this paper we study random graphs with independent and identically distributed degrees of which the tail of the distribution function is regularly varying with exponent $τ\in (2,3)$.
The number of edges between two arbitrary nodes, also called the graph distance or hopcount, in a graph with $N$ nodes is investigated when $N\to \infty$. When $τ\in (2,3)$, this graph distance grows like $2\frac{\log\log N}{|\log(τ-2)|}$. In different papers, the cases $τ>3$ and $τ\in (1,2)$ have been studied. We also study the fluctuations around these asymptotic means, and describe their distributions. The results presented here improve upon results of Reittu and Norros, who prove an upper bound only.
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of the weight distribution, we use an example-based approach and show that rather different behaviors are possible. When the weights are a.s. larger than a constant, the weight and number of edges in the graph grow proportionally to loglog(n), as for the graph distances. On the other hand, when the continuous-time branching process describing the first passage…
Concentration inequalities are obtained on Poisson space, for random functionals with finite or infinite variance. In particular, dimension free tail estimates and exponential integrability results are given for the Euclidean norm of vectors of independent functionals. In the finite variance case these results are applied to infinitely divisible random variables such as quadratic Wiener functionals, including Lévy's stochastic area and the square norm of Brownian paths. In the infinite variance case, various tail estimates such as stable ones are also presented.
The so-called "supOU" processes, namely the superpositions of Ornstein-Uhlenbeck type processes are stationary processes for which one can specify separately the marginal distribution and the dependence structure. They can have finite or infinite variance. We study the limit behavior of integrated infinite variance supOU processes adequately normalized. Depending on the specific circumstances, the limit can be fractional Brownian motion but it can also be a process with infinite variance, a Lévy stable process with independent increments or a stable process with dependent increments. We show t…
We observe the Galton-Watson Branching Processes. Limit properties of transition functions and their convergence to invariant measures are investigated.
We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent tau in (2,3). In this model two colors spread with a fixed but not necessarily equal speed on the unweighted random graph. We show that if the speeds are not equal, then the faster color paints almost all vertices, while the slower color can paint only a random subpolynomial fraction of the vertices. We investigate the case when the speeds are equal and typical distances in a follow-up paper.
Some probabilistic aspects of the number variance statistic are investigated. Infinite systems of independent Brownian motions and symmetric alpha-stable processes are used to construct new examples of processes which exhibit both divergent and saturating number variance behaviour. We derive a general expression for the number variance for the spatial particle configurations arising from these systems and this enables us to deduce various limiting distribution results for the fluctuations of the associated counting functions. In particular, knowledge of the number variance allows us to introdu…
SupOU processes are superpositions of Ornstein-Uhlenbeck type processes with a random intensity parameter. They are stationary processes whose marginal distribution and dependence structure can be specified independently. Integrated supOU processes have then stationary increments and satisfy central and non-central limit theorems. Their moments, however, can display an unusual behavior known as "intermittency". We show here that intermittency can also appear when the processes have a heavy tailed marginal distribution and, in particular, an infinite variance.
Consider bond percolation on the square lattice. Let ${\cal C}$ be the incipient infinite cluster with the incipient measure $ν$. If a one-arm path exponent exists and equals $5/48$, it is well known that $E_ν|{\cal C}\cup [-n,n]^2| = n^{ 91/48+o(1)}$. In this paper, we focus on the variance of $|{\cal C}\cup [-n,n]^2|$ and show that $σ^2_ν(|{\cal C}\cup [-n,n]^2|)= n^{91/24+o(1)}$.
We consider the standard model of i.i.d. bond percolation on $\mathbb Z^d$ of parameter $p$. When $p>p_c$, there exists almost surely a unique infinite cluster $\mathcal C_p$. Using the recent techniques of Cerf and Dembin, we prove that the variance of the graph distance in $\mathcal C_p$ between two points of $\mathcal C_p$ is sublinear. The main result extends the works of Benjamini, Kalai and Schramm, Benaim and Rossignol and Damron, Hanson and Sosoe for the study of the variance of passage times in first passage percolation without moment conditions on the edge-weight distribution.
We investigate an application of slowly varying functions (in sense of Karamata) in the theory of Markov branching process. We treat the critical case so that the infinitesimal generating function of the process has the infinite second moment, but it regularly varies with the remainder. We improve the Basic Lemma of the theory of critical Markov branching process and refine known limit results.
In the paper we continue to investigate measures of dependence for random variables with infinite variance. The asymptotic of spectral covariance $ρ(X_{(0,0)}, X_{(k_1,k_2)})$ for linear random field $X_{k,l}=\sum_{i,j=0}^\infty c_{i,j}ε_{k-i, l-j}, \ (k, l)\in \mathbb{Z}^2,$ with special form of filter $\{c_{i,j}\}$ and with innovations $\{ ε_{i, j}\}$ having infinite second moment is investigated. Different behavior of $ρ(X_{(0,0)}, X_{(k_1,k_2)})$ is obtained in the cases $n\to \infty, \ m\to \infty$ and $n\to \infty, \ m\to -\infty$, the latter case being much more complicated.
We consider functionals of long-range dependent Gaussian sequences with infinite variance and obtain nonstandard limit theorems. When the long-range dependence is strong enough, the limit is a Hermite process, while for weaker long-range dependence, the limit is $α$-stable Lévy motion. For the critical value of the long-range dependence parameter, the limit is a sum of a Hermite process and $α$-stable Lévy motion.
We consider a conditionally Poissonian random graph model where the mean degrees, `capacities', follow a power-tailed distribution with finite mean and infinite variance. Such a graph of size $N$ has a giant component which is super-small in the sense that the typical distance between vertices is of the order of $\log\log N$. The shortest paths travel through a core consisting of nodes with high mean degrees. In this paper we derive upper bounds of the typical distance when an upper part of the core is removed, including the case that the whole core is removed.
We consider a measure of dependence for symmetric $α$-stable random vectors, which was introduced by the author in 1976. We demonstrate that this measure of dependence can be extended for much more broad class of random vectors (up to regularly varying vectors in separable Banach spaces). This measure is applied for linear random processes and fields with heavy-tailed innovations, for some stable processes, and these applications show that this dependence measure, named as $α$-covariance is a good substitute for the usual covariance. Also we discuss a problem of defining long, short, and negat…
Subcritical catalytic branching random walk on d-dimensional lattice is studied. New theorems concerning the asymptotic behavior of distributions of local particles numbers are established. To prove the results different approaches are used including the connection between fractional moments of random variables and fractional derivatives of their Laplace transforms. In the previous papers on this subject only supercritical and critical regimes were investigated assuming finiteness of the first moment of offspring number and finiteness of the variance of offspring number, respectively. In the p…
We consider a particle system with weights and the scaling limits derived from its occupation time. We let the particles perform independent recurrent Lévy motions and we assume that their initial positions and weights are given by a Poisson point process. In the limit we obtain a number of recently discovered stationary stable self-similar processes recently studied in [SAM1] and [SAM2]. We also observe very different limit processes depending on whether the function, whose occupation time is considered, integrates to zero or not.
In this paper we study a random graph with $N$ nodes, where node $j$ has degree $D_j$ and $\{D_j\}_{j=1}^N$ are i.i.d. with $\prob(D_j\leq x)=F(x)$. We assume that $1-F(x)\leq c x^{-τ+1}$ for some $τ>3$ and some constant $c>0$. This graph model is a variant of the so-called configuration model, and includes heavy tail degrees with finite variance. The minimal number of edges between two arbitrary connected nodes, also known as the graph distance or the hopcount, is investigated when $N\to \infty$. We prove that the graph distance grows like $\log_νN$, when the base of the logarithm equals $ν=\…
This paper addresses the following classical question: giving a sequence of identically distributed random variables in the domain of attraction of a normal law, does the associated linear process satisfy the central limit theorem? We study the question for several classes of dependent random variables. For independent and identically distributed random variables we show that the central limit theorem for the linear process is equivalent to the fact that the variables are in the domain of attraction of a normal law, answering in this way an open problem in the literature. The study is also mot…
In this paper we consider the problem of a measure that allows us to describe the spatial and temporal dependence structure of multivariate time series with innovations having infinite variance. By using recent results obtained in the problem of temporal dependence structure of univariate stochastic processes, where the auto-codifference was used, we extend its idea and propose a cross-codifference measure for a general vector autoregressive model of order 1 (VAR(1)). Next, we derive an analytical results for VAR(1) model with Gaussian and sub-Gaussian innovations, that are characterized by fi…
We prove results for first-passage percolation on the configuration model with i.i.d. degrees having finite mean, infinite variance and i.i.d. weights with strictly positive support of the form Y=a+X, where a is a positive constant. We prove that the weight of the optimal path has tight fluctuations around the asymptotical mean of the graph-distance if and only if the following condition holds: the random variable X is such that the continuous-time branching process describing first-passage percolation exploration in the same graph with excess edge weight X has a positive probability to reach …
In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $α\in (1, 2)$ and obtain the asymptotic form of the distribution of the hitting time of the origin and that of the transition probability for the walk killed when it hits a finite set. The asymptotic forms obtained are valid uniformly in the natural domain of the space and time variables.
We study the impact on shape parameters of an underlying Bienaymé-Galton-Watson branching process (height, width and first hitting time), of having a non-spatial branching mechanism with infinite variance. Aiming at providing a comparative study of the spread of an epidemics whose dynamics is given by the modulus of a branching Brownian motion (BBM) we then consider spatial branching processes in dimension d, not necessarily integer. The underlying branching mechanism is then either a binary branching model or one presenting infinite variance. In particular we evaluate the chance p(x) of being…
We consider a Galton-Watson process $\mathbf{Z}% (n)=(Z_{1}(n),Z_{2}(n))$ with two types of particles. Particles of type 2 may produce offspring of both types while particles of type 1 may produce particles of their own type only. Let $Z_{i}(m,n)$ be the number of particles of type $i$ at time $m<n$ having offspring at time $n$. Assuming that the process is critical and that the variance of the offspring distribution may be infinite we describe the asymptotic behavior, as $m,n\rightarrow \infty $ of the law of $\mathbf{Z}(m,n)=(Z_1(m,n),Z_2(m,n))$ given $\mathbf{Z}(n)\neq \mathbf{0}$. We find …
In this work, we study asymptotics of multitype Galton-Watson trees with finitely many types. We consider critical and irreducible offspring distributions such that they belong to the domain of attraction of a stable law, where the stability indices may differ. We show that after a proper rescaling, their corresponding height process converges to the continuous-time height process associated with a strictly stable spectrally positive Lévy process. This gives an analogue of a result obtained by Miermont in the case of multitype Galton-Watson trees with finite covariance matrices of the offsprin…
We study the $k$-largest eigenvalues of heavy-tailed sample covariance matrices of the form $\bX\bX^\T$ in an asymptotic framework, where the dimension of the data and the sample size tend to infinity. To this end, we assume that the rows of $\bX$ are given by independent copies of some stationary process with regularly varying marginals with index $α\in(0,2)$ satisfying large deviation and mixing conditions. We apply these general results to stochastic volatility and GARCH processes.
In this paper we study the distribution of a product of two continuous random variables. We derive formulas for the probability density functions and moments of the products of the Gaussian, log-normal, Student's t and Pareto random variables. In all cases we analyze separately independent as well as correlated random variables. Based on the theoretical results we use the general maximum likelihood approach for the estimation of the parameters of the product random variables and apply the methodology for a real data case study. We analyze a distribution of the transaction values, being a produ…
In this paper, we first introduce the explicit analytical formulas for the expected values of the Gutman and Schultz indices for a random cyclooctane chain COCn. Meanwhile, the explicit formulas of the variances of the Gutman and Schultz indices for a random cyclooctane chain are determined and we prove these two indices are asymptotically subject to normal distribution. Furthermore, we are surprised to find the variances of Kf*(COCn) and Kf+(COCn) for a random cyclooctane chain based on the known results of others' paper and they are asymptotically subject to normal distribution.
We establish limit theorems for the fluctuations of the rescaled occupation time of a $(d,α,β)$-branching particle system. It consists of particles moving according to a symmetric $α$-stable motion in $\mathbb{R}^d$. The branching law is in the domain of attraction of a (1+$β$)-stable law and the initial condition is an equilibrium random measure for the system (defined below). In the paper we treat separately the cases of intermediate $α/β<d<(1+β)α/β$, critical $d=(1+β)α/β$ and large $d>(1+β)α/β$ dimensions. In the most interesting case of intermediate dimensions we obtain a version of a frac…
In this paper, we analyze the behavior of the global clustering coefficient in scale free graphs. We are especially interested in the case of degree distribution with an infinite variance, since such degree distribution is usually observed in real-world networks of diverse nature. There are two common definitions of the clustering coefficient of a graph: global clustering and average local clustering. It is widely believed that in real networks both clustering coefficients tend to some positive constant as the networks grow. There are several models for which the average local clustering coeff…
The aim of this paper is to provide conditions which ensure that the affinely transformed partial sums of a strictly stationary process converge in distribution to an infinite variance stable distribution. Conditions for this convergence to hold are known in the literature. However, most of these results are qualitative in the sense that the parameters of the limit distribution are expressed in terms of some limiting point process. In this paper we will be able to determine the parameters of the limiting stable distribution in terms of some tail characteristics of the underlying stationary seq…
We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we derive an asymptotic estimate of $a(x)$ and thereby a criterion for $a(x)$ to be bounded on a half-line. The application is also made to estimate some hitting probabilities as well as to derive asymptotic behaviour for large times of the walk conditioned never to visit the origin.
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree random graph and the generalized random graph (including the classical Erdos-Renyi graph). In the paper we assign to each node a deterministic capacity and the probability that there exists an edge between a pair of nodes is equal to a function of the product of the capacities of the pair divided by the total capacity of all the nodes. We consider capacities …
The paper examines the Fractional Fourier Transform (FRFT) based technique as a tool for obtaining probability density function and its derivatives, and mainly for fitting stochastic model with the fundamental probabilistic relationships of infinite divisibility. The probability density functions are computed and the distributional proprieties such as leptokurtosis, peakedness, and asymmetry are reviewed for Variance-Gamma (VG) model and Compound Poisson with Normal Compounding model. The first and second derivatives of probability density function of the VG model are also computed in order to…
We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent $τ\in (2,3)$. In this model two colors spread with a fixed and equal speed on the unweighted random graph. We analyse how many vertices the two colors paint eventually. We show that coexistence sensitively depends on the initial local neighborhoods of the source vertices: if these neighborhoods are `dissimilar enough', then there is no coexistence, and the `loser' color paints a polynomial fraction of the vertices with a rando…
Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process with innovations in the domain of attraction of an $α$-stable law $(0<α<2)$. Assume that the linear process $X$ has a bounded probability density function $f(x)$. Then, under certain conditions, we consider the estimation of the quadratic functional $\int_{\mathbb{R}} f^2(x) \,dx$ by using the kernel estimator \[ T_n(h_n)=\frac{2}{n(n-1)h_n}\sum_{1\leq j<i\leq n}K\left(\frac{X_i-X_j}{h_n}\right). \] The simulation study for long memory linear processes with symmetric $α$-stable innovations is also given.
In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree distribution. Moreover, the observed degree distribution usually has an infinite variance. Therefore, we are especially interested in such degree distributions. In addition, we analyze the clustering coefficient for both weighted and unweighted graphs. There are two well-known definitions of the clustering coefficient of a graph: the global and the average local clustering coefficients. There are several models prop…
Let $S=(S_n)$ be an oscillatory random walk on the integer lattice $\mathbb{Z}$ with i.i.d. increments. Let $V_{\rm d}(x)$ be the renewal function of the strictly descending ladder height process for $S$. We obtain several sufficient conditions -- given in terms of the distribution function of the increment $S_1-S_0$ -- so that as $R\to\infty$ $$ (*) \quad P [ S\; \mbox{leaves $[0,R]$ on its upper side}\, |\, S_0=x] \, \sim\, V_{\rm d}(x)/V_{\rm d}(R)$$ uniformly for $0\leq x\leq R$. When $S$ is attracted to a stable process of index $0<α\leq 2$ and there exists $ρ= \lim P[S_n>0]$, the suffici…
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index $α\in(1,2]$. In particular, we are able to prove a quenched version of the result that the spectral dimension of the random walk is $2α/(2α-1)$. Furthermore, we demonstrate that when $α\in(1,2)$ there are logarithmic fluctuations in the quenched transition density of the simple random walk, which contrasts with the log-logarithmic fluctuations seen when $α=2$. In the course…
The infinite servers queue with Poisson arrivals state transient probabilities, considering the time origin at the beginning of a busy period, mean and variance monotony as time functions is studied. These studies, for which results it is determinant the hazard rate function service time length, induce the consideration of two differential equations, one related with the mean monotony study and another with the variance monotony study, which solutions lead to some particular service time distributions, for which those parameters present specific behaviors as time functions.
We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph in that an uninfected vertex becomes type 1 (2) infected at rate $λ_1$ ($λ_2$) times the number of nearest neighbors of type 1 (2). Assuming (essentially) that the degree of a randomly chosen vertex has finite second moment, we show that if $λ_1=λ_2$, then the fraction of vertices that are ultimately infected by type 1 converges to a continuous random variabl…
Let $S_n =X_1+\cdots +X_n$ be an irreducible random walk (r.w.) on the one dimensional integer lattice with zero mean, infinite variance and i.i.d. increments $X_n$. We obtain an upper and lower bounds of the potential function, $a(x)$, of $S_n$ in the form $a(x)\asymp x/m(x)$ under a reasonable condition on the distribution of $X_n$; we especially show that as $x\to\infty$ $$a(x) \asymp \frac{x}{m_-(x)} \quad\mbox{and}\quad \frac{a(-x)}{a(x)} \to 0 \quad\;\;\mbox{if}\quad \lim_{x\to +\infty} \frac{m_+(x)}{m_-(x)} =0,$$ where $m_\pm(x) = \int_0^xdy\int_y^\infty P[\pm X_1>u]du$ and $m=m_++m_-$.…
We study properties of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution is in the domain of attraction of a stable distribution with index $α\in (1,2]$. Here the harmonic measure refers to the hitting distribution of height $n$ by simple random walk on the critical Galton-Watson tree conditioned on non-extinction at generation $n$. For a ball of radius $n$ centered at the root, we prove that, although the size of the boundary is roughly of order $n^{\frac{1}{α-1}}$, most of the harmonic measure is supported on a boundary subset of size approximat…
We study the typical behavior of the harmonic measure in large critical Galton-Watson trees whose offspring distribution is in the domain of attraction of a stable distribution with index $α\in (1,2]$. Let $μ_n$ denote the hitting distribution of height $n$ by simple random walk on the critical Galton-Watson tree conditioned on non-extinction at generation $n$. We extend the results of arxiv:1502.05584 to prove that, with high probability, the mass of the harmonic measure $μ_n$ carried by a random vertex uniformly chosen from height $n$ is approximately equal to $n^{-λ_α}$, where the constant …
Consider compound Poisson processes with negative drift and no negative jumps, which converge to some spectrally positive Lévy process with non-zero Lévy measure. In this paper we study the asymptotic behavior of the local time process, in the spatial variable, of these processes killed at two different random times: either at the time of the first visit of the Lévy process to 0, in which case we prove results at the excursion level under suitable conditionings; or at the time when the local time at 0 exceeds some fixed level. We prove that finite-dimensional distributions converge under gener…
The average nearest neighbor degree (ANND) of a node of degree $k$ is widely used to measure dependencies between degrees of neighbor nodes in a network. We formally analyze ANND in undirected random graphs when the graph size tends to infinity. The limiting behavior of ANND depends on the variance of the degree distribution. When the variance is finite, the ANND has a deterministic limit. When the variance is infinite, the ANND scales with the size of the graph, and we prove a corresponding central limit theorem in the configuration model (CM, a network with random connections). As ANND prove…
We prove limit theorems for rescaled occupation time fluctuations of a (d,alpha,beta)-branching particle system (particles moving in R^d according to a spherically symmetric alpha-stable Levy process, (1+beta)-branching, 0<beta<1, uniform Poisson initial state), in the cases of critical dimension, d=alpha(1+beta)/beta, and large dimensions, d>alpha(1+beta)/beta. The fluctuation processes are continuous but their limits are stable processes with independent increments, which have jumps. The convergence is in the sense of finite-dimensional distributions, and also of space-time random fields (ti…
