NGNina Gantert

Nina Gantert

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nina Gantert has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Large deviations for sums of multivariate stretched-exponential random variables: the few-big-jumps principle

    by Nina Gantert, Joscha Prochno, Philipp Tuchel

    Large deviations for sums of i.i.d.\ random variables with stretched-exponential tails (also called Weibull or semi-exponential tails) have been well understood since the 60's, going back to Nagaev's seminal work. Many extensions in the $1$-dimensional setting have been developed since then, showing that such deviations are typically governed by a single big jump. In higher dimensions, a corresponding theory has remained largely undeveloped. This work provides such a multivariate extension and establishes large deviation results for sums of i.i.d.\ random vectors in $\mathbb{R}^k$ under fairly general assumptions. Roughly speaking, for some $α\in(0,1)$, the log-probability of one random vector divided by $x$ exceeding a threshold $t$ in all components behaves asymptotically, for large $x$, as $x^α$ times a negative infimum of a function $\mathcal{J}$. We prove large deviation results for sums of i.i.d.\ copies, where the rate function is given by a minimization of at most $k$ summands of $\mathcal{J}$. This establishes a few-big-jumps principle that generalizes the classical $1$-dimensional phenomenon: the deviation is typically realized by \emph{at most} $k$ independent vectors. The results are applied to absolute powers of multivariate Gaussian vectors as well as to various other examples. They also allow us to study random projections of high-dimensional $\ell_p^N$-balls, revealing interesting insights about the appearance of light- and heavy-tailed distributions in high-dimensional geometry.

  • Open Access

    Correction: Poisson representable processes

    by Malin P. Forsström, Nina Gantert, Jeffrey E. Steif

  • Open Access

    Poisson representable processes

    by Malin P. Forsström, Nina Gantert, Jeffrey E. Steif

    Motivated by Alain-Sol Sznitman’s interlacement process, we consider the set of $$\{0,1\}$$ { 0 , 1 } -valued processes which can be constructed in an analogous way, namely as a union of sets coming from a Poisson process on a collection of sets. Our main focus is to determine which processes are representable in this way. Some of our results are as follows. (1) All positively associated Markov chains and a large class of renewal processes are so representable. (2) Whether an average of two product measures, with close densities, on n variables, is representable is related to the zeroes of the polylogarithm functions. (3) Using (2), we show that a number of tree-indexed Markov chains as well as the Ising model on $$ \mathbb {Z}^d ,$$ Z d , $$ d\ge 2,$$ d ≥ 2 , for certain parameters are not so representable. (4) The collection of permutation invariant processes that are representable corresponds exactly to the set of infinitely divisible random variables on $$[0,\infty ]$$ [ 0 , ∞ ] via a certain transformation. (5) The supercritical (low temperature) Curie-Weiss model is not representable for large n .


  • Open Access

    Cutoff on Trees is Rare

    by Nina Gantert, Evita Nestoridi, Dominik Schmid

    We study the simple random walk on trees and give estimates on the mixing and relaxation times. Relying on a seminal result by Basu, Hermon and Peres characterizing cutoff on trees, we give geometric criteria that are easy to verify and allow to determine whether the cutoff phenomenon occurs. We provide a general characterization of families of trees with cutoff, and show how our criteria can be used to prove the absence of cutoff for several classes of trees, including spherically symmetric trees, Galton–Watson trees of a fixed height, and sequences of random trees converging to the Brownian continuum random tree.


  • Open Access

    Mixing times for the simple exclusion process with open boundaries

    by Nina Gantert, Evita Nestoridi, Dominik Schmid

    We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well as on the rates in the bulk, and show that the process exhibits pre-cutoff and in some cases cutoff. Our main contribution is to study mixing times for the asymmetric simple exclusion process with open boundaries. We show that the order of the mixing time can be linear or exponential in the size of the segment depending on the choice of the boundary parameters, proving a strikingly different (and richer) behavior for the simple exclusion process with open boundaries than for the process on the closed segment. Our arguments combine coupling, second class particle and censoring techniques with current estimates. A novel idea is the use of multi-species particle arguments, where the particles only obey a partial ordering.

  • Open Access

    The TASEP on Galton-Watson trees

    by Nina Gantert, Nicos Georgiou, Dominik Schmid

    We study the totally asymmetric simple exclusion process (TASEP) on trees where particles are generated at the root. Particles can only jump away from the root, and they jump from $x$ to $y$ at rate $r_{x,y}$ provided $y$ is empty. Starting from the all empty initial condition, we show that the distribution of the configuration at time $t$ converges to an equilibrium. We study the current and give conditions on the transition rates such that the current is of linear order or such that there is zero current, i.e. the particles block each other. A key step, which is of independent interest, is to bound the first generation at which the particle trajectories of the first $n$ particles decouple.

  • Open Access

    Cutoff on trees is rare

    by Nina Gantert, Evita Nestoridi, Dominik Schmid

    We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine whether the cutoff phenomenon occurs. We thoroughly discuss families of trees with cutoff, and show how our criteria can be used to prove the absence of cutoff for several classes of trees, including spherically symmetric trees, Galton-Watson trees of a fixed height, and sequences of random trees converging to the Brownian CRT.

  • Open Access

    The speed of the tagged particle in the exclusion process on Galton-Watson trees

    by Nina Gantert, Dominik Schmid

    We study two different versions of the simple exclusion process on augmented Galton-Watson trees, the constant speed model and the varying speed model. In both cases, the simple exclusion process starts from an equilibrium distribution with non-vanishing particle density. Moreover, we assume to have initially a particle in the root, the tagged particle. We show for both models that the tagged particle has a positive linear speed and we give explicit formulas for the speeds.

  • Open Access

    Limit theorems for the tagged particle in exclusion processes on regular trees

    by Dayue Chen, Peng Chen, Nina Gantert, Dominik Schmid

    We consider exclusion processes on a rooted $d$-regular tree. We start from a Bernoulli product measure conditioned on having a particle at the root, which we call the tagged particle. For $d\geq 3$, we show that the tagged particle has positive linear speed and satisfies a central limit theorem. We give an explicit formula for the speed. As a key step in the proof, we first show that the exclusion process "seen from the tagged particle" has an ergodic invariant measure.