Accurate estimation of tail probabilities of projections of high-dimensional probability measures is of relevance in high-dimensional statistics and asymptotic geometric analysis. Whereas large deviation principles identify the asymptotic exponential decay rate of probabilities, sharp large deviation estimates also provide the “prefactor” in front of the exponentially decaying term. For fixed $p\in (1,\mathrm{\infty })$, consider independent sequences ${(X^{(n,p)})}_{n\in \mathbb{N}}$ and ${({\mathrm{\Theta }}^n)}_{n\in \mathbb{N}}$ of random vectors with ${\mathrm{\Theta }}^n$ distributed according to the normalized cone measure on the unit ${\ell }_2^n$ sphere, and $X^{(n,p)}$ distributed according to the normalized cone measure on the unit ${\ell }_p^n$ sphere. For almost every realization ${({\mathit{\theta }}^n)}_{n\in \mathbb{N}}$ of ${({\mathrm{\Theta }}^n)}_{n\in \mathbb{N}}$, (quenched) sharp large deviation estimates are established for suitably normalized (scalar) projections of $X^{(n,p)}$ onto ${\mathit{\theta }}^n$, that are asymptotically exact (as the dimension n tends to infinity). Furthermore, the case when ${(X^{(n,p)})}_{n\in \mathbb{N}}$ is replaced with ${(X^{(n,p)})}_{n\in \mathbb{N}}$, where $X^{(n,p)}$ is distributed according to the uniform (or normalized volume) measure on the unit ${\ell }_p^n$ ball, is also considered. In both cases, in contrast to the (quenched) large deviation rate function, the prefactor exhibits a dependence on the projection directions ${({\mathit{\theta }}^n)}_{n\in \mathbb{N}}$ that encodes additional geometric information that enables one to distinguish between projections of balls and spheres. Moreover, comparison with numerical estimates obtained by direct computation and importance sampling shows that the obtained analytical expressions for tail probabilities provide good approximations even for moderate values of n. The results on the one hand provide more accurate quantitative estimates of tail probabilities of random projections of ${\ell }_p^n$ spheres than logarithmic asymptotics, and on the other hand, generalize classical sharp large deviation estimates in the spirit of Bahadur and Ranga Rao to a geometric setting. The proofs combine Fourier analytic and probabilistic techniques. Along the way, several results of independent interest are obtained including a simpler representation for the quenched large deviation rate function that shows that it is strictly convex, a central limit theorem for random projections under a certain family of tilted measures, and multi-dimensional generalized Laplace asymptotics.

A Hawkes process on $\mathbb{R}$ is a point process whose intensity function at time t is a functional of its past activity before time t. It is defined by its activation function Φ and its memory function h. In this paper, the Hawkes property is expressed as an operator on the sub-space of non-negative sequences associated to distances between its points. By using the classical correspondence between a stationary point process and its Palm measure, we establish a characterization of the corresponding Palm measure as an invariant distribution of a Markovian kernel. We prove that if Φ is continuous and its growth rate is at most linear with a rate below some constant, then there exists a stationary Hawkes point process. The classical Lipschitz condition of the literature for an unbounded function Φ is relaxed. Our proofs rely on a combination of coupling methods, monotonicity properties of linear Hawkes processes and classical results on Palm distributions. An investigation of the Hawkes process starting from the null measure, the empty state, on ${\mathbb{R}}_{-}$ plays also an important role. The linear case of Hawkes and Oakes is revisited at this occasion.

If the memory function h is an exponential function, under a weak condition it is shown that there exists a unique stationary Hawkes point process. In this case, its Palm measure is expressed in terms of the invariant distribution of a one-dimensional Harris ergodic Markov chain. When the activation function is a polynomial Φ with degree $>1$, there does not exist a stationary Hawkes process and if the Hawkes process starts from the empty state, a scaling result for the accumulation of its points is obtained.

A Choquet-type integral representation result for non-negative subharmonic functions of a one-dimensional regular diffusion is established. The representation allows in particular an integral equation for strictly positive subharmonic functions that is driven by the Revuz measure of the associated continuous additive functional. Moreover, via the aforementioned integral equation, one can construct an Itô-Watanabe pair $(g,A)$ that consist of a subharmonic function g and a continuous additive functional A is with Revuz measure ${\mathrm{\mu }}_A$ such that $g(X)exp(-A)$ is a local martingale. Changes of measures associated with Itô-Watanabe pairs are studied and shown to modify the long term behaviour of the original diffusion process to exhibit transience.

We consider the Hamiltonians of mean-field spin glasses, which are certain random functions $H_N$ defined on high-dimensional cubes or spheres in ${\mathbb{R}}^N$. The asymptotic maximum values of these functions were famously obtained by Talagrand and later by Panchenko and by Chen. The landscape of approximate maxima of $H_N$ is described by various forms of replica symmetry breaking exhibiting a broad range of behaviors. We study the problem of efficiently computing an approximate maximizer of $H_N$.

We give a two-phase message passing algorithm to approximately maximize $H_N$ when a no overlap gap condition holds. This generalizes the recent works [Sub21, Mon19, AMS21] by allowing a non-trivial external field. For even Ising spin glasses with constant external field, our algorithm succeeds exactly when existing methods fail to rule out approximate maximization for a wide class of algorithms. Moreover we give a branching variant of our algorithm which constructs a full ultrametric tree of approximate maxima.

Let $F(\mathit{\sigma })={\sum }_{n=1}^{\mathrm{\infty }}\frac{X_n}{n^{\mathit{\sigma }}}$ be a random Dirichlet series where ${(X_n)}_{n\in \mathbb{N}}$ are independent standard Gaussian random variables. We compute in a quantitative form the expected number of zeros of $F(\mathit{\sigma })$ in the interval $[T,\mathrm{\infty })$, say $\mathbb{E}N(T,\mathrm{\infty })$, as $T\to 1∕2^{+}$. We also estimate higher moments and with this we derive exponential tails for the probability that the number of zeros in the interval $[T,1]$, say $N(T,1)$, is large. We also consider almost sure lower and upper bounds for $N(T,\mathrm{\infty })$. And finally, we also prove results for another class of random Dirichlet series, e.g., when the summation is restricted to prime numbers.

In this paper, we establish the Hausdorff dimensions of inverse images and collision time sets for a large class of symmetric Markov processes on metric measure spaces. We apply the approach in the works by Hawkes and Jain–Pruitt, and make full use of heat kernel estimates. In particular, the results efficiently apply to symmetric diffusion processes, symmetric stable-like processes, and symmetric diffusion processes with jumps in d-sets.

We study the quenched behaviour of a perturbed version of the simple symmetric random walk on the set of integers. The random walker moves symmetrically with an exception of some randomly chosen sites where we impose a random drift. We show that if the gaps between the marked sites are i.i.d. and regularly varying with a sufficiently small index, then there is no strong quenched limit laws for the position of the random walker. As a consequence we study the quenched limit laws in the context of weak convergence of random measures.

We introduce a model of Poisson random waves in ${\mathbb{S}}^2$ and we study Quantitative Central Limit Theorems when both the rate of the Poisson process and the energy (i.e., frequency) of the waves (eigenfunctions) diverge to infinity. We consider finite-dimensional distributions, harmonic coefficients and convergence in law in functional spaces, and we investigate carefully the interplay between the rate of divergence of eigenvalues and Poisson governing measures.

We study the Langevin dynamics corresponding to the $\nabla \mathit{\varphi }$ (or Ginzburg-Landau) interface model with a uniformly convex interaction potential. We interpret these Langevin dynamics as a nonlinear parabolic equation forced by white noise, which turns the problem into a nonlinear homogenization problem. Using quantitative homogenization methods, we prove a quantitative hydrodynamic limit, obtain the $C^2$ regularity of the surface tension, prove a large-scale $C^{1,\mathit{\alpha }}$-type estimate for the trajectories of the dynamics, and show that the fluctuation-dissipation relation can be seen as a commutativity of homogenization and linearization. Finally, we explain why we believe our techniques can be adapted to the setting of degenerate (non-uniformly) convex interaction potentials.

We consider first passage percolation on certain isotropic random graphs in ${\mathbb{R}}^d$. We assume exponential concentration of passage times $T(x,y)$, on some scale $\mathit{\sigma }(r)$ whenever $|y-x|$ is of order r, with $\mathit{\sigma }(r)$ “growning like $r^{\mathit{\chi }}$” for some $0<\mathit{\chi }<1$. Heuristically this means transverse wandering of geodesics should be at most of order $\mathrm{\Delta }(r)={(r\mathit{\sigma }(r))}^{1∕2}$. We show that in fact uniform versions of exponential concentration and wandering bounds hold: except with probability exponentially small in t, there are no $x,y$ in a natural cylinder of length r and radius $K\mathrm{\Delta }(r)$ for which either (i) $|T(x,y)-ET(x,y)|\ge t\mathit{\sigma }(r)$, or (ii) the geodesic from x to y wanders more than distance $\sqrt{t}\mathrm{\Delta }(r)$ from the cylinder axis. We also establish that for the time constant $\mathrm{\mu }={lim}_{n}ET(0,n{e}_1)∕n$, the “nonrandom error” $ET(0,x)-\mathrm{\mu }|x|$ is at most a constant multiple of $\mathit{\sigma }(|x|)$.

For any integer $m<n$, where m can depend on n, we study the rate of convergence of $\frac{1}{\sqrt{m}}Tr{\mathbf{U}}^m$ to its limiting Gaussian as $n\to \mathrm{\infty }$ for orthogonal, unitary and symplectic Haar distributed random matrices U of size n. In the unitary case, we prove that the total variation distance is less than $\mathrm{\Gamma }{(\lfloor n∕m\rfloor +2)}^{-1}{m}^{-\lfloor n∕m\rfloor }{\lfloor n∕m\rfloor }^{1∕4}\sqrt{logn}$ times a constant. This result interpolates between the super-exponential bound obtained for fixed m and the $1∕n$ bound coming from the Berry–Esseen theorem applicable when $m\ge n$ by a result of Rains. We obtain analogous results for the orthogonal and symplectic groups. In these cases, our total variation upper bound takes the form $\mathrm{\Gamma }{(2\lfloor n∕m\rfloor +1)}^{-1∕2}{m}^{-\lfloor n∕m\rfloor +1}{(logn)}^{1∕4}$ times a constant and the result holds provided $n>2m$. For $m=1$, we obtain complementary lower bounds and precise asymptotics for the $L^2$-distances as $n\to \mathrm{\infty }$, which show how sharp our results are.

