相关论文: Hyperbolic volume estimates via train tracks
We establish some statistical properties of the hyperbolic times for a class of nonuniformly expanding dynamical systems. The maps arise as factors of area preserving maps of the unit square via a geometric Baker's map type construction,…
The distance between a pair of spike trains, quantifying the differences between them, can be measured using various metrics. Here we introduce a new class of spike train metrics, inspired by the Pompeiu-Hausdorff distance, and compare them…
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in…
Random hyperbolic graphs have been suggested as a promising model of social networks. A few of their fundamental parameters have been studied. However, none of them concerns their spectra. We consider the random hyperbolic graph model as…
The stickiness effect suffered by chaotic orbits diffusing in the phase space of a dynamical system is studied in this paper. Previous works have shown that the hyperbolic structures in the phase space play an essential role in causing the…
Euclidean branching Brownian motion (BBM) has been intensively studied during many decades by renowned researchers. BBM on hyperbolic space has received less attention. A profound study of Lalley and Sellke (1997) provided insight on the…
The Vol-Det Conjecture, formulated by Champanerkar, Kofman and Purcell, states that there exists a specific inequality connecting the hyperbolic volume of an alternating link and its determinant. Among the classes of links for which this…
A vertex in a graph is called central if it minimizes its maximum distance to the other vertices. The radius of a graph $G$ is the largest distance between a central vertex and the other vertices, and it is denoted by $rad(G)$. In the…
We show that the cusp volume of a hyperbolic alternating knot can be bounded above and below in terms of the twist number of an alternating diagram of the knot. This leads to diagrammatic estimates on lengths of slopes, and has some…
Suppose that the $n^2$ vertices of the grid graph $P_n^2$ are labeled, such that the set of their labels is $\{1,2,\ldots,n^2\}$. The labeling induces a walk on $P_n^2$, beginning with the vertex whose label is $1$, proceeding to the vertex…
We apply Selberg's trace formula to solve problems in hyperbolic band theory, a recently developed extension of Bloch theory to model band structures on experimentally realized hyperbolic lattices. For this purpose we incorporate the…
We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…
We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities and/or discontinuities, where the roof function defining…
In this paper we develop a statistical theory and an implementation of deep learning models. We show that an elegant variable splitting scheme for the alternating direction method of multipliers optimises a deep learning objective. We allow…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
The stochastic finite volume method offers an efficient one-pass approach for assessing uncertainty in hyperbolic conservation laws. Still, it struggles with the curse of dimensionality when dealing with multiple stochastic variables. We…
Inspired by Lelek's idea from [Disjoint mappings and the span of spaces, Fund. Math. 55 (1964), 199 -- 214], we introduce the novel notion of the span of graphs. Using this, we solve the problem of determining the \emph{maximal safety…
While spike trains are obviously not band-limited, the theory of super-resolution tells us that perfect recovery of unknown spike locations and weights from low-pass Fourier transform measurements is possible provided that the minimum…
We show that the eccentricities (and thus the centrality indices) of all vertices of a $\delta$-hyperbolic graph $G=(V,E)$ can be computed in linear time with an additive one-sided error of at most $c\delta$, i.e., after a linear time…
We study a modification of the hyperbolic circle problem: instead of all elements of a Fuchsian group $\Gamma$, we consider the double cosets by two hyperbolic subgroups. This has a geometric interpretation in terms of the number of common…