Related papers: Lower large deviations for geometric functionals
We construct a family of closeness functions on the space of finite volume Lorentzian geometries using the abundance of discrete intervals in the underlying random causal sets. Although strictly weaker than a Lorentzian Gromov-Hausdorff…
Geometric quantiles are popular location functionals to build rank-based statistical procedures in multivariate settings. They are obtained through the minimization of a non-smooth convex objective function. As a result, the singularity of…
We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ${\mathbb{R}}^d$. The connectivity function is shown to decay superexponentially, and we…
For any finite colored graph we define the empirical neighborhood measure, which counts the number of vertices of a given color connected to a given number of vertices of each color, and the empirical pair measure, which counts the number…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We observe stationary random tessellations $X=\{\Xi_n\}_{n\ge1}$ in $\mathbb{R}^d$ through a convex sampling window $W$ that expands unboundedly and we determine the total $(k-1)$-volume of those $(k-1)$-dimensional manifold processes which…
In this paper we extend the refined second-order Poincar\'e inequality for Poisson functionals from a one-dimensional to a multi-dimensional setting. Its proof is based on a multivariate version of the Malliavin-Stein method for normal…
In this chapter we review some examples, methods, and recent results involving comparison of clustering properties of point processes. Our approach is founded on some basic observations allowing us to consider void probabilities and moment…
In this note we revisit a less known symmetrization method for functions with respect to a topological group $G$, which we call $G$-averaging. We note that, although quite non-technical in nature, this method yields $G$-invariant minimizers…
We study the statistics of level spacing of geometric resonances in the disordered binary networks. For a definite concentration $p$ within the interval $[0.2,0.7]$, numerical calculations indicate that the unfolded level spacing…
The use of discrete material representation in numerical models is advantageous due to the straightforward way it takes into account material heterogeneity and randomness, and the discrete and orientated nature of cracks. Unfortunately, it…
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
We present a new, analytic, Poisson likelihood derived, technique to account for the statistical uncertainties inherent in simulation samples of limited size. This method has better coverage properties than other techniques, is valid for…
In this paper we discuss various connections between geometric discrepancy measures, such as discrepancy with respect to convex sets (and convex sets with smooth boundary in particular), and applications to numerical analysis and…
We study large deviation probabilities for a sum of dependent random variables from a heavy-tailed factor model, assuming that the components are regularly varying. We identify conditions where both the factor and the idiosyncratic terms…
In this paper we provide new methodology for inference of the geometric features of a multivariate density in deconvolution. Our approach is based on multiscale tests to detect significant directional derivatives of the unknown density at…
While the construction of symplectic integrators for Hamiltonian dynamics is well understood, an analogous general theory for Poisson integrators is still lacking. The main challenge lies in overcoming the singular and non-linear geometric…
This text presents some basic notions in symplectic geometry, Poisson geometry, Hamiltonian systems, Lie algebras and Lie groups actions on symplectic or Poisson manifolds, momentum maps and their use for the reduction of Hamiltonian…
In recent works on the theory of machine learning, it has been observed that heavy tail properties of Stochastic Gradient Descent (SGD) can be studied in the probabilistic framework of stochastic recursions. In particular,…