In this work, we study general Dirichlet coalescents, which are a family of Ξ-coalecents constructed from i.i.d mass partitions, and are an extension of the symmetric coalescent. This class of models is motivated by population models with recurrent demographic bottlenecks. We study the short time behavior of the multidimensional block counting process whose ith component counts the number of blocks of size i. Compared to standard coalescent models (such as the class of Λ-coalescents coming down from infinity), our process has no deterministic speed of coming down from infinity. In particular, we prove that, under appropriate re-scaling, it converges to a stochastic process which is the unique solution of a martingale problem. We show that the multivariate Lamperti transform of this limiting process is a Markov Additive Process (MAP). This allows us to provide some asymptotics for the n-Site Frequency Spectrum, which is a statistic widely used in population genetics. In particular, the rescaled number of mutations converges to the exponential functional of a subordinator.

We consider the deviation inequalities for the sums of independent d by d random matrices, as well as rank one random tensors. Our focus is on the non-isotropic case and the bounds that do not depend explicitly on the dimension d, but rather on the effective rank. In an elementary and unified manner, we show the following results:

Our approach is based on the duality formula between entropy and moment generating functions. In contrast to the known proofs of dimension-free bounds, we avoid Talagrand’s majorizing measure theorem, as well as generic chaining bounds for empirical processes. Some of our tools were pioneered by O. Catoni and co-authors in the context of robust statistical estimation.

This work studies the averaging principle for a fully coupled two time-scale system, whose slow process is a diffusion process and fast process is a purely jumping process on an infinitely countable state space. The ergodicity of the fast process has important impact on the limit system and the averaging principle. We show that under strongly ergodic condition, the limit system admits a unique solution, and the slow process converges in the $L^1$-norm to the limit system. However, under certain weaker ergodicity condition, the limit system admits a solution, but not necessarily unique, and the slow process can be proved to converge weakly to a solution of the limit system.

In [10], Cerf and Gorny constructed a model of self-organized criticality, by introducing an automatic control of the temperature parameter in the generalized Ising Curie-Weiss model. The fluctuations of the magnetization of this spin model are of order $n^{3∕4}$ with a limiting law of the form $Cexp(-x^4)$, as in the critical regime of the Curie-Weiss model.

In this article, we build upon this model by replacing the mean-field interaction with a one-dimensional interaction with a certain range $r_n$ which varies as a function of the number n of particles. In the Gaussian case, we show that the self-critical behaviour observed in the mean-field case extends to interaction ranges $r_n\gg n^{3∕4}$ and we show that this threshold is sharp, with different fluctuations when the interaction range is of order of $n^{3∕4}$ or smaller than $n^{3∕4}$.

We prove a probabilistic generalization of the classic result that infinite power towers, $c^{c^{⋰}}$, converge if and only if $c\in [e^{-e},e^{1∕e}]$. Given an i.i.d. sequence ${\{A_i\}}_{i\in \mathbb{N}}$, we find that convergence of the power tower $A_1^{A_2^{⋰}}$ is determined by the bounds of $A_1$’s support, $a=inf(\mathrm{supp}(A_1))$ and $b=sup(\mathrm{supp}(A_1))$. When $b\in [e^{-e},e^{1∕e}]$, $a<1<b$, or $a=0$, the power tower converges almost surely. When $b<e^{-e}$, we define a special function B such that almost sure convergence is equivalent to $a<B(b)$. Only in the case when $a=1$ and $b>e^{1∕e}$ are the values of a and b insufficient to determine convergence. We show a rather complicated necessary and sufficient condition for convergence when $a=1$ and b is finite.

We also briefly discuss the relationship between the distribution of $A_1$ and the corresponding power tower $T=A_1^{A_2^{⋰}}$. For example, when $T\sim \mathrm{Unif}[0,1]$, then the corresponding distribution of $A_1$ is given by $UV$ where $U,V\sim \mathrm{Unif}[0,1]$ are independent. We generalize this example by showing that for $U\sim \mathrm{Unif}[\mathit{\alpha },\mathit{\beta }]$ and $r\in \mathbb{R}$, there exists an i.i.d. sequence ${\{A_i\}}_{i\in \mathbb{N}}$ such that $U^r\stackrel{d}{=}{A}_1^{A_2^{⋰}}$ if and only if $r\in [0,\frac{1}{1+log\mathit{\beta }}]$.

We study the kinetic mean field Langevin dynamics under the functional convexity assumption of the mean field energy functional. Using hypocoercivity, we first establish the exponential convergence of the mean field dynamics and then show the corresponding N-particle system converges exponentially in a rate uniform in N modulo a small error. Finally we study the short-time regularization effects of the dynamics and prove its uniform-in-time propagation of chaos property in both the Wasserstein and entropic sense. Our results can be applied to the training of two-layer neural networks with momentum and we include the numerical experiments.

We develop a variant of rough path theory tailor-made for analyzing a class of financial asset price models known as rough volatility models. As an application, we prove a pathwise large deviation principle (LDP) for a certain class of rough volatility models, which in turn describes the limiting behavior of implied volatility for short maturity under those models. First, we introduce a partial rough path space and an integration map on it and then investigate several fundamental properties including local Lipschitz continuity of the integration map from the partial rough path space to a rough path space. Second, we construct a rough path lift of a rough volatility model. Finally, we prove an LDP on the partial rough path space, and the LDP for rough volatility then follows by the continuity of the solution map of rough differential equations.

In the present article we consider the Schelling model, an agent-based model describing a segregation dynamics when we have a cohabitation of two social groups. As for several social models, the behaviour of the Schelling model was analyzed along several directions, notably by exploiting theoretical physics tools and computer simulations. This approach led to conjecture a phase diagram in which either different social groups were segregated in two large clusters or they were mixed. In this article, we describe and analyze a perturbation of the Schelling model as a particle systems model by adding a Glauber and Kawasaki dynamics to the original Schelling dynamics. As far as the authors know, this is the first rigorous mathematical analysis of the perturbed Schelling model. We prove the existence of an hydrodynamic limit described by a reaction-diffusion equation with a discontinuous non-linear reaction term. The existence and uniqueness of the solution is non trivial and the analysis of the limit PDE is interesting in its own. Based on our results, we conjecture, as in other variations of this model, the existence of a phase diagram in which we have a mixed, a segregated and a metastable segregation phase. We also describe how this phase transition can be viewed as a transition between a relevant and irrelevant disorder regime in the model.

Stein’s method for Gaussian process approximation can be used to bound the differences between the expectations of smooth functionals h of a càdlàg random process X of interest and the expectations of the same functionals of a well understood target random process Z with continuous paths. Unfortunately, the class of smooth functionals for which this is easily possible is very restricted. Here, we provide an infinite dimensional Gaussian smoothing inequality, which enables the class of functionals to be greatly expanded — examples are Lipschitz functionals with respect to the uniform metric, and indicators of arbitrary events — in exchange for a loss of precision in the bounds. Our inequalities are expressed in terms of the smooth test function bound, an expectation of a functional of X that is closely related to classical tightness criteria, a similar expectation for Z, and, for the indicator of a set K, the probability $\mathbb{P}(Z\in K^{\mathit{\theta }}\setminus K^{-\mathit{\theta }})$ that the target process is close to the boundary of K.

We derive limit laws for the empirical spectral distributions of random band and block matrices with correlated entries. In the first part of the paper, we study band matrices with approximately uncorrelated entries. We strengthen previously obtained results while requiring weaker assumptions, which is made possible by a refined application of the method of moments. In the second part of the paper, we introduce a new two-layered correlation structure we call SSB-HKW correlated, which enables the study of structured random matrices with correlated entries. Our results include semicircle laws in probability and almost surely, but we also obtain other limiting spectral distributions depending on the conditions. Simple necessary and sufficient conditions for the limit law to be the semicircle are provided.

We study the characteristic polynomials of both the Gaussian Orthogonal and Symplectic Ensembles. We show that for both ensembles, powers of the absolute value of the characteristic polynomials converge in law to Gaussian multiplicative chaos measures after normalization for sufficiently small real powers. The main tool is a new asymptotic relation between the fractional moments of the absolute characteristic polynomials of Gaussian Orthogonal, Unitary, and Symplectic Ensembles.

Recently Ren et al. [Stoch. Proc. Appl., 137 (2021)] have proved that the extremal process of the super-Brownian motion converges in distribution in the limit of large times. Their techniques rely heavily on the study of the convergence of solutions to the Kolmogorov-Petrovsky-Piscounov equation along the lines of [M. Bramson, Mem. Amer. Math. Soc., 44 (1983)]. In this paper we take a different approach. Our approach is based on the skeleton decomposition of super-Brownian motion. The skeleton may be interpreted as immortal particles that determine the large time behaviour of the process. We exploit this fact and carry asymptotic properties from the skeleton over to the super-Brownian motion. Some new results concerning the probabilistic representations of the limiting process are obtained, which cannot be directly obtained through the results of [Y.-X. Ren et al., Stoch. Proc. Appl., 137 (2021)]. Apart from the results, our approach offers insights into the driving force behind the limiting process for super-Brownian motions.

We compute the limiting measure for the Feynman loop representation of the Bose gas for a non mean-field energy. As predicted in previous works, for high densities the limiting measure gives positive weight to random interlacements, indicating the quantum Bose–Einstein condensation. We prove that in many cases there is a shift in the critical density compared to the free/mean-field case, and that in these cases the density of the random interlacements has a jump-discontinuity at the critical point.

We prove a new result relating solutions of the scaled fractional Allen–Cahn equation to motion by mean curvature flow, motivated by the motion of hybrid zones in populations that exhibit long range dispersal. Our proof is purely probabilistic and takes inspiration from Etheridge et al. [30] to describe solutions of the fractional Allen–Cahn equation in terms of ternary branching α-stable motions. To overcome technical difficulties arising from the heavy-tailed nature of the stable distribution, we couple ternary branching stable motions to ternary branching Brownian motions subordinated by truncated stable subordinators.

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of bottlenecks in a graph hampers mixing and, in particular, starting inside a small bottleneck significantly slows down the diffusion of the walk in the first steps of the process. The average mixing time is defined to be the mixing time starting at a uniformly random vertex and hence is not sensitive to the slow diffusion caused by these bottlenecks.

