相关论文: Generalized Descents and Normality

We use a system of first-order partial differential equations that characterize the moment generating function of the $d$-variate standard normal distribution to construct a class of affine invariant tests for normality in any dimension. We…

We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…

We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…

We prove a version of a general transfer theorem for random sequences with independent random indexes in the double array limit setting under relaxed conditions. We also prove its partial inverse providing the necessary and sufficient…

Branching processes pervade many models in statistical physics. We investigate the survival probability of a Galton-Watson branching process after a finite number of generations. We reveal the finite-size scaling law of the survival…

We propose a definition of directional multivariate subexponential and convolution equivalent densities and find a useful characterization of these notions for a class of integrable and almost radial decreasing functions. We apply this…

The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…

We prove the Simons-Johnson theorem for the sums $S_n$ of $m$-dependent random variables, with exponential weights and limiting compound Poisson distribution $\CP(s,\lambda)$. More precisely, we give sufficient conditions for…

We introduce the following model for the evolution of a population. At every discrete time $j\geq 0$ exactly one individual is introduced in the population and is assigned a death probability $c_j$ sampled from $C$, a fixed probability…

We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…

We show that given $n$ normalized intervals on the unit circle, the numbers of visits of $d$ random rotations to these intervals have a joint limiting distribution as lengths of trajectories tend to infinity. If $d$ then tends to infinity,…

We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…

With suitable order of limits, as p, m, and n all tend to infinity, the distribution of the normalized trace of Frobenius on H^1 of a "random" plane curve of degree n over the field with p^m elements, tends to a Gaussian distribution. The…

The theory of probability, based on very general rules referred to as the Cox-Polya-Jaynes Desiderata, can be used both as a theory of random mass phenomena and as a quantitative theory of plausible inference about the parameters of…

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…

It is well known that the independence of the sample mean and the sample variance characterizes the normal distribution. By using Anosov's theorem, we further investigate the analogous characteristic properties in terms of the sample mean…

Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…

Let $S$ be a finite set, and $X_1,\ldots,X_n$ an i.i.d. uniform sample from $S$. To estimate the size $|S|$, without further structure, one can wait for repeats and use the birthday problem. This requires a sample size of the order…