Related papers: SL_2(R)-developments and Signature Asymptotics for…
A homomorphism of a signed graph $(G, \sigma)$ to $(H, \pi)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and the product of signs of closed walks are preserved.…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
It has been shown by various authors under different assumptions that the diameter of a bounded non-trivial set $\gamma$ under the action of a stochastic flow grows linearly in time. We show that the asymptotic linear expansion speed if…
We introduce a continuous domain framework for the recovery of a planar curve from a few samples. We model the curve as the zero level set of a trigonometric polynomial. We show that the exponential feature maps of the points on the curve…
We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarithm of the number of claw-free graphs of edge density $\gamma…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…
An st-shortest path, or st-path for short, in a graph G is a shortest (induced) path from s to t in G. Two st-paths are said to be adjacent if they differ on exactly one vertex. A reconfiguration sequence between two st-paths P and Q is a…
This is the second of two papers but has been written so as to have minimal dependence on the first paper (which is also on this archive). Let G be a group and let M be a CAT(0) proper metric space (e.g. a simply connected complete…
For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…
Dujmovi\'c et al. [\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
The Einstein action for the gravitational field has some properties which make of it, after quantization, a rare prototype of systems with quantum configurations that do not have a classical analogue. Assuming spherical symmetry in order to…
We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element $ds$. Its unitary representations correspond to Riemannian metrics and Spin…
We study the asymptotic properties of nearest-neighbor random walks in 1d random environment under the influence of an external field of intensity $\lambda\in\mathbb{R}$. For ergodic shift-invariant environments, we show that the limiting…
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…
A bounded curvature path is a continuously differentiable piece-wise $C^2$ path with bounded absolute curvature connecting two points in the tangent bundle of a surface. These paths have been widely considered in computer science and…
We use the notion of generalized signatures at a singularity of a smooth curve of symmetric bilinear forms to determine a formula for the computation of the Maslov index in the case of a real-analytic path having possibly non transversal…
This paper proves fixed domain asymptotic results for estimating a smooth invertible transformation $f:\Bbb{R}^2\to\Bbb{R}^2$ when observing the deformed random field $Z\circ f$ on a dense grid in a bounded, simply connected domain…