In this paper we provide a general framework to show logarithmic average mixing time for random walks on graphs with small bottlenecks. The framework is especially effective on certain families of random graphs with heterogeneous properties. We demonstrate its applicability on two random models for which the mixing time was known to be of order ${(logn)}^2$, speeding up the mixing to order $logn$. First, in the context of smoothed analysis on connected graphs, we show logarithmic average mixing time for randomly perturbed graphs of bounded degeneracy. A particular instance is the Newman-Watts small-world model. Second, we show logarithmic average mixing time for supercritically percolated expander graphs. When the host graph is complete, this application gives an alternative proof that the average mixing time of the giant component in the supercritical Erdős-Rényi graph is logarithmic.

We study the number of connected components of non-Gaussian random spherical harmonics on the two dimensional sphere ${\mathbb{S}}^2$. We prove that the expectation of the nodal domains count is independent of the distribution of the coefficients provided it has a finite second moment.

We introduce a broad class of mechanistic spatial models to describe how spatially heterogeneous populations live, die, and reproduce. Individuals are represented by points of a point measure, whose birth and death rates can depend both on spatial position and local population density, defined at a location to be the convolution of the point measure with a suitable non-negative integrable kernel centred on that location. We pass to three different scaling limits: an interacting superprocess, a nonlocal partial differential equation (PDE), and a classical PDE. The classical PDE is obtained both by a two-step convergence argument, in which we first scale time and population size and pass to the nonlocal PDE, and then scale the kernel that determines local population density; and in the important special case in which the limit is a reaction-diffusion equation, directly by simultaneously scaling the kernel width, timescale and population size in our individual based model.

A novelty of our model is that we explicitly model a juvenile phase. The number of juveniles produced by an individual depends on local population density at the location of the parent; these juvenile offspring are thrown off in a (possibly heterogeneous, anisotropic) Gaussian distribution around the location of the parent; they then reach (instant) maturity with a probability that can depend on the local population density at the location at which they land. Although we only record mature individuals, a trace of this two-step description remains in our population models, resulting in novel limits in which the spatial dynamics are governed by a nonlinear diffusion.

Using a lookdown representation, we are able to retain information about genealogies relating individuals in our population and, in the case of deterministic limiting models, we use this to deduce the backwards in time motion of the ancestral lineage of an individual sampled from the population. We observe that knowing the history of the population density is not enough to determine the motion of ancestral lineages in our model. We also investigate (and contrast) the behaviour of lineages for three different deterministic models of a population expanding its range as a travelling wave: the Fisher-KPP equation, the Allen-Cahn equation, and a porous medium equation with logistic growth.

We give a new derivation of the finite N master loop equation for lattice Yang-Mills theory with structure group $SO(N)$, $U(N)$ or $SU(N)$. The $SO(N)$ case was initially proved by Chatterjee in [6], and $SU(N)$ was analyzed in a follow-up work by Jafarov [23]. Our approach is based on the Langevin dynamic, an SDE on the manifold of configurations, and yields a simple proof via Itô’s formula.

We consider the asymptotic behavior of the KPZ fixed point ${\{\mathsf{H}(x,t)\}}_{x\in \mathbb{R},t>0}$ conditioned on $\mathsf{H}(0,T)=L$ as L goes to infinity. The main result is a conditional limit theorem for the fluctuations of $\mathsf{H}$ in the region near the line segment connecting the origin $(0,0)$ and $(0,T)$ for both step and flat initial conditions. The limit random field can be represented as a functional of two independent Brownian bridges, and in addition the limit random field depends also on the initial law of the KPZ fixed point. In particular for temporal fluctuations, the limit process indexed by line segment between $(0,0)$ and $(0,T)$, when the KPZ is with step initial condition, has the law of the minimum of two independent Brownian bridges; and when the KPZ is with flat initial condition the limit process has the law of the minimum of two independent Brownian bridges, each in addition perturbed by a common Gaussian random variable. For spatial-temporal fluctuations, the conditional limit theorem sheds light on the asymptotic behaviors of the point-to-point geodesic of the directed landscape conditioned on its length and as the length tends to infinity.

We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages correlates negatively with their phylogenetic distance. We give formulas / characterizations for quantities of biological interest that make them straightforward to compute in practice. We show that the appropriately rescaled network, seen as a metric space, converges to the Brownian continuum random tree, and that the uniformly rooted network has a local weak limit, which we describe explicitly.

The Skorokhod reflection was used in 1961 to create a reflected diffusion on the half-line. Later, it was used for processes with jumps such as reflected Lévy processes. Like a Brownian motion, which is a weak limit of random walks, reflected processes on the half-line serve as weak limits of random walks with switching regimes at zero: one regime away from zero, the other around zero. In this article, we develop a general theory of this regime change and prove convergence to a function with generalized reflection. Our results are deterministic and can be applied to a wide class of stochastic processes. Applications include storage processes, heavy traffic limits, diffusion on a half-line with a combination of continuous reflection, jump exit, and a delay at 0.

In this article we prove existence of the asymptotic capacity of the range of random walks on free products of graphs. In particular, we will show that the asymptotic capacity of the range is almost surely constant and strictly positive. Furthermore, we provide a central limit theorem for the capacity of the range and show that it varies real-analytically in terms of finitely supported probability measures of constant support.

We consider the model of random planar maps of size n biased by a weight $u>0$ per 2-connected block, and the closely related model of random planar quadrangulations of size n biased by a weight $u>0$ per simple component. We exhibit a phase transition at the critical value $u_C=9∕5$. If $u<u_C$, a condensation phenomenon occurs: the largest block is of size $\mathrm{\Theta }(n)$. Moreover, for quadrangulations we show that the diameter is of order $n^{1∕4}$, and the scaling limit is the Brownian sphere. When $u>u_C$, the largest block is of size $\mathrm{\Theta }(log(n))$, the scaling order for distances is $n^{1∕2}$, and the scaling limit is the Brownian tree. Finally, for $u=u_C$, the largest block is of size $\mathrm{\Theta }(n^{2∕3})$, the scaling order for distances is $n^{1∕3}$, and the scaling limit is the stable tree of parameter $3∕2$.

We consider slowly time-dependent singular stochastic partial differential equations on the two-dimensional torus, driven by weak space-time white noise, and renormalised in the Wick sense. Our main results are concentration results on sample paths near stable equilibrium branches of the equation without noise, measured in appropriate Besov and Hölder norms. We also discuss a case involving a pitchfork bifurcation. These results extend to the two-dimensional torus those obtained in [4] for finite-dimensional SDEs, and in [9] for SPDEs on the one-dimensional torus.

For a Haar-distributed element H of a compact Lie group L, Eric Rains proved in [10] that there is a natural number $D=D_L$ such that, for all $d\ge D$, the eigenvalue distribution of $H^d$ is fixed, and Rains described this fixed eigenvalue distribution explicitly. In the present paper we consider random elements U of a compact Lie group with general distribution. In particular, we introduce a mild absolute continuity condition under which the eigenvalue distribution of powers of U converges to that of $H^D$. Then, rather than the eigenvalue distribution, we consider the limiting distribution of $U^d$ itself.

We first show that the discounted cost, cost up to an exit time, and ergodic cost involving controlled non-degenerate diffusions are continuous on the space of stationary control policies when the policies are given a topology introduced by Borkar [V. S. Borkar, A topology for Markov controls, Applied Mathematics and Optimization 20 (1989), 55–62]. The same applies for finite horizon problems when the control policies are Markov and the topology is revised to include time also as a parameter. We then establish that finite action/piecewise constant stationary policies are dense in the space of stationary Markov policies under this topology and the same holds for continuous policies. Using the above mentioned continuity and denseness results we establish that finite action/piecewise constant policies approximate optimal stationary policies with arbitrary precision. This gives rise to the applicability of many numerical methods such as policy iteration and stochastic learning methods for discounted cost, cost up to an exit time, and ergodic cost optimal control problems in continuous-time. For the finite-horizon setup, we establish additionally near optimality of time-discretized policies by an analogous argument. We thus present a unified and concise approach for approximations directly applicable under several commonly adopted cost criteria.

We describe the rate of growth of the derivative $C^{\prime }$ of the convex minorant of a Lévy path at times where $C^{\prime }$ increases continuously. Since the convex minorant is piecewise linear, $C^{\prime }$ may exhibit such behaviour either at the vertex time ${\mathit{\tau }}_s$ of finite slope $s=C_{{\mathit{\tau }}_s}^{\prime }$ or at time 0 where the slope is $-\mathrm{\infty }$. While the convex hull depends on the entire path, we show that the local fluctuations of the derivative $C^{\prime }$ depend only on the fine structure of the small jumps of the Lévy process and are the same for all time horizons. In the domain of attraction of a stable process, we establish sharp results essentially characterising the modulus of continuity of $C^{\prime }$ up to sub-logarithmic factors. As a corollary we obtain novel results for the growth rate at 0 of meanders in a wide class of Lévy processes.

We prove that the Loop $O(1)$ model, a well-known graphical expansion of the Ising model, is a factor of i.i.d. on unimodular random rooted graphs under various conditions, including in the presence of a non-negative external field. As an application we show that the gradient of the free Ising model is a factor of i.i.d. on simply connected unimodular planar maps having a locally finite dual. The key idea is to develop an appropriate theory of local limits of uniform even subgraphs with various boundary conditions and prove that they can be sampled as a factor of i.i.d. Another key tool we exploit is that the wired uniform spanning tree on a unimodular transient graph is a factor of i.i.d. This partially answers some questions posed by Hutchcroft [33].

