English
Related papers

Related papers: Maximum Probability of Independence in Transitive …

200 papers

We consider the random field M(t)=\sup_{n\geq 1}\big\{-\log A_{n}+X_{n}(t)\big\}\,,\qquad t\in T\, for a set $T\subset \mathbb{R}^{m}$, where $(X_{n})$ is an iid sequence of centered Gaussian random fields on $T$ and $0<A_{1}<A_{2}<\cdots $…

Probability · Mathematics 2018-03-28 Zhipeng Liu , Jose H. Blanchet , A. B. Dieker , Thomas Mikosch

For a number field K and a finite abelian group G, we determine the probabilities of various local completions of a random G-extension of K when extensions are ordered by conductor. In particular, for a fixed prime p of K, we determine the…

Number Theory · Mathematics 2019-02-20 Melanie Matchett Wood

Let $p>2$, $B\geq 1$, $N\geq n$ and let $X$ be a centered $n$-dimensional random vector with the identity covariance matrix such that $\sup\limits_{a\in S^{n-1}}{\mathrm E}|\langle X,a\rangle|^p\leq B$. Further, let $X_1,X_2,\dots,X_N$ be…

Probability · Mathematics 2016-06-14 Konstantin Tikhomirov

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

Combinatorics · Mathematics 2022-03-16 Gianira N. Alfarano , Karan Khathuria , Simran Tinani

We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…

Dynamical Systems · Mathematics 2015-05-19 Gary Froyland , Naratip Santitissadeekorn , Adam Monahan

Let X be a singular real rational surface obtained from a smooth real rational surface by performing weighted blow-ups. Denote by Aut(X) the group of algebraic automorphisms of X into itself. Let n be a natural integer and let…

Algebraic Geometry · Mathematics 2010-04-08 Johannes Huisman , Frédéric Mangolte

We study varieties associated to hypergraphs from the point of view of projective geometry and matroid theory. We describe their decompositions into matroid varieties, which may be reducible and can have arbitrary singularities by the…

Combinatorics · Mathematics 2025-12-18 Oliver Clarke , Kevin Grace , Fatemeh Mohammadi , Harshit J Motwani

We consider the dynamical system given by a diagonalizable element $a$ of a closed linear unimodular algebraic subgroup $G$ of the special linear group over the $p$-adic numbers acting by translation on a finite volume quotient $X$.…

Dynamical Systems · Mathematics 2019-02-20 Rene Rühr

Max-stable random fields play a central role in modeling extreme value phenomena. We obtain an explicit formula for the conditional probability in general max-linear models, which include a large class of max-stable random fields. As a…

Computation · Statistics 2010-11-29 Yizao Wang , Stilian A. Stoev

We consider a possible generalization of the random matrix theory, which involves the maximization of Tsallis' $q$-parametrized entropy. We discuss the dependence of the spacing distribution on $q$ using a non-extensive generalization of…

Statistical Mechanics · Physics 2007-05-23 A. Y. Abul-Magd

The problem of determining the joint probability distributions for correlated random variables with pre-specified marginals is considered. When the joint distribution satisfying all the required conditions is not unique, the "most unbiased"…

Statistical Mechanics · Physics 2015-06-12 Hernán Larralde

It is shown how to model any automorphism of a totally disconnected, locally compact group by a symbolic dynamical system. The model is an inverse limit of a product of a full-shift, on a finite number of symbols, with one of two types of…

Dynamical Systems · Mathematics 2024-03-26 Bruce P. Kitchens

We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asymptotically almost all sparse paving matroids have a trivial…

Combinatorics · Mathematics 2016-09-19 Rudi Pendavingh , Jorn van der Pol

We study the problem of bounding path-dependent expectations (within any finite time horizon $d$) over the class of discrete-time martingales whose marginal distributions lie within a prescribed tolerance of a given collection of benchmark…

Probability · Mathematics 2021-12-01 Zhengqing Zhou , Jose Blanchet , Peter W. Glynn

We define a notion of isotropy for discrete set distributions. If $\mu$ is a distribution over subsets $S$ of a ground set $[n]$, we say that $\mu$ is in isotropic position if $P[e \in S]$ is the same for all $e\in [n]$. We design a new…

Data Structures and Algorithms · Computer Science 2020-04-21 Nima Anari , Michał Dereziński

Let $X^1, ..., X^k$ and $Y^1, ..., Y^m$ be jointly independent copies of random variables $X$ and $Y$, respectively. For a fixed total number $n$ of random variables, we aim at maximising $M(k,m):= E \max \{X^1, ..., X^k, Y^1, >..., Y^{m}…

Probability · Mathematics 2009-06-15 D. V. Tokarev , K. A. Borovkov

Let X_N= (X_1^(N), ..., X_p^(N)) be a family of N-by-N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices Y_N =(Y_1^(N), ..., Y_q^(N)), possibly random but independent of…

Probability · Mathematics 2011-05-19 C. Male

It is shown that a random $(0,1)$ matrix whose rows are independent random vectors of exactly $n/2$ zero components is non-singular with probability $1-O(n^{-C})$ for any $C>0$. The proof uses a non-standard inverse-type Littlewood-Offord…

Combinatorics · Mathematics 2011-12-06 Hoi H. Nguyen

Let $I$ be an independent set drawn from the discrete $d$-dimensional hypercube $Q_d=\{0,1\}^d$ according to the hard-core distribution with parameter $\lambda>0$ (that is, the distribution in which each independent set $I$ is chosen with…

Combinatorics · Mathematics 2010-05-13 David Galvin

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin