Related papers: Algorithmic complexity and soficness of shifts in …
This work introduces two strategies for training network classifiers with heterogeneous agents. One strategy promotes global smoothing over the graph and a second strategy promotes local smoothing over neighbourhoods. It is assumed that the…
An important source of high clustering coefficient in real-world networks is transitivity. However, existing approaches for modeling transitivity suffer from at least one of the following problems: i) they produce graphs from a specific…
Follow-up comment by the author: Theorem 2.2 in this paper is a special case of Theorems 1.1 and 4.1 in the article "Weighted thermodynamic formalism on subshifts and applications", Asian J. Math. 16 (2012), by J. Barral and D. J. Feng. In…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
We present an algorithm (CoDeFi) which overcomes the curse of dimensionality (CoD) in scientific computations and, especially, in mathematical finance (Fi). Our method applies a broad class of partial differential equations such as…
Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example,…
We introduce an algebraicity criteria. It has the following form: under certain conditions, an analytic subvariety of some algebriac variety over a global field $K$, if it contains many $K$-points, then it is algebraic over $K.$ This gives…
In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be…
In this paper, we show that the standard semidefinite programming (SDP) relaxation of altering current optimal power flow (AC OPF) can be equivalently reformulated as second-order cone programming (SOCP) relaxation with maximal clique- and…
If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…
The zeta and Moebius transforms over the subset lattice of $n$ elements and the so-called subset convolution are examples of unary and binary operations on set functions. While their direct computation requires $O(3^n)$ arithmetic…
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs $\Theta (n^2)$ bits…
We study automorphisms of smooth hypersurfaces in projective space $\mathbb{P}^{n+1}$ whose fixed loci have codimension at most two for $n\geq2$. While classifications of possible orders of automorphisms are known, our aim is to explore the…
We introduce an asymmetric distance in the space of learning tasks, and a framework to compute their complexity. These concepts are foundational for the practice of transfer learning, whereby a parametric model is pre-trained for a task,…
A method to compute the full hierarchy of the critical subsets of a density field is presented. It is based on a watershed technique and uses a probability propagation scheme to improve the quality of the segmentation by circumventing the…
It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…
In this paper, we will study the statistical behaviors of orbits. Firstly, we will show that for a dynamical systems have the shadowing property or almost specification property, the set of nonrecurrent points has full topological entropy.…
We investigate expansiveness, topological stability, and shadowing for continuous actions of semigroups on compact Hausdorff spaces. We characterize semigroups for which all full shifts are expansive. We show that every expansive continuous…
We study holographic solutions describing RG flows across dimensions from five-dimensional $N=2$ SCFT to SCFTs in three and two dimensions using matter-coupled $F(4)$ gauged supergravity with $ISO(3)\times U(1)$ gauge group. By performing…