Related papers: Long cycle of random permutations with polynomiall…

Each connected component of a mapping $\{1,2,...,n\}\rightarrow\{1,2,...,n\}$ contains a unique cycle. The largest such component can be studied probabilistically via either a delay differential equation or an inverse Laplace transform. The…

Asymptotic behavior (with respect to the number of trials) of symmetric generalizations of binomial distributions and their related entropies are studied through three examples. The first one derives from the q-exponential as a generating…

We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

This work deals with a system of interacting reinforced stochastic processes, where each process $X^j=(X_{n,j})_n$ is located at a vertex $j$ of a finite weighted direct graph, and it can be interpreted as the sequence of "actions" adopted…

We present analytical results for the distribution of the number of cycles in directed and undirected random 2-regular graphs (2-RRGs) consisting of $N$ nodes. In directed 2-RRGs each node has one inbound link and one outbound link, while…

In this paper, we investigated the effect on extreme of random replacing for a stationary sequence satisfying a type of long dependent condition and a local dependent condition, and derived the joint asymptotic distribution of maximum from…

In this paper, we study the asymptotic behaviors of the extreme of mixed skew-t distribution. We considered limits on distribution and density of maximum of mixed skew-t distribution under linear and power normalization, and further derived…

This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

We derive subexponential tail asymptotics for the distribution of the maximum of a compound renewal process with linear component and of a L\'evy process, both with negative drift, over random time horizon $\tau$ that does not depend on the…

The paper considers a continuous-time birth-death process where the jump rate has an asymptotically polynomial dependence on the process position. We obtain a rough exponential asymptotics for the probability of excursions of a re-scaled…

The skew-normal and related families are flexible and asymmetric parametric models suitable for modelling a diverse range of systems. We show that the multivariate maximum of a high-dimensional extended skew-normal random sample has…

It has been shown recently [10] that Cauchy transforms of orthogonal polynomials appear naturally in general correlation functions containing ratios of characteristic polynomials of random NxN Hermitian matrices. Our main goal is to…

We present a new proof of a fundamental result concerning cycles of random permutations which gives some intuition for the connection between Touchard polynomials and the Poisson distribution. We also introduce a rather novel permutation…

Let $X_{1},\ldots ,X_{n}$ be $n$ real-valued dependent random variables. With motivation from Mitra and Resnick (2009), we derive the tail asymptotic expansion for the weighted sum of order statistics $X_{1:n}\leq \cdots \leq X_{n:n}$ of…

I present here some results on the statistical behaviour of large random matrices in an ensemble where the probability distribution is not a function of the eigenvalues only. The perturbative expansion can be cast in a closed form and the…

We investigate the behavior of the length of the longest weakly increasing subsequences (weak LIS) of $n$-step random walks with nonzero integer increments $k = \pm 1, \pm 2, \dots$ given by a zero-mean, symmetric heavy tailed mass…

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…

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…