Related papers: A pattern theorem for lattice clusters

Considered as commutative algebras, cluster algebras can be very unpleasant objects. However, the first author introduced a condition known as "local acyclicity" which implies that cluster algebras behave reasonably. One of the earliest and…

We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…

Consider a system of coalescing random walks where each individual performs random walk over a finite graph G, or (more generally) evolves according to some reversible Markov chain generator Q. Let C be the first time at which all walkers…

Each quiver appearing in a seed of a cluster algebra determines a corresponding group, which we call a cluster group, which is defined via a presentation. Grant and Marsh showed that, for quivers appearing in seeds of cluster algebras of…

Stimulated by the growing interest in the applications of complex networks framework on time series analysis, we devise a network model in which each of $N$ nodes is associated with a random walk of length $L$. Connectivity between any two…

We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…

Clustering is a widely used unsupervised learning method for finding structure in the data. However, the resulting clusters are typically presented without any guarantees on their robustness; slightly changing the used data sample or…

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…

Network models provide a powerful and flexible framework for analyzing a wide range of structured data sources. In many situations of interest, however, multiple networks can be constructed to capture different aspects of an underlying…

Mutation rate variation across loci is well known to cause difficulties, notably identifiability issues, in the reconstruction of evolutionary trees from molecular sequences. Here we introduce a new approach for estimating general…

The geometrical features of the (non-convex) loss landscape of neural network models are crucial in ensuring successful optimization and, most importantly, the capability to generalize well. While minimizers' flatness consistently…

We consider the tree-reduced path of symmetric random walk on $\ZZ^{d}$. It is interesting to ask about the number of turns $T_n$ in the reduced path after $n$ steps. This question arises from inverting signature for lattice paths. We show…

We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…

In this paper, we obtain a local limit theorem for the Kemperman's model of oscillating random walk on $\mathbb{Z}$; it extends the existing results for classical random walks on $\mathbb Z$ or reflected random walks on $\mathbb N_0$. The…

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…

Resent achievements in statistical theory, namely, a possibility to reproduce almost unlimited Mayer's activity series based on the information about their convergence radius, on the one hand, and generalization of the lattice statistics by…

Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby identify and discover 'types': of behaviour, views,…

In the first part, in the local non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We conjecture that such distributions are invariant by transposition. This would imply…

We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary…

Consider critical bond percolation on a large 2n by 2n box on the square lattice. It is well-known that the size (i.e. number of vertices) of the largest open cluster is, with high probability, of order n^2 \pi(n), where \pi(n) denotes the…