We study and develop multilevel methods for the numerical approximation of a log-concave probability π on ${\mathbb{R}}^d$, based on (over-damped) Langevin diffusion. In the continuity of [12] concentrated on the uniformly log-concave setting, we here study the procedure in the absence of the uniformity assumption. More precisely, we first adapt an idea of [8] by adding a penalization term to the potential to recover the uniformly convex setting. Such approach leads to an ε-complexity of the order ${\mathit{\epsilon }}^{-5}\mathrm{\pi }{(|.{|}^2)}^{9∕2}d$ (up to logarithmic terms). Then, in the spirit of [14], we propose to explore the robustness of the method in a weakly convex parametric setting where the lowest eigenvalue of the Hessian of the potential U is controlled by the function ${U(x)}^{-r}$ for $r\in (0,1)$. In this intermediary framework between the strongly convex setting ($r=0$) and the “Laplace case” ($r=1$), we show that with the help of the control of exponential moments of the Euler scheme, we can adapt some fundamental properties for the efficiency of the method. In the “best” setting where U is ${\mathcal{C}}^3$ and ${U(x)}^{-r}$ control the largest eigenvalue of the Hessian, we obtain an ε-complexity of the order $c_{\mathit{\rho },\mathit{\delta }}{\mathit{\epsilon }}^{-2-\mathit{\rho }}{d}^{1+\frac{\mathit{\rho }}{2}+(4-\mathit{\rho }+\mathit{\delta })r}$ for any $\mathit{\rho }>0$ (but with a constant $c_{\mathit{\rho },\mathit{\delta }}$ which increases when ρ and δ go to 0).

We provide a many-to-few formula in the general setting of non-local branching Markov processes. This formula allows one to compute expectations of k-fold sums over functions of the population at k different times. The result generalises [13] to the non-local setting, as introduced in [11] and [8]. As an application, we consider the case when the branching process is critical, and conditioned to survive for a large time. In this setting, we prove a general formula for the limiting law of the death time of the most recent common ancestor of two particles selected uniformly from the population at two different times, as $t\to \mathrm{\infty }$. Moreover, we describe the limiting law of the population sizes at two different times, in the same asymptotic regime.

We derive the leading order asymptotics of the logarithmic potential of a two dimensional Coulomb gas at arbitrary positive temperature. The proof is based on precise evaluation of exponential moments, and the theory of Gaussian multiplicative chaos.

We study moderate deviations for additive functionals of stochastic lattice gases (Kawasaki dynamics for the Ising model). Under a mixing condition, we prove that the additive functional of any local functions satisfies a moderate deviation principle. The main tool is the logarithmic Sobolev inequality obtained by Yau.

We study the stochastic six-vertex model on a strip

$\left\{(x,y)\in {\mathbb{Z}}^2:0\le y\le x\le y+N\right\}\text{(0.1)}$

with two open boundaries. We develop a ‘matrix product ansatz’ method to solve for its stationary measure, based on the compatibility of three types of local moves of any down-right path. The stationary measure on a horizontal path turns out to be a tilting of the stationary measure of the asymmetric simple exclusion process (ASEP) with two open boundaries. Similar to open ASEP, the statistics of this tilted stationary measure as the number of sites $N\to \mathrm{\infty }$ (with the bulk and boundary parameters fixed) also exhibit a phase diagram, which is a tilting of the phase diagram of open ASEP. We study the limit of mean particle density as an example.

We discuss a natural extension of Gilles Pisier’s approach to the study of measure concentration, isoperimetry, and Poincaré-type inequalities. This approach allows one to explore counterparts of various results about Gaussian measures in the class of rotationally invariant probability distributions on Euclidean spaces, including multidimensional Cauchy measures.

Here we propose the Donsker-Varadhan-type compactness conditions and prove the joint large deviation principle for the empirical measure and empirical flow of Markov renewal processes (semi-Markov processes) with a countable state space, generalizing the relevant results for continuous-time Markov chains with a countable state space obtained in [Ann. Inst. H. Poincaré Probab. Statist. 51, 867-900 (2015)] and [Stoch. Process. Appl. 125, 2786-2819 (2015)], as well as the relevant results for Markov renewal processes with a finite state space obtained in [Adv. Appl. Probab. 48, 648-671 (2016)]. In particular, our results hold when the flow space is endowed with either the bounded weak* topology or the strong $L^1$ topology. Even for continuous-time Markov chains, our compactness conditions are weaker than the ones proposed in previous papers. Furthermore, under some stronger conditions, we obtain the explicit expression of the marginal rate function of the empirical flow.

When the limiting compensator of a sequence of martingales is continuous, we obtain a weak convergence theorem for the martingales; the limiting process can be written as a Brownian motion evaluated at the compensator and we find sufficient conditions for both processes to be independent. As examples of applications, we revisit some known results for the occupation times of Brownian motion and symmetric random walks. In the latter case, our proof is much simpler than the construction of strong approximations. Furthermore, we extend finite dimensional convergence of statistical estimators of financial volatility measures to convergence as stochastic processes.

In this study, we investigate the energy landscape of the Ising and Potts models on fixed and finite but large three-dimensional (3D) lattices where no external field exists and quantitatively characterize the metastable behavior of the associated Glauber dynamics in the very low temperature regime. Such analyses for the models with non-zero external magnetic fields have been extensively performed over the past two decades; however, models without external fields remained uninvestigated. Recently, the corresponding investigation has been conducted for the two-dimensional (2D) model without an external field, and in this study, we further extend these successes to the 3D model, which has a far more complicated energy landscape than the 2D one. In particular, we provide a detailed description of the highly complex plateau structure of saddle configurations between ground states and then analyze the typical behavior of the Glauber dynamics thereon. Thus, we achieve a quantitatively precise analysis of metastability, including the Eyring–Kramers law, the Markov chain model reduction, and a full characterization of metastable transition paths.

We raise a question of whether there might be deep mathematical connections between two properties for bijective functions $F:\mathcal{X}\times \mathcal{X}\to \mathcal{X}\times \mathcal{X}$ for a set $\mathcal{X}$ which are introduced from very different backgrounds, and study the supporting evidence that suggests this. One of the property is that F is a Yang-Baxter map, namely it satisfies the “set-theoretical” Yang-Baxter equation, and the other property is the independence preserving property, which means that there exist independent (non-constant) $\mathcal{X}$-valued random variables $X,Y$ such that $U,V$ are also independent with $(U,V)=F(X,Y)$. Recently in the study of invariant measures for a discrete integrable system, a class of functions having these two properties were found. Motivated by this, we analyze a relationship between the Yang-Baxter maps and the independence preserving property, which has never been studied as far as we are aware. We focus on the case $\mathcal{X}={\mathbb{R}}_{+}$. Our first main result is that all quadrirational Yang-Baxter maps $F:{\mathbb{R}}_{+}\times {\mathbb{R}}_{+}\to {\mathbb{R}}_{+}\times {\mathbb{R}}_{+}$ in an important subclass have the independence preserving property. In particular, we found new classes of bijections having the independence preserving property. Our second main result is that these newly introduced bijections are fundamental in the class of (known) bijections with the independence preserving property, in the sense that many known bijections having the independence preserving property are derived from these maps by taking special parameters or performing some limiting procedure. This reveals that the independence preserving property, which has been investigated for specific functions individually, can be understood in a more unified manner.

We study a permuted random walk process on a graph G. Given a fixed sequence of permutations on the vertices of G, the permuted random walker alternates between taking random walk steps, and applying the next permutation in the sequence to their current position. Existing work on permuted random walks includes results on hitting times, mixing times, and asymptotic speed. The usual random walk on a regular tree, or generally any non-amenable graph, has positive speed, i.e. the distance from the origin grows linearly. Our focus is understanding whether permuted walks can be slower than the corresponding non-permuted walk, by carefully choosing the permutation sequence. We show that on regular trees (including the line), the permuted random walk is always stochastically faster. The proof relies on a majorization inequality for probability measures, plus an isoperimetric inequality for the tree. We also quantify how much slower the permuted random walk can possibly be when it is coupled with the corresponding non-permuted walk.

We look at random walks in Dirichlet environment. It was known that in dimension $d\ge 3$, if the walk is sub-ballistic, the displacement of the walk is polynomial of order κ for some explicit κ. We show that the walk, after renormalization, actually converges to a κ-stable completely asymmetric Lévy Process.

Place an active particle at the root of a d-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability p and, otherwise, away from the root to a uniformly sampled child vertex. When an active particle moves to a site containing a dormant particle, the dormant particle becomes active. The critical drift $p_d$ is the infimum over all p for which infinitely many particles visit the root almost surely. Guo, Tang, and Wei proved that ${sup}_{d\ge 3}{p}_d\le 1∕3$. We improve this bound to $5∕17$ with a shorter argument that generalizes to give bounds on ${sup}_{d\ge m}{p}_d$. We additionally prove that $lim\hspace{0.17em}sup{p}_d\le 1∕6$ by finding the limiting critical drift for a non-backtracking variant.

For a class of additive processes driven by the affine recursion $X_{n+1}=A_{n+1}{X}_n+B_{n+1}$, we develop a sample-path large deviations principle in the $M_1^{\prime }$ topology on $\mathbb{D}[0,1]$. We allow $B_n$ to have both signs and focus on the case where Kesten’s condition holds on $A_1$, leading to heavy-tailed distributions. The most likely paths in our large deviations results are step functions with both positive and negative jumps.

We construct a self-similar solution of the heat equation for the fractional Laplacian with Dirichlet boundary conditions in every fat cone. Furthermore, we give the entrance law from the vertex and the Yaglom limit for the corresponding killed isotropic stable Lévy process and precise large-time asymptotics for solutions of the Cauchy problem in the cone.

We first study a d-dimensional branching Brownian motion (BBM) among mild Poissonian obstacles, where a random trap field in ${\mathbb{R}}^d$ is created via a Poisson point process. The trap field consists of balls of fixed radius centered at the atoms of the Poisson point process. The mild obstacle rule is that when particles are inside traps, they branch at a lower rate, which is allowed to be zero, whereas when outside traps they branch at the normal rate. We prove upper bounds on the large-deviation probabilities for the total mass of BBM among mild obstacles, which we then use along with the Borel-Cantelli lemma to prove the corresponding strong law of large numbers. Our results are quenched, that is, they hold in almost every environment with respect to the Poisson point process. Our strong law improves on the existing corresponding weak law in [Ann. Inst. Henri Poincaré Probab. Stat. 44 (2008), 490–518]. We also study a d-dimensional BBM inside subdiffusively expanding balls, where the boundary of the ball is deactivating in the sense that once a particle of the BBM hits the moving boundary, it is instantly deactivated but will be reactivated at a later time provided its ancestral line is fully inside the expanding ball at that later time. We obtain a large-deviation result as time tends to infinity on the probability that the mass inside the ball is aytpically small. An essential ingredient in the proofs of the strong law of large numbers for BBM among mild obstacles turns out to be the large-deviation result on the mass of BBM inside expanding balls.

