Related papers: Universality for random tensors and cycle graphs w…

This short note is a supplement to [1], in which the total variation of graph distributional signals is introduced and studied. We introduce a different formulation of total variation and relate it to the notion of edge centrality. The…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

Let M be a compact smooth manifold of dimension n with or without boundary, and f : M $\rightarrow$ R be a smooth Gaussian random field. It is very natural to suppose that for a large positive real u, the random excursion set {f $\ge$ u} is…

The Tur\'an number $\text{ex}(n,H)$ of a graph $H$ is the maximal number of edges in an $H$-free graph on $n$ vertices. In $1983$ Chung and Erd\H{o}s asked which graphs $H$ with $e$ edges minimize $\text{ex}(n,H)$. They resolved this…

We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.

Topological invariants play a key role in the characterization of topological states. Due to the existence of exceptional points, it is a great challenge to detect topological invariants in non-Hermitian systems. We put forward a dynamic…

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…

Let $G$ be a simple, connected graph on $n$ vertices, and further assume that $G$ has disjoint cycles. Let $h$ be a real symmetric matrix supported on $G$ (for example, a discrete Schr\"odinger operator). The eigenvalues of $h$ are ordered…

This paper demonstrates an approach for developing a framework to produce invariants of base-point-free generic spherical curves under some chosen local moves from Reidemeister moves using based chord diagrams. Our invariants not only…

We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…

Anomaly detection in complex domains poses significant challenges due to the need for extensive labeled data and the inherently imbalanced nature of anomalous versus benign samples. Graph-based machine learning models have emerged as a…

It is well known that tensor models for a tensor with no symmetry admit a $1/N$ expansion dominated by melonic graphs. This result relies crucially on identifying \emph{jackets} which are globally defined ribbon graphs embedded in the…

We prove the universality of the large deviations for conjugacy invariant permutations with few cycles. As an application, we establish the universality of large deviation at speeds $n$ and $\sqrt{n}$ for the length of monotone subsequences…

Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…

Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…

Let $M$ be a smooth compact manifold (maybe with boundary, maybe disconnected) of any dimension $d \ge 1$. We consider the set of $C^1$ maps $f:M\to M$ which have no absolutely continuous (with respect to Lebesgue) invariant probability…

We study the homological algebra of edge ideals of Erd\"{o}s-R\'enyi random graphs. These random graphs are generated by deleting edges of a complete graph on $n$ vertices independently of each other with probability $1-p$. We focus on some…

A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…

For random piecewise linear systems T of the interval that are expanding on average we construct explicitly the density functions of absolutely continuous T-invariant measures. In case the random system uses only expanding maps our…

We show that in any symmetric monoidal category, if a weight for colimits is absolute, then the resulting colimit of any diagram of dualizable objects is again dualizable. Moreover, in this case, if an endomorphism of the colimit is induced…