English
Related papers

Related papers: Distality Rank

200 papers

We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…

Physics and Society · Physics 2021-08-19 Karel Devriendt , Samuel Martin-Gutierrez , Renaud Lambiotte

We describe new relations among conformal block divisors in $\operatorname{Pic}(\bar{\operatorname{M}}_{0,n})$. These relations appear from various rank-level dualities of conformal blocks on $\mathbb{P}^1$ with $n$ marked points. We also…

Algebraic Geometry · Mathematics 2015-11-24 Swarnava Mukhopadhyay

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…

Logic · Mathematics 2025-12-08 Ruiyuan Chen , David Gonzalez , Matthew Harrison-Trainor

The Non-Linear Sigma Model (NLSM) is an example of a field theory on a target space exhibiting intricate geometry. One remarkable characteristic of the NLSM is asymptotic freedom, which triggers interest in perturbative calculations. In the…

High Energy Physics - Lattice · Physics 2024-12-04 Paolo Baglioni , Francesco Di Renzo

Let $X$ be a nonempty real variety that is invariant under the action of a reflection group $G$. We conjecture that if $X$ is defined in terms of the first $k$ basic invariants of $G$ (ordered by degree), then $X$ meets a $k$-dimensional…

Algebraic Geometry · Mathematics 2017-06-08 Tobias Friedl , Cordian Riener , Raman Sanyal

Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance…

Artificial Intelligence · Computer Science 2014-04-15 Meizhu Li , Qi Zhang , Xinyang Deng , Yong Deng

Stability is a central property in learning and statistics promising the output of an algorithm $A$ does not change substantially when applied to similar datasets $S$ and $S'$. It is an elementary fact that any sufficiently stable algorithm…

Machine Learning · Computer Science 2025-02-13 Max Hopkins , Shay Moran

We consider a monopolistic seller in a market that may be segmented. The surplus of each consumer in a segment depends on the price that the seller optimally charges, which depends on the set of consumers in the segment. We study which…

Theoretical Economics · Economics 2022-10-25 Nima Haghpanah , Ron Siegel

Stability is among the most important concepts in dynamical systems. Local stability is well-studied, whereas determining how "globally stable" a nonlinear system is very challenging. Over the last few decades, many different ideas have…

Dynamical Systems · Mathematics 2022-10-10 Hana Krakovská , Christian Kühn , Iacopo P. Longo

Let $k$ be a perfect field of positive characteristic and let $X$ be a smooth irreducible quasi-compact scheme over $k$. The Drinfeld-Kedlaya theorem states that for an irreducible $F$-isocrystal on $X$, the gap between consecutive generic…

Number Theory · Mathematics 2019-02-14 Joe Kramer-Miller

Expansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of B\"uchi and Elgot & Rabin on the…

Logic in Computer Science · Computer Science 2025-07-23 Joris Nieuwveld , Joël Ouaknine

Using an analogy with the rank theorem in differential geometry, it is shown that for a finite $n$-tuple $X$ in a tracial von Neumann algebra and any finite $m$-tuple $F$ of $*$-polynomials in $n$ noncommuting indeterminates,…

Operator Algebras · Mathematics 2016-02-16 Kenley Jung

We consider the problem of ranking a set of objects based on their performance when the measurement of said performance is subject to noise. In this scenario, the performance is measured repeatedly, resulting in a range of measurements for…

Performance · Computer Science 2025-02-04 Aravind Sankaran , Lars Karlsson , Paolo Bientinesi

To quantify the fundamental evolution of time-varying networks, and detect abnormal behavior, one needs a notion of temporal difference that captures significant organizational changes between two successive instants. In this work, we…

Social and Information Networks · Computer Science 2017-08-17 Nathan D Monnig , Francois G Meyer

In the first part of the paper we study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories. Then we try to develop analogous theory for arbitrary dependent theories.

Logic · Mathematics 2011-02-19 Alf Onshuus , Alex Usvyatsov

This paper is a generalization of arXiv:0810.0808. We develop the de Rham homotopy theory of not necessarily nilpotent spaces, using closed dg-categories and equivariant dg-algebras. We see these two algebraic objects correspond in a…

Algebraic Topology · Mathematics 2020-03-09 Syunji Moriya

We consider a class of piecewise smooth one-dimensional maps with critical points and singularities (possibly with infinite derivative). Under mild summability conditions on the growth of the derivative on critical orbits, we prove the…

Dynamical Systems · Mathematics 2015-05-30 Stefano Luzzatto , Ian Melbourne

In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…

Combinatorics · Mathematics 2020-02-28 József Balogh , Béla Csaba , Yifan Jing , András Pluhár

A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…

Probability · Mathematics 2007-05-23 Larry Goldstein , Gesine Reinert

We call a singularity of a presymplectic form $\omega$ removable in its graph if its graph extends to a smooth Dirac structure over the singularity. An example for this is the symplectic form of a magnetic monopole. A criterion for the…

Symplectic Geometry · Mathematics 2018-10-09 Christian Blohmann
‹ Prev 1 8 9 10 Next ›