We prove, under mild conditions on fixed points and 2-cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy class. Additionally, we prove that the limiting variance is always non-degenerate for classical pattern counts. The proof uses weighted dependency graphs.

While many questions in robust finance can be posed in the martingale optimal transport framework or its weak extension, others like the subreplication price of VIX futures, the robust pricing of American options or the construction of shadow couplings necessitate additional information to be incorporated into the optimization problem beyond that of the underlying asset. In the present paper, we take into account this extra information by introducing an additional parameter to the weak martingale optimal transport problem. We prove the stability of the resulting problem with respect to the risk neutral marginal distributions of the underlying asset, thus extending the results in [9]. A key step is the generalization of the main result in [7] to include the extra parameter into the setting. This result establishes that any martingale coupling can be approximated by a sequence of martingale couplings with specified marginals, provided that the marginals of this sequence converge to those of the original coupling. Finally, we deduce stability of the three previously mentioned motivating examples.

We introduce a technique for comparing the limit profile behavior of two reversible, commuting Markov chains on the same space, that share the same stationary distribution. We apply this technique to prove that the limit profile of star transpositions at time $t=nlogn+cn$ is equal to $d_{\text{T.V.}}(\text{Poiss}(1+e^{-c}),\text{Poiss}(1))$ by comparing to the limit profile of random transpositions, as studied in [29]. We also provide examples of important commuting Markov chains, whose limit profile behavior is unknown, which could give new directions for research.

A distributional equation as a criterion for invariant measures of Markov processes associated to Lévy-type operators is established. This is obtained via a characterization of infinitesimally invariant measures of the associated generators. Particular focus is put on the one-dimensional case where the distributional equation becomes a Volterra-Fredholm integral equation, and on solutions to Lévy-driven stochastic differential equations. The results are accompanied by various illustrative examples.

We provide a framework for studying the expansion rate of the image of a bounded set under a semi-flow in Euclidean space and apply it to stochastic differential equations (SDEs for short) with singular coefficients. If the singular drift of the SDE can be split into two terms, one of which is singular and the radial component of the other term is negative then, under suitable conditions, the random dynamical system generated by the SDE admits a pullback attractor.

The purpose of this paper is to study a one-dimensional polymer penalized by its range and placed in a random environment ω. The law of the simple symmetric random walk up to time n is modified by the exponential of the sum of $\mathit{\beta }{\mathit{\omega }}_z-h$ sitting on its range, with h and β positive parameters. It is known that, at first order, the polymer folds itself to a segment of optimal size $c_h{n}^{1∕3}$ with $c_h={\mathrm{\pi }}^{2∕3}{h}^{-1∕3}$. Here we study how disorder influences finer quantities. If the random variables ${\mathit{\omega }}_z$ are i.i.d. with a finite second moment, we prove that the left-most point of the range is located near $-u_{\ast }{n}^{1∕3}$, where $u_{\ast }\in [0,c_h]$ is a constant that only depends on the disorder. This contrasts with the homogeneous model (i.e. when $\mathit{\beta }=0$), where the left-most point has a random location between $-c_h{n}^{1∕3}$ and 0. With an additional moment assumption, we are able to show that the left-most point of the range is at distance $\mathcal{U}{n}^{2∕9}$ from $-u_{\ast }{n}^{1∕3}$ and the right-most point at distance $\mathcal{V}{n}^{2∕9}$ from $(c_h-u_{\ast })n^{1∕3}$. Here again, $\mathcal{U}$ and $\mathcal{V}$ are constants that depend only on ω.

We explore probability distributions on the real line whose Laplace transform admits an upper bound of subgaussian type known as strict subgaussianity. One class in this family corresponds to entire characteristic functions having only real zeros in the complex plane. Using Hadamard’s factorization theorem, we extend this class and propose new sufficient conditions for strict subgaussianity in terms of location of zeros of the associated characteristic functions. The second part of this note deals with Laplace transforms of strictly subgaussian distributions with periodic components. This class contains interesting examples, for which the central limit theorem with respect to the Rényi entropy divergence of infinite order holds.

For finite size Markov chains, the Donsker-Varadhan theory fully describes the large deviations of the time averaged empirical measure. We are interested in the extension of the Donsker-Varadhan theory for a large size non-equilibrium system: the one-dimensional symmetric simple exclusion process connected with reservoirs at different densities. The Donsker-Varadhan functional encodes a variety of scales depending on the observable of interest. In this paper, we focus on the time-averaged two point correlations and investigate the large deviations from the steady state behaviour. To control two point correlations out of equilibrium, the key input is the construction of a simple approximation to the invariant measure. This approximation is quantitative in time and space as estimated through relative entropy bounds building on the work of Jara and Menezes [32].

We discuss an analytic form of the dilation inequality with respect to a probability measure for symmetric convex sets in Euclidean spaces, which is a counterpart of analytic aspects of Cheeger’s isoperimetric inequality. We show that the dilation inequality for symmetric convex sets is equivalent to a certain bound of the relative entropy for even quasi-convex functions, which is close to the logarithmic Sobolev inequality or Cramér–Rao inequality. As corollaries, we investigate the reverse Shannon inequality, logarithmic Sobolev inequality, Kahane–Khintchine inequality, deviation inequality and isoperimetry. We also give new probability measures satisfying the dilation inequality for symmetric convex sets via bounded perturbations and tensorization.

We consider the inclusion process on the complete graph with vanishing diffusivity, which leads to condensation of particles in the thermodynamic limit. Describing particle configurations in terms of size-biased and appropriately scaled empirical measures of mass distribution, we establish convergence in law of the inclusion process to a measure-valued Markov process on the space of probability measures. In the case where the diffusivity vanishes like the inverse of the system size, the derived scaling limit is equivalent to the well known Poisson-Dirichlet diffusion, offering an alternative viewpoint on these well-established dynamics. Moreover, our novel size-biased approach provides a robust description of the dynamics, which covers all scaling regimes of the system parameters and yields a natural extension of the Poisson-Dirichlet diffusion to infinite mutation rate. We also discuss in detail connections to known results on related Fleming-Viot processes.

We prove well-posedness results for backward stochastic differential equations (BSDEs) and reflected BSDEs with an optional obstacle process in the case of appropriately weighted ${\mathbb{L}}^2$-data when the generator is integrated with respect to a possibly purely discontinuous process. This leads to a unified treatment of discrete-time and continuous-time (reflected) BSDEs. We compare our well-posedness results with the current literature and highlight that our results are sharp and cannot be improved within the framework presented here. Finally, we provide sufficient conditions for a comparison principle.

In this paper we derive intertwining relations for a broad class of conservative particle systems both in discrete and continuous setting. Using the language of point process theory, we are able to derive a new framework in which duality and intertwining can be formulated for particle systems evolving in general spaces. These new intertwining relations are formulated with respect to factorial and orthogonal polynomials.

Our novel approach unites all the previously found self-dualities in the context of discrete consistent particle systems and provides new duality results for several interacting systems in the continuum, such as interacting Brownian motions. We also introduce a process that we call generalized inclusion process, consisting of interacting random walks in the continuum, for which our method applies and yields generalized Meixner polynomials as orthogonal self-intertwiners.

This article is devoted to the study of a finite system of long clusters of subcritical 2-dimensional FK-percolation with $q\ge 1$, conditioned on mutual avoidance. We show that the diffusive scaling limit of such a system is given by a system of Brownian bridges conditioned not to intersect: the so-called Brownian watermelon. Moreover, we give an estimate of the probability that two sets of r points at distance n of each other are connected by distinct clusters. As a byproduct, we obtain the asymptotics of the probability of the occurrence of a large finite cluster in a supercritical random-cluster model.

The Kingman coalescent is a fundamental process in population genetics modelling the ancestry of a sample of individuals backwards in time. In this paper, in a large-sample-size regime, we study asymptotic properties of the coalescent under neutrality and a general finite-alleles mutation scheme, i.e. including both parent independent and parent dependent mutation. In particular, we consider a sequence of Markov chains that is related to the coalescent and consists of block-counting and mutation-counting components. We show that these components, suitably scaled, converge weakly to deterministic components and Poisson processes with varying intensities, respectively. Along the way, we develop a novel approach, based on a change of measure, to generalise the convergence result from the parent independent to the parent dependent mutation setting, in which several crucial quantities are not known explicitly.

We study the distributional properties of jumps of multi-type continuous state and continuous time branching processes with immigration (multi-type CBI processes). We derive an expression for the distribution function of the first jump time of a multi-type CBI process with jump size in a given Borel set having finite total Lévy measure, which is defined as the sum of the measures appearing in the branching and immigration mechanisms of the multi-type CBI process in question. Using this we derive an expression for the distribution function of the local supremum of the norm of the jumps of a multi-type CBI process. Further, we show that if A is a nondegenerate rectangle anchored at zero and with total Lévy measure zero, then the probability that the local coordinate-wise supremum of jumps of the multi-type CBI process belongs to A is zero. We also prove that a converse statement holds.

A result of Arcones [Arc95] implies that if a measure-preserving linear operator S on an abstract Wiener space $(X,H,\mathrm{\mu })$ is strongly mixing, then the set of limit points of the random sequence ${({(2logn)}^{-1∕2}{S}^{n}x)}_{n\in \mathbb{N}}$ equals the unit ball of H for μ-a.e. $x\in X$, which may be seen as a generalization of the classical Strassen’s law of the iterated logarithm. We extend this result to the case of a continuous parameter n and higher Gaussian chaoses, and we also prove a contraction-type principle for Strassen laws of such chaoses. We then use these extensions to recover or prove Strassen-type laws for a broad collection of processes derived from a Gaussian measure, including “nonlinear” Strassen laws for singular SPDEs such as the KPZ equation.

Lower bounds for variances are often needed to derive central limit theorems. In this paper, we establish a lower bound for the variance of Poisson functionals that uses the difference operator of Malliavin calculus. Poisson functionals, i.e. random variables that depend on a Poisson process, are frequently studied in stochastic geometry. We apply our lower variance bound to statistics of spatial random graphs, the $L^p$ surface area of random polytopes and the volume of excursion sets of Poisson shot noise processes. Thereby we do not only bound variances from below but also show positive definiteness of asymptotic covariance matrices and provide associated results on the multivariate normal approximation.

