Related papers: A microlocal criterion for commuting nearby cycles
We obtain a strengthening of the principle of local reflexivity in a general form. The added strength makes local reflexivity operators respect given subspaces. Applications are given to bounded approximation properties of pairs, consisting…
We prove that, for semi-invertible linear cocycles, Oseledets subspaces associated to ergodic measures may be approximated by Oseledets subspaces associated to periodic points.
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…
We consider large random matrices $X$ with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical…
The shape and orientation of data clouds reflect variability in observations that can confound pattern recognition systems. Subspace methods, utilizing Grassmann manifolds, have been a great aid in dealing with such variability. However,…
We provide a sufficient criterion for the recurrence of spatial random graphs on the real line based on the scarceness of long-edges. In particular, this complements earlier recurrence results obtained by Gracar et al. (Electron. J. Probab.…
Uncovering the mechanism leading to the scaling law in human trajectories is of fundamental importance in understanding many spatiotemporal phenomena. We propose a hierarchical geographical model to mimic the real traffic system, upon which…
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain improved algorithms for the following problems: Approximate…
The appropriate selection of recurrence thresholds is a key problem in applications of recurrence quantification analysis and related methods across disciplines. Here, we discuss the distribution of pairwise distances between state vectors…
In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…
We analyze a three-dimensional discontinuous piecewise linear system \(Z=(X,Y)\) whose switching manifold \(\Sigma\) contains visible-visible two-fold intersection lines. Assuming that the matrices \(DX\) and \(DY\) each have one nonzero…
The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…
Modeling place functions from a computational perspective is a prevalent research topic. Trajectory embedding, as a neural-network-backed dimension reduction technology, allows the possibility to put places with similar social functions at…
A square lattice distribution of coupled oscillators that have heteroclinic cycle attractors is studied. In this system, we find a novel type of patterns that is spatially disordered and periodic in time. These patterns are limit cycle…
This paper studies Markov chains on the chambers of real hyperplane arrangements, a model that generalizes famous examples, such as the Tsetlin library and riffle shuffles. We discuss cutoff for the Tsetlin library for general weights, and…
Bike-sharing is an environmentally friendly shared mobility mode, but its self-loop phenomenon, where bikes are returned to the same station after several time usage, significantly impacts equity in accessing its services. Therefore, this…
Given a hyperbolic homeomorphism on a compact metric space, consider the space of linear cocycles over this base dynamics which are H\"older continuous and whose projective actions are partially hyperbolic dynamical systems. We prove that…
In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
We present separability criteria based on local symmetric measurements. These experimental plausible criteria are shown to be more efficient in detecting entanglement than the current counterparts by detailed examples. Furthermore, we…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…