Related papers: Classification and statistics of cut and project s…

We classify measures on $\{0,1\}^{\mathbb{Z}^d}$, $d \geq 3$, the space of subsets of $\mathbb{Z}^d$, which are invariant under all affine special linear transformations. In other words, we classify simple point processes on $\mathbb{Z}^d$…

For quasicrystals of cut-and-project type in $\mathbb{R}^d$, it was proved by Marklof and Str\"ombergsson that the limit local statistical properties of the directions to the points in the set are described by certain…

In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and…

The general aim of manifold estimation is reconstructing, by statistical methods, an $m$-dimensional compact manifold $S$ on ${\mathbb R}^d$ (with $m\leq d$) or estimating some relevant quantities related to the geometric properties of $S$.…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

Cut and project sets are obtained by taking an irrational slice of a lattice and projecting it to a lower dimensional subspace, and are fully characterised by the shape of the slice (window) and the choice of the lattice. In this context we…

By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…

We show that any translate of a model set is a model set in some modified cut-and-project scheme. Restricting to Euclidean direct space, we show that any translate of an inter model set is a model set in some modified cut-and-project scheme…

Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…

We define a latent structure model (LSM) random graph as a random dot product graph (RDPG) in which the latent position distribution incorporates both probabilistic and geometric constraints, delineated by a family of underlying…

In regression analysis, associations between continuous predictors and the outcome are often assumed to be linear. However, modeling the associations as non-linear can improve model fit. Many flexible modeling techniques, like (fractional)…

We study the set S of ergodic probability Borel measures on stationary non-simple Bratteli diagrams which are invariant with respect to the tail equivalence relation. Equivalently, the set S is formed by ergodic probability measures…

We define a large class of continuous time multifractal random measures and processes with arbitrary log-infinitely divisible exact or asymptotic scaling law. These processes generalize within a unified framework both the recently defined…

In this paper, we introduce the statistically multiplicative convergent sequences in locally solid Riesz algebras with respect to the algebra multiplication and the solid topology. We study on this concept and we give the notion of…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

This paper investigates new properties concerning the multifractal structure of a class of statistically self-similar measures. These measures include the well-known Mandelbrot multiplicative cascades, sometimes called independent random…

Using the Palm measure notion, we prove the existence of the diffraction measure of all stationary and ergodic point processes. We get precise expressions of those measures in the case of specific processes : stochastic subsets of Z^d, sets…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…

We define a large class of multifractal random measures and processes with arbitrary log-infinitely divisible exact or asymptotic scaling law. These processes generalize within a unified framework both the recently defined log-normal…

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…