相关论文: Statistical properties of braid groups in locally …

We consider finite-sheeted, regular, possibly branched covering spaces of compact surfaces with boundary and the associated liftable and symmetric mapping class groups. In particular, we classify when either of these subgroups coincides…

In the spirit of recent works on topological chaos generated by sequential rotation of infinitely thin stirrers placed in a viscous liquid, we consider the statistical properties of braiding exponent which quantitatively characterizes the…

Locally finite groups having the property that every non-cyclic subgroup contains its centralizer are completely classified.

We continue in this paper the study of locally minimal groups started in \cite{LocMin}. The minimality criterion for dense subgroups of compact groups is extended to local minimality. Using this criterion we characterize the compact abelian…

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

A representation of heterogeneous stochastic populations that are composed of sub-populations with different levels of distinguishability is introduced together with an analysis of its properties. It is demonstrated that any instance of…

A large class of positive finite presentations of the braid groups is found and studied. It is shown that no presentations but known exceptions in this class have the property that equivalent braid words are also equivalent under positive…

This is an introduction to some of the most probabilistic aspects of free probability theory.

We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…

We develop a weighted local likelihood estimate for the parameters that govern the local spatial dependency of a locally stationary random field. The advantage of this local likelihood estimate is that it smoothly downweights the influence…

We show that on groups generated by bounded activity automata, every symmetric, finitely supported probability measure has the Liouville property. More generally we show this for every group of automorphisms of bounded type of a rooted…

Generative Artificial Intelligence is emerging as an important technology, promising to be transformative in many areas. At the same time, generative AI techniques are based on sampling from probabilistic models, and by default, they come…

We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…

We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure.…

A notion of local $U$-statistic process is introduced and central limit theorems in various norms are obtained for it. This involves the development of several inequalities for $U$-processes that may be useful in other contexts. This local…

We study the structural characteristics of complex networks using the representative eigenvectors of the adjacent matrix. The probability distribution function of the components of the representative eigenvectors are proposed to describe…

We consider a discrete model that describes a locally regulated spatial population with mortality selection. This model was studied in parallel by Bolker and Pacala and Dieckmann, Law and Murrell. We first generalize this model by adding…

The main goal of this article is to introduce new quantitative characteristics of cycles in finite simple connected graphs and to establish relations of these characteristics with the stretch and spanning tree congestion of graphs. The main…

It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…

In this paper we derive an estimate on the number of local maxima of the free boundary of some variational inequalities with pointwise gradient constraints. This also gives an estimate on the number of connected components of the free…