Measure-valued Pólya urn sequences (MVPS) are a generalization of the observation processes generated by k-color Pólya urn models, where the space of colors $\mathbb{X}$ is a complete separable metric space and the urn composition is a finite measure on $\mathbb{X}$, in which case reinforcement reduces to a summation of measures. In this paper, we prove a representation theorem for the reinforcement measures R of all exchangeable MVPSs, which leads to a characterization result for their directing random measures $\tilde{P}$. In particular, when $\mathbb{X}$ is countable or R is dominated by the initial distribution ν, then any exchangeable MVPS is a Dirichlet process mixture model over a family of probability distributions with disjoint supports. Furthermore, for all exchangeable MVPSs, the predictive distributions converge on a set of probability one in total variation to $\tilde{P}$. Importantly, we do not restrict our analysis to balanced MVPSs, in the terminology of k-color urns, but rather show that the only non-balanced exchangeable MVPSs are sequences of i.i.d. random variables.

Consider a centered smooth Gaussian random field $\{X(t),t\in T\}$ with a general (nonconstant) variance function. In this work, we demonstrate that as $u\to \mathrm{\infty }$, the excursion probability $\mathbb{P}\{{sup}_{t\in T}X(t)\ge u\}$ can be accurately approximated by $\mathbb{E}\{\mathit{\chi }(A_u)\}$ such that the error decays at a super-exponential rate. Here, $A_u=\{t\in T:X(t)\ge u\}$ represents the excursion set above u, and $\mathbb{E}\{\mathit{\chi }(A_u)\}$ is the expectation of its Euler characteristic $\mathit{\chi }(A_u)$. This result substantiates the expected Euler characteristic heuristic for a broad class of smooth Gaussian random fields with diverse covariance structures. In addition, we employ the Laplace method to derive explicit approximations to the excursion probabilities.

We study transient patterns appearing in a class of SPDE using the framework of quasi-stationary and quasi-ergodic measures. In particular, we prove the existence and uniqueness of quasi-stationary and quasi-ergodic measures for a class of reaction-diffusion systems perturbed by additive cylindrical noise. We obtain convergence results in $L^2$ and almost surely, and demonstrate an exponential rate of convergence to the quasi-stationary measure in an $L^2$ norm. These results allow us to qualitatively characterize the behaviour of these systems in neighbourhoods of an invariant manifold of the corresponding deterministic systems at some large time $t>0$, conditioned on remaining in the neighbourhood up to time t. The approach we take here is based on spectral gap conditions, and is not restricted to the small noise regime.

We provide a full description for the joint fluctuations of current and occupation time in the one-dimensional nonequilibrium simple symmetric exclusion process, furnishing explicit formulas for the covariances of the limiting Gaussian process. The main novelties consist of a proof of the tightness of the nonequilibrium current based on new correlation estimates, refined estimates on the discrete gradient of the transition probabilities of the SSEP, and a nonequilibrium Kipnis-Varadhan Lemma based on a Fourier approach.

We study the simulated annealing algorithm based on the kinetic Langevin dynamics, in order to find the global minimum of a non-convex potential function. For both the continuous time formulation and a discrete time analogue, we obtain the convergence rate results under technical conditions on the potential function, together with an appropriate choice of the cooling schedule and the time discretization parameters.

We provide new bounds for the rate of convergence of the multivariate Central Limit Theorem in Wasserstein distances of order $p\ge 2$. In particular, we obtain what we conjecture to be the asymptotically optimal rate in the identically distributed case whenever the measure of the summands admits a non-zero continuous component and has a non-zero third moment.

We investigate several aspects of solutions to stochastic evolution equations in Hilbert spaces driven by a standard symmetric α-stable cylindrical noise. Similarly to cylindrical Brownian motion or Gaussian white noise, standard symmetric α-stable noise exists only in a generalised sense in Hilbert spaces. The main results of this work are the existence of a mild solution, long-term regularity of the solutions via Lyapunov functional approach, and an Itô formula for mild solutions to evolution equations under consideration. The main tools for establishing these results are Yosida approximations and an Itô formula for Hilbert space-valued semi-martingales where the martingale part is represented as an integral driven by cylindrical α-stable noise. While these tools are standard in stochastic analysis, due to the cylindrical nature of our noise, their application requires completely novel arguments and techniques.

We study the probability that a random walk started inside a subgraph of a larger graph exits that subgraph (or, equivalently, hits the exterior boundary of the subgraph). Considering the chance a random walk started in the subgraph never leaves the subgraph leads to a notion we call “survival” transience, or S-transience. In the case where the heat kernel of the larger graph satisfies two-sided Gaussian estimates, we prove an upper bound on the probability of hitting the boundary of the subgraph. Under the additional hypothesis that the subgraph is inner uniform, we prove a two-sided estimate for this probability. The estimate depends upon a harmonic function in the subgraph. We also provide two-sided estimates for related probabilities, such as the harmonic measure (the chance the walk exits the subgraph at a particular point on its boundary).

Let $N_n(a,b)$ denote the number of real zeros of Gaussian elliptic polynomials of degree n on the interval $(a,b)$, where a and b may vary with n. We obtain a precise formula for the variance of $N_n(a,b)$ and utilize this expression to derive an asymptotic expansion for large values of n. Furthermore, we provide sharp estimates for the cumulants and central moments of $N_n(a,b)$. These estimates are instrumental in establishing sufficient conditions on the interval $(a,b)$ for $N_n(a,b)$ to satisfy both a central limit theorem and a strong law of large numbers. In the second part of the paper, we extend our analysis to nondegenerate Gaussian analytic functions, including well-known examples such as the Gaussian Weyl series and Weyl polynomials.

We study the cluster-size distribution of supercritical long-range percolation on ${\mathbb{Z}}^d$, where two vertices $x,y\in {\mathbb{Z}}^d$ are connected by an edge with probability $\mathrm{p}(\Vert x-y\Vert ):=pmin{(1,\mathit{\beta }\Vert x-y\Vert )}^{-d\mathit{\alpha }}$ for parameters $p\in (0,1]$, $\mathit{\alpha }>1$, and $\mathit{\beta }>0$. We show that when $\mathit{\alpha }>1+1∕d$, and either β or p is sufficiently large, the probability that the origin is in a finite cluster of size at least k decays as $exp(-\mathrm{\Theta }(k^{(d-1)∕d}))$. This corresponds to classical results for nearest-neighbor Bernoulli percolation on ${\mathbb{Z}}^d$, but is in contrast to long-range percolation with $\mathit{\alpha }<1+1∕d$, when the exponent of the stretched exponential decay changes to $2-\mathit{\alpha }$. This result, together with our accompanying paper, establishes the phase diagram of long-range percolation with respect to cluster-size decay. Our proofs rely on combinatorial methods that show that large delocalized components are unlikely to occur. As a side result we determine the asymptotic growth of the second-largest connected component when the graph is restricted to a finite box.

We study the SIRS process—a continuous-time Markov chain modeling the spread of infections on graphs. In this model, vertices are either susceptible, infected, or recovered. Each infected vertex becomes recovered at rate 1 and infects each of its susceptible neighbors independently at rate λ, and each recovered vertex becomes susceptible at a rate ϱ, which we assume to be independent of the graph size. A central quantity of the SIRS process is the time until no vertex is infected, known as the survival time. Surprisingly though, to the best of our knowledge, all known rigorous theoretical results that exist so far immediately carry over from the related SIS model and do not completely explain the behavior of the SIRS process. We address this imbalance by conducting theoretical analyses of the SIRS process via the expansion properties of the underlying graph.

Our first result shows that the expected survival time of the SIRS process on stars is at most polynomial in the graph size for any value of λ. This behavior is fundamentally different from the SIS process, where the expected survival time is exponential already for small infection rates. This raises the question of which graph properties result in an exponential survival time. Our main result is an exponential lower bound of the expected survival time of the SIRS process on expander graphs. Specifically, we show that on expander graphs G with n vertices, degree close to d, and sufficiently small spectral expansion, the SIRS process has expected survival time at least exponential in n when $\mathit{\lambda }\ge c∕d$ for a constant $c>1$. Previous results on the SIS process show that this bound is almost tight. Additionally, our result holds even if G is a subgraph. Notably, our result implies an almost-tight threshold for Erdős–Rényi graphsand a regime of exponential survival time for complex network models. The proof of our main result draws inspiration from Lyapunov functions used in mean-field theory to devise a two-dimensional potential function and from applying a negative-drift theorem to show that the expected survival time is exponential.

We construct random walks on free products of the form ${\mathbb{Z}}^3\ast {\mathbb{Z}}^d$, with $d=5$ or 6 which are divergent and not spectrally positive recurrent. We then derive a local limit theorem for these random walks, proving that ${\mathrm{\mu }}^{\ast n}(e)\sim C{R}^{-n}{n}^{-5∕3}$ if $d=5$ and ${\mathrm{\mu }}^{\ast n}(e)\sim C{R}^{-n}{n}^{-3∕2}log{(n)}^{-1∕2}$ if $d=6$, where ${\mathrm{\mu }}^{\ast n}$ is the nth convolution power of μ and R is the inverse of the spectral radius of μ. This disproves a result of Candellero and Gilch [7] and a result of the authors of this paper that was stated in a first version of [12]. This also shows that the classification of local limit theorems on free products of the form ${\mathbb{Z}}^{d_1}\ast {\mathbb{Z}}^{d_2}$ or more generally on relatively hyperbolic groups with respect to virtually abelian subgroups is incomplete.

We study a natural growth process with competition, modeled by two first passage percolation processes, ${FPP}_1$ and ${FPP}_{\mathit{\lambda }}$, spreading on a graph. ${FPP}_1$ starts at the origin and spreads at rate 1, whereas ${FPP}_{\mathit{\lambda }}$ starts from a random set of inactive seeds distributed as Bernoulli percolation of parameter $\mathrm{\mu }\in (0,1)$. A seed of ${FPP}_{\mathit{\lambda }}$ gets activated when one of the two processes attempts to occupy its location, and from this moment onwards spreads at some fixed rate $\mathit{\lambda }>0$. In previous works [17, 3, 7] it has been shown that when both μ or λ are small enough, then ${FPP}_1$ survives (i.e., it occupies an infinite set of vertices) with positive probability. It might seem intuitive that decreasing μ or λ is beneficial to ${FPP}_1$. However, we prove that, in general, this is indeed false by constructing a graph for which the probability that ${FPP}_1$ survives is not a monotone function of μ or λ, implying the existence of multiple phase transitions. This behavior contrasts with other natural growth processes such as the 2-type Richardson model.

