Related papers: SL_2(R)-developments and Signature Asymptotics for…

We study the asymptotic behaviour of the most likely trajectories of a planar random walk that result in large deviations of the area of their convex hull. If the Laplace transform of the increments is finite on $R^2$, such a scaled limit…

We introduce here a natural functional associated to any $b \in QH_* (M, \omega)$: \emph{spectral length functional}, on the space of "generalized paths" in $ \text {Ham}(M, \omega)$, closely related to both the Hofer length functional and…

This paper concerns a random walk on a planar graph and presents certain estimates concerning the harmonic measures for the walk in a grid domain which estimates are useful for showing the convergence of a LERW (loop-erased random walk) to…

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

Consider a tree $\mathbb T$, all whose vertices have countable valence; its boundary is the Baire space $\mathbb{B} \simeq\mathbb{N}^{\mathbb N}$; continued fractions expansions identify the set of irrational numbers $\mathbb{R}\setminus…

Let $\Omega\subset\mathbb{R}^n$, $n\ge 2$, be a bounded connected $C^2$ domain. For any unit vector $\nu\in\mathbb{R}^n$, let $T_{\lambda}^{\nu}=\{x\in\mathbb{R}^n:x\cdot\nu=\lambda\}$,…

Signature tensors of paths are a versatile tool for data analysis and machine learning. Recently, they have been applied to persistent homology, by embedding barcodes into spaces of paths. Among the different path embeddings, the…

In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a…

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale…

In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some…

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two…

Graphs of bounded degeneracy are known to contain induced paths of order $\Omega(\log \log n)$ when they contain a path of order $n$, as proved by Ne\v{s}et\v{r}il and Ossona de Mendez (2012). In 2016 Esperet, Lemoine, and Maffray…

We look at the automorphisms of Thompson type groups of piecewise linear homeomorphisms of the real line or circle that use slopes that are integral powers of a fixed integer n with n>2. We show that large numbers of "exotic" automorphisms…

The signature of a path is an essential object in the theory of rough paths. The signature representation of the data stream can recover standard statistics, e.g. the moments of the data stream. The classification of random walks indicates…

A signed tree model of a graph $G$ is a compact binary structure consisting of a rooted binary tree whose leaves are bijectively mapped to the vertices of $G$, together with 2-colored edges $xy$, called transversal pairs, interpreted as…

We provide a recursive classification of meander graphs, showing that each meander is identified by a unique sequence of fundamental graph-theoretic moves. This sequence is called the meander's signature. The signature not only provides a…

We study planar graphs with large negative curvature outside of a finite set and the spectral theory of Schr{\"o}dinger operators on these graphs. We obtain estimates on the first and second order term of the eigenvalue asymptotics.…

In four dimensions one can use the chiral part of the spin connection as the main object that encodes geometry. The metric is then recovered algebraically from the curvature of this connection. We address the question of how isometries can…

Degree of mobility of a (pseudo-Riemannian) metric is the dimension of the space of metrics geodesically equivalent to it. We describe all possible values of the degree of mobility on a simply connected n-dimensional manifold of lorentz…

In the context of elasticity theory, rigidity theorems allow to derive global properties of a deformation from local ones. This paper presents a new asymptotic version of rigidity, applicable to elastic bodies with sufficiently stiff…