Related papers: On Tournaments and Negative Dependence
Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…
A random coefficient autoregressive process is deeply investigated in which the coefficients are correlated. First we look at the existence of a strictly stationary causal solution, we give the second-order stationarity conditions and the…
The determinant of a tournament $T$ is defined as the determinant of the skew-adjacency matrix of $T$. For a positive odd integer $k$, let $\mathcal{D}_k$ be the set of tournaments whose all subtournaments have determinant at most $k^2$.…
Non-uniform estimates are obtained for Poisson, compound Poisson, translated Poisson, negative binomial and binomial approximations to sums of of m-dependent integer-valued random variables. Estimates for Wasserstein metric also follow…
Suppose you and your friend both do $n$ tosses of an unfair coin with probability of heads equal to $\alpha$. What is the behavior of the probability that you obtain at least $d$ more heads than your friend if you make $r$ additional…
Rank correlations have found many innovative applications in the last decade. In particular, suitable rank correlations have been used for consistent tests of independence between pairs of random variables. Using ranks is especially…
The Parrondo effect describes the seemingly paradoxical situation in which two losing games can, when combined, become winning [Phys. Rev. Lett. 85, 24 (2000)]. Here we generalize this analysis to the case where both games are…
We present here two examples of stochastic modelings of social phenomena. The first topic is pedestrian counter flow. Two groups of model pedestrians move in opposite directions and create congestions. It will be shown that this congestion…
It is well known that an extreme order statistic and a central order statistic (os) as well as an intermediate os and a central os from a sample of iid univariate random variables get asymptotically independent as the sample size increases.…
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…
While voluntary participation is a key mechanism that enables altruistic punishment to emerge, its explanatory power typically rests on the common assumption that non-participants have no impact on the public good. Yet, given the…
We introduce the class of {\em strongly Rayleigh} probability measures by means of geometric properties of their generating polynomials that amount to the stability of the latter. This class covers important models such as determinantal…
We propose a statistical model for networks of event count sequences built on a cascade structure. We assume that each event triggers successor events, whose counts follow additive probability distributions; the ensemble of counts is given…
We consider a symmetric exclusion process on a discrete interval of $S$ points with various boundary conditions at the endpoints. We study the asymptotic decay of correlations as $S\to\infty$. The main result is asymptotic independence of a…
Convergence results for averages of independent replications of counting processes are established in a $p$-variation setting and under certain assumptions. Such convergence results can be combined with functional differentiability results…
Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…
In this paper we explore the behaviour of dependent test statistics for testing of multiple hypothesis . To keep simplicity, we have considered a mixture normal model with equicorrelated correlation set up. With a simple linear…
A tournament $H$ is said to force quasirandomness if it has the property that a sequence $(T_n)_{n\in \mathbb{N}}$ of tournaments of increasing orders is quasirandom if and only if the homomorphism density of $H$ in $T_n$ tends to…
Given a mapping from a set of players to the leaves of a complete binary tree (called a seeding), a knockout tournament is conducted as follows: every round, every two players with a common parent compete against each other, and the winner…