A lemniscate of a complex polynomial $Q_n$ of degree n is a sublevel set of its modulus, i.e., of the form $\{z\in \mathbb{C}:|Q_n(z)|<t\}$ for some $t>0$. In general, the number of connected components of a unit lemniscate (i.e. for $t=1$) can vary anywhere between 1 and n. In this paper, we study the expected number of connected components for two models of random lemniscates. First, we show that the expected number of connected components of lemniscates whose defining polynomial has i.i.d. roots chosen uniformly from $\mathbb{D}$, is bounded above and below by a constant multiple $\sqrt{n}$. On the other hand, if the i.i.d. roots are chosen uniformly from ${\mathbb{S}}^1$, we show that the expected number of connected components, divided by n, converges to $\frac{1}{2}$.

We consider the strongly connected components (SCCs) of a uniform directed graph on n vertices with i.i.d. in- and out-degree pairs distributed as $(D^{-},D^{+})$, with $\mathbb{E}[D^{+}]=\mathbb{E}[D^{-}]=\mathrm{\mu }$, conditioned on equal total in- and out-degree. A phase transition for the emergence of a giant SCC is known to occur when $\mathbb{E}[D^{-}{D}^{+}]$ is at the critical value μ. We study the model at this critical value and, additionally, require $\mathbb{E}[{(D^{-})}^3]$, $\mathbb{E}[{(D^{+})}^3]$, $\mathbb{E}[D^{-}{(D^{+})}^3]$ and $\mathbb{E}[{(D^{-})}^3{D}^{+}]$ to be finite. Under these conditions, we show that the SCCs ranked by decreasing number of edges with distances rescaled by $n^{-1∕3}$ converge in distribution to a sequence of finite strongly connected directed multigraphs with edge lengths, and that these are either 3-regular or loops. The limit objects lie in a 3-parameter family, which contains the scaling limit of the SCCs in the directed Erdős-Rényi model at criticality as found by Goldschmidt and Stephenson (2019). This is the first universality result for the scaling limit of a critical directed graph model and the first quantitative result on the directed configuration model at criticality. As a direct consequence, the largest SCCs at criticality contain $\mathrm{\Theta }(n^{1∕3})$ vertices and edges in probability, and the diameter of the directed graph at criticality is $\mathrm{\Omega }(n^{1∕3})$ in probability. We use a metric on the space of weighted multigraphs in which two multigraphs are close if there are compatible isomorphisms between their vertex and edge sets which roughly preserve the edge lengths. The topology used is the product topology on the sequence of multigraphs. Our method of proof involves a depth-first exploration of the directed graph, resulting in a spanning forest with additional identifications, of which we study the limit under rescaling.

We prove pathwise large-deviation principles of switching Markov processes by exploiting the connection to associated Hamilton-Jacobi equations, following Jin Feng’s and Thomas Kurtz’s method [13]. In the limit that we consider, we show how the large-deviation problem in path-space reduces to a spectral problem of finding principal eigenvalues. The large-deviation rate functions are given in action-integral form. As an application, we demonstrate how macroscopic transport properties of stochastic models of molecular motors can be deduced from an associated principal-eigenvalue problem. The precise characterization of the macroscopic velocity in terms of principal eigenvalues confirms that breaking of detailed balance is necessary for obtaining transport. In this way, we extend and unify several existing results about molecular motors and place them in the framework of stochastic processes and large-deviation theory.

We present a coupling framework to upper bound the total variation mixing time of various Metropolis-adjusted, gradient-based Markov kernels in the ‘high acceptance regime’. The approach uses a localization argument to boost local mixing of the underlying unadjusted kernel to mixing of the adjusted kernel when the acceptance rate is suitably high. As an application, mixing time guarantees are developed for a non-reversible, adjusted Markov chain based on the kinetic Langevin diffusion, where little is currently understood.

The paper concerns classical solution of path-dependent partial differential equations (PPDEs) with coefficients depending on both variables of path and path-valued measure, which are crucial to understanding large-scale mean-field interacting systems in a non-Markovian setting. We construct classical solutions of the PPDEs via solution of the forward and backward stochastic differential equations. To accommodate the intricacies introduced by the appearance of the path in the coefficients, we develop a novel technique known as the “parameter frozen” approach to the PPDEs.

We prove sample path moderate deviation principles (MDP) for the current and the tagged particle in the symmetric simple exclusion process, which extends the results in [39], where the MDP was only proved at any fixed time.

Generalized Pólya urns with non-linear feedback are an established probabilistic model to describe the dynamics of growth processes with reinforcement, a generic example being competition of agents in evolving markets. It is well known which conditions on the feedback mechanism lead to monopoly where a single agent achieves full market share, and various further results for particular feedback mechanisms have been derived from different perspectives. In this paper we provide a comprehensive account of the possible asymptotic behaviour for a large general class of feedback, and describe in detail how monopolies emerge in a transition from sub-linear to super-linear feedback via hierarchical states close to linearity. We further distinguish super- and sub-exponential feedback, which show conceptually interesting differences to understand the monopoly case, and study robustness of the asymptotics with respect to initial conditions, heterogeneities and small changes of the feedback mechanisms. Finally, we derive a scaling limit for the full time evolution of market shares in the limit of diverging initial market size, including the description of typical fluctuations and extending previous results in the context of stochastic approximation.

We consider the averaging process on the discrete d-dimensional torus. On this graph, the process is known to converge to equilibrium on diffusive timescales, not exhibiting cutoff. In this work, we refine this picture in two ways. Firstly, we prove a concentration phenomenon of the averaging process around its mean, occurring on a shorter timescale than the one of its relaxation to equilibrium. Secondly, we establish sharp gradient estimates, which capture its fast local smoothness property. This is the first setting in which these two features of the averaging process — concentration and local smoothness — can be quantified. These features carry useful information on a number of large scale properties of the averaging process. As an illustration of this fact, we determine the limit profile of its distance to equilibrium and derive a quantitative hydrodynamic limit for it. Finally, we discuss their implications on cutoff for the binomial splitting process, the particle analogue of the averaging process.

Let $p,q\in (0,\mathrm{\infty }]$ and ${\ell }_p^m({\ell }_q^n)$ be the mixed-norm sequence space of real matrices $x={(x_{i,j})}_{i\le m,j\le n}$ endowed with the (quasi-)norm $\Vert x{\Vert }_{p,q}:={\Vert {(\Vert {(x_{i,j})}_{j\le n}{\Vert }_q)}_{i\le m}\Vert }_p$. We shall prove a Poincaré–Maxwell–Borel lemma for suitably scaled matrices chosen uniformly at random in the ${\ell }_p^m({\ell }_q^n)$-unit balls ${\mathbb{B}}_{p,q}^{m,n}$, and obtain both central and non-central limit theorems for their ${\ell }_p({\ell }_q)$-norms. We use those limit theorems to study the asymptotic volume distribution in the intersection of two mixed-norm sequence balls. Our approach is based on a new probabilistic representation of the uniform distribution on ${\mathbb{B}}_{p,q}^{m,n}$.

We prove the existence and weak uniqueness of weak solutions of Itô’s stochastic time dependent equations with irregular diffusion and drift terms of Morrey class with mixed norms.

Let $W_N(\mathit{\beta })={\mathrm{E}}_0\left[e^{{\sum }_{n=1}^N\mathit{\beta }\mathit{\omega }(n,S_n)-N{\mathit{\beta }}^2∕2}\right]$ be the partition function of a two-dimensional directed polymer in a random environment, where $\mathit{\omega }(i,x),i\in \mathbb{N},x\in {\mathbb{Z}}^2$ are i.i.d. standard normal and $\{S_n\}$ is the path of a simple random walk. With $\mathit{\beta }={\mathit{\beta }}_N=\hat{\mathit{\beta }}\sqrt{\mathrm{\pi }∕logN}$ and $\hat{\mathit{\beta }}\in (0,1)$ (the subcritical window), $log{W}_N({\mathit{\beta }}_N)$ is known to converge in distribution to a Gaussian law of mean $-{\mathit{\lambda }}^2∕2$ and variance ${\mathit{\lambda }}^2$, with ${\mathit{\lambda }}^2=log(1∕(1-{\hat{\mathit{\beta }}}^2))$ (Caravenna, Sun, Zygouras, Ann. Appl. Probab. (2017)). We study in this paper the moments $\mathbb{E}[W_N{({\mathit{\beta }}_N)}^q]$ in the subcritical window, and prove a lower bound that matches to leading order, for $q=O(\sqrt{logN})$, the upper bound derived by us in Cosco, Zeitouni, Comm. Math. Phys. (2023). The analysis is based on appropriate decouplings and a Poisson convergence that uses the method of “two moments suffice”.

We prove two-sided Chevet-type inequalities for independent symmetric Weibull random variables with shape parameter $r\in [1,2]$. We apply them to provide two-sided estimates for operator norms from ${\ell }_p^n$ to ${\ell }_q^m$ of random matrices ${(a_i{b}_j{X}_{i,j})}_{i\le m,j\le n}$, in the case when $X_{i,j}$’s are iid symmetric Weibull variables with shape parameter $r\in [1,2]$ or when X is an isotropic log-concave unconditional random matrix. We also show how these Chevet-type inequalities imply two-sided bounds for maximal norms from ${\ell }_p^n$ to ${\ell }_q^m$ of submatrices of X in both Weibull and log-concave settings.

