Related papers: Generalized Mittag Leffler distributions arising a…
In this study, we establish a significant connection between certain subclasses of complex order univalent functions and the Mittag-Leffler-type Poisson distribution series. We provide criteria for these series to belong to the specific…
The aim of this paper is to develop a method for proving almost sure convergence in Gromov-Hausodorff-Prokhorov topology for a class of models of growing random graphs that generalises R\'emy's algorithm for binary trees. We describe the…
We consider a generalised d-dimensional model for asymptotically-scale-free geographical networks. Central to many networks of this kind, when considering their growth in time, is the attachment rule, i.e. the probability that a new node is…
Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs…
We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…
Every network scientist knows that preferential attachment combines with growth to produce networks with power-law in-degree distributions. How, then, is it possible for the network of American Physical Society journal collection citations…
Scale-free networks are quite popular nowadays since many systems are well represented by such structures. In order to study these systems, several models were proposed. However, most of them do not take into account the node-to-node…
We present an evolving network model in which the total numbers of nodes and edges are conserved, but in which edges are continuously rewired according to nonlinear preferential detachment and reattachment. Assuming power-law kernels with…
In this paper we give a new example of duality between fragmentation and coagulation operators. Consider the space of partitions of mass (i.e., decreasing sequences of nonnegative real numbers whose sum is 1) and the two-parameter family of…
Mixture transition distribution time series models build high-order dependence through a weighted combination of first-order transition densities for each one of a specified number of lags. We present a framework to construct stationary…
We obtain some approximation results for the weights appearing in the exchangeable partition probability function identifying Gibbs partition models of parameter $\alpha \in (0,1)$, as introduced in Gnedin and Pitman (2006). We rely on…
Preferential attachment networks are a type of random network where new nodes are connected to existing ones at random, and are more likely to connect to those that already have many connections. We investigate further a family of models…
Preferential attachment is widely used to model power-law behavior of degree distributions in both directed and undirected networks. Practical analyses on the tail exponent of the power-law degree distribution use the Hill estimator as one…
This paper explores various distributional aspects of random variables defined as the ratio of two independent positive random variables where one variable has an $\alpha$-stable law, for $0<\alpha<1$, and the other variable has the law…
We describe the distribution of frequencies ordered by sample values in a random sample of size $n$ from the two parameter GEM$(\alpha,\theta)$ random discrete distribution on the positive integers. These frequencies are a…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
We study the influence of the seed graph in the preferential attachment model, focusing on the case of trees. We first show that the seed has no effect from a weak local limit point of view. On the other hand, we conjecture that different…
This work deals with the estimation of parameters of Mittag-Leffler (ML($\alpha, \sigma$)) distribution. We estimate the parameters of ML($\alpha, \sigma$) using empirical Laplace transform method. The simulation study indicates that the…
We define a class of growing networks in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favoring short distances and high degrees. The competition of preferential attachment and…
We consider preferential attachment random graphs which may be obtained as follows: It starts with a single node. If a new node appears, it is linked by an edge to one or more existing node(s) with a probability proportional to function of…