The self-repelling random walk with directed edges was introduced by Tóth and Vető in 2008 [23] as a nearest-neighbor random walk on ℤ that is non-Markovian: at each step, the probability to cross a directed edge depends on the number of previous crossings of this directed edge. Tóth and Vető found this walk to have a very peculiar behavior, and conjectured that, denoting the walk by ${(X_m)}_{m\in \mathbb{N}}$, for any $t\ge 0$ the quantity $\frac{1}{\sqrt{N}}{X}_{\lfloor Nt\rfloor }$ converges in distribution to a non-trivial limit when N tends to $+\mathrm{\infty }$, but the process ${(\frac{1}{\sqrt{N}}{X}_{\lfloor Nt\rfloor })}_{t\ge 0}$ does not converge in distribution. In this paper, we prove not only that ${(\frac{1}{\sqrt{N}}{X}_{\lfloor Nt\rfloor })}_{t\ge 0}$ admits no limit in distribution in the standard Skorohod topology, but more importantly that the trajectories of the random walk still satisfy another limit theorem, of a new kind. Indeed, we show that for n suitably smaller than N and $T_N$ in a large family of stopping times, the process ${(\frac{1}{n}(X_{T_N+t{n}^{3∕2}}-X_{T_N}))}_{t\ge 0}$ admits a non-trivial limit in distribution. The proof partly relies on combinations of reflected and absorbed Brownian motions which may be interesting in their own right.

We derive upper and lower bounds for the right and left tails of the O’Connell-Yor polymer of the correct order of magnitude via probabilistic and geometric techniques in the moderate deviations regime. This result has not previously been obtained even by the methods of integrable probability. The inputs of our work are an identity for the generating function of a two-parameter model of Rains and Emrah-Janjigian-Seppäläinen, and the geometric techniques of Ganguly-Hegde and Basu-Ganguly-Hammond-Hegde. As an intermediate result we obtain strong tail estimates for the transversal fluctuation of the polymer path from the diagonal.

We introduce weaves, which are random sets of non-crossing càdlàg paths that cover space-time $\bar{\mathbb{R}}\times \bar{\mathbb{R}}$. The Brownian web is one example of a weave, but a key feature of our work is that we do not assume that the particle motions have any particular distribution. Rather, we present a general theory of the structure, characterization and weak convergence of weaves.

We show that the space of weaves has an appealing geometry, involving a partition into equivalence classes under which each equivalence class contains a pair of distinguished objects known as a web and a flow. Webs are natural generalizations of the Brownian web and the flows provide pathwise representations of stochastic flows. Moreover, there is a natural partial order on the space of weaves, characterizing the efficiency with which paths cover space-time, under which webs are precisely minimal weaves and flows are precisely maximal weaves. This structure is key to establishing weak convergence criteria for general weaves, based on weak convergence of finite collections of particle motions.

We study the following question: What is the largest deterministic amount of time $T_{\ast }$ that a suitably normalized martingale X can be kept inside a convex body K in ${\mathbb{R}}^d$? We show, in a viscosity framework, that $T_{\ast }$ equals the time it takes for the relative boundary of K to reach $X(0)$ as it undergoes a geometric flow that we call (positive) minimum curvature flow. This result has close links to the literature on stochastic and game representations of geometric flows. Moreover, the minimum curvature flow can be viewed as an arrival time version of the Ambrosio–Soner codimension-$(d-1)$ mean curvature flow of the 1-skeleton of K. Our results are obtained by a mix of probabilistic and analytic methods.

We address an optimal stopping problem over the set of Bermudan-type strategies Θ (which we understand in a more general sense than the stopping strategies for Bermudan options in finance) and with non-linear operators (non-linear evaluations) assessing the rewards, under general assumptions on the non-linear operators ρ. We provide a characterization of the value family V in terms of what we call the $(\mathrm{\Theta },\mathit{\rho })$-Snell envelope of the pay-off family. We establish a Dynamic Programming Principle. We provide an optimality criterion in terms of a $(\mathrm{\Theta },\mathit{\rho })$-martingale property of V on a stochastic interval. We investigate the $(\mathrm{\Theta },\mathit{\rho })$-martingale structure and we show that the “first time” when the value family coincides with the pay-off family is optimal. The reasoning simplifies in the case where there is a finite number n of pre-described stopping times, where n does not depend on the scenario ω. We provide examples of non-linear operators entering our framework.

We introduce asymptotic Rényi entropies as a parameterized family of invariants for random walks on groups. These invariants interpolate between various well-studied properties of the random walk, including the growth rate of the group, the Shannon entropy, and the spectral radius. They furthermore offer large deviation counterparts of the Shannon-McMillan-Breiman Theorem. We prove some basic properties of asymptotic Rényi entropies that apply to all groups, and discuss their analyticity and positivity for the free group and lamplighter groups.

We consider critical percolation on a supercritical Galton–Watson tree. We show that, when the offspring distribution is in the domain of attraction of an α-stable law for some $\mathit{\alpha }\in (1,2)$, or has finite variance, several annealed properties also hold in a quenched setting. In particular, the following properties hold for the critical root cluster on almost every realisation of the tree: (1) the rescaled survival probabilities converge; (2) the Yaglom limit or its stable analogue hold – in particular, conditioned on survival, the number of vertices at generation n that are connected to the root cluster rescale to certain (explicit) random variable; (3) conditioned on initial survival, the sequence of generation sizes in the root cluster rescales to a continuous–state branching process. This strengthens some earlier results of Michelen (2019) who proved (1) and (2) in the case where the initial tree has an offspring distribution with all moments finite.

In this paper we take a probabilistic look at Maclaurin’s inequality, which is a refinement of the classical AM–GM mean inequality. In a natural randomized setting, we obtain limit theorems and show that a reverse inequality holds with high probability. By its definition, Maclaurin’s inequality is naturally related to U-statistics. More precisely, given $x_1,\dots ,x_n,p\in (0,\mathrm{\infty })$ and $k\in \mathbb{N}$ with $k\le n$, let us define the quantity

$$S_{k,p}^{(n)}={({\left(\genfrac{}{}{0.0pt}{}{n}{k}\right)}^{-1}\sum _{1\le i_1<\cdots <i_k\le n}{x}_{i_1}^p\cdots x_{i_k}^p)}^{1∕(kp)}.$$

Then as a consequence of the classical Maclaurin inequalities, we know that $S_{k_1,p}^{(n)}\ge S_{k_2,p}^{(n)}$ for $k_1<k_2$. In the present article we consider the ratio

$${\mathcal{R}}_{k_1,k_2,p}^{(n)}:=\frac{S_{k_2,p}^{(n)}}{S_{k_1,p}^{(n)}},$$

evaluated at a random vector $(X_1,\dots ,X_n)$ sampled either from the normalized surface measure on the ${\ell }_p^n$-sphere or from a distribution generalizing both the uniform distribution on the ${\ell }_p^n$-ball and the cone measure on the ${\ell }_p^n$-sphere; by the Maclaurin inequality, we always have ${\mathcal{R}}_{k_1,k_2,p}^{(n)}\le 1$. We derive central limit theorems for ${\mathcal{R}}_{k_1,k_2,p}^{(n)}$ and ${\mathcal{R}}_{k_1,n,p}^{(n)}$ as well as Berry–Esseen bounds and a moderate deviations principle for ${\mathcal{R}}_{k_1,n,p}^{(n)}$, keeping $k_1$, $k_2$ fixed, in order to quantify the set of points where ${\mathcal{R}}_{k_1,k_2,p}^{(n)}>c$ for $c\in (0,1)$, i.e., where the Maclaurin inequality is reversed up to a factor. The present aricle partly generalizes results concerning the AM–GM inequality obtained by Kabluchko, Prochno, and Vysotsky (2020), Thäle (2021), and Kaufmann and Thäle (2023+).

We show that for $p>1$ there is no p-cyclically monotone stationary matching of two independent Poisson processes in dimension $d=2$. The proof combines the p-harmonic approximation result from [15, Theorem 1.1] with local asymptotics for the two-dimensional matching problem. Moreover, we prove a.s. local upper bounds of the correct order in the case $p>1$, which, to the best of our knowledge, are not readily available in the current literature.

We study the existence and regularity of local times for general d-dimensional stochastic processes. We give a general condition for their existence and regularity properties. To emphasize the contribution of our results, we show that they include various prominent examples, among others solutions to stochastic differential equations driven by fractional Brownian motion, where the behavior of the local time was not fully understood up to now and remained as an open problem in the stochastic analysis literature. In particular this completes the picture regarding the local time behavior of such equations, above all includes all possible dimensions and Hurst parameters. As other main examples, we also show that by using our general approach, one can quite easily cover and extend some recently obtained results on the local times of the Rosenblatt process and Gaussian quasi-helices.

This article explores the connection between a generalized Riesz electric energy and norms on the set of probability measures defined in terms of duality. We derive functional inequalities linking these two notions, recovering and generalizing existing Coulomb transport inequalities. We then use them to prove concentration of measure around the equilibrium and thermal equilibrium measures. Finally, we leverage these concentration inequalities to obtain Moser-Trudinger-type inequalities, which may also be interpreted as bounds on the Laplace transform of fluctuations.

In this paper, we study the law of the local time processes $(L_T^x(X),x\in \mathbb{R})$ associated to a spectrally negative Lévy process X, in the cases $T={\mathit{\tau }}_a^{+}$, the first passage time of X above $a>0$ and $T=\mathit{\tau }(c)$, the first time it accumulates c units of local time at zero. We describe the branching like structure of local times and Poissonian constructions of them using excursion theory. The presence of jumps for X creates a type of excursions which can contribute simultaneously to local times of levels above and below a given reference point. This fact introduces dependency on local times, causing them to be non-Markovian. Nonetheless, the overshoots and undershoots of excursions will be useful to analyze this dependency. In both cases, local times are infinitely divisible and we give a description of the corresponding Lévy measures in terms of excursion measures. These are hence analogues in the spectrally negative Lévy case of the first and second Ray-Knight theorems, originally stated for the Brownian motion.

This article studies the limit of binary search trees drawn from Mallows permutations under various topologies. The main result, pertaining to the standard local topology for graphs, requires the introduction of a generalization of binary search trees to two-sided infinite sequences, referred to as redwood trees. We then show that the almost-sure local limit of finite Mallows trees is the redwood tree drawn from the two-sided infinite Mallows permutation, thus corresponding to swapping the local limit and the binary search tree structure.

Building off this result, we study various other natural topologies: the rooted topology of the local structure around the root, the Gromov-Hausdorff-Prokhorov topology of the tree seen as a metric space, the pointwise convergence of the contour function, and the subtree size topology of the ratio of nodes split between left and right subtrees. The limit of Mallows trees under these four topologies combined with the case of the local topology allow us to draw a global picture of what large Mallows trees look like from different perspective and further strengthen the relation between finite and infinite Mallows permutations.