English
Related papers

Related papers: Hypercurrents

200 papers

In this work, we present the Grounded Recurrent Neural Network (GRNN), a recurrent neural network architecture for multi-label prediction which explicitly ties labels to specific dimensions of the recurrent hidden state (we call this…

Machine Learning · Statistics 2017-05-25 Ankit Vani , Yacine Jernite , David Sontag

Persistent currents in annular geometries have played an important role in disclosing the quantum phase coherence of superconductors and mesoscopic electronic systems. Ultracold atomic gases in multiply connected traps also exhibit…

We study the possible stationary persistent supercurrents flowing on a cylindrical sample supporting a two-dimensional charged fluid. The internal dynamics of the fluid is obtained by means of an effective theory in which the fluid…

High Energy Physics - Theory · Physics 2009-10-28 Pietro Donatis , Roberto Iengo

Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and more generally, biomathematics. They are also a source of…

Combinatorics · Mathematics 2019-01-16 Mark Budden , Josh Hiller , Andrew Penland

We use the framework of "props" to study electrical circuits, signal-flow diagrams, and bond graphs. A prop is a strict symmetric monoidal category where the objects are natural numbers, with the tensor product of objects given by addition.…

Category Theory · Mathematics 2018-05-23 Brandon Coya

Research on high-$T_c$ superconductors has generally not focused on analysis of the topological structure of electronic bands in these materials. In this article we collate and discuss several well-known experimental observables that signal…

Superconductivity · Physics 2020-06-30 Vincent E. Sacksteder

The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where…

Data Structures and Algorithms · Computer Science 2013-07-23 Ross M. McConnell , Yahav Nussbaum

We describe a class of parity- and time-reversal-invariant topological states of matter which can arise in correlated electron systems in 2+1-dimensions. These states are characterized by particle-like excitations exhibiting exotic braiding…

Strongly Correlated Electrons · Physics 2011-06-07 Michael Freedman , Chetan Nayak , Kirill Shtengel , Kevin Walker , Zhenghan Wang

We describe a class of topological vector spaces admitting a mixing uniformly continuous operator group ${T_t}_{t\in\C^n}$ with holomorphic dependence on the parameter $t$. This result covers those existing in the literature. We also…

Functional Analysis · Mathematics 2012-09-06 Stanislav Shkarin

This paper proves that labelled flows are expressive enough to contain all process algebras which are a standard model for concurrency. More precisely, we construct the space of execution paths and of higher dimensional homotopies between…

Algebraic Topology · Mathematics 2021-08-24 Philippe Gaucher

A new high-level interface to multi-threading in Prolog, implemented in hProlog, is described. Modern CPUs often contain multiple cores and through high-level multi-threading a programmer can leverage this power without having to worry…

Programming Languages · Computer Science 2011-12-26 Timon Van Overveldt , Bart Demoen

Multicore parallel programming has some very difficult problems such as deadlocks during synchronizations and race conditions brought by concurrency. Added to the difficulty is the lack of a simple, well-accepted computing model for…

Programming Languages · Computer Science 2010-12-09 Yibing Wang

Textual documents are commonly connected in a hierarchical graph structure where a central document links to others with an exponentially growing connectivity. Though Hyperbolic Graph Neural Networks (HGNNs) excel at capturing such graph…

Computation and Language · Computer Science 2025-02-18 Delvin Ce Zhang , Menglin Yang , Xiaobao Wu , Jiasheng Zhang , Hady W. Lauw

We introduce the calculus of Classical Transitions (CT), which extends the research line on the relationship between linear logic and processes to labelled transitions. The key twist from previous work is registering parallelism in typing…

Logic in Computer Science · Computer Science 2018-03-06 Fabrizio Montesi , Marco Peressotti

Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…

Systems and Control · Electrical Eng. & Systems 2026-04-09 Shaoxuan Cui , Lingfei Wang , Hildeberto Jardon-Kojakhmetov , Karl Henrik Johansson , Ming Cao

We define a hierarchy of systems with topological completely positive entropy in the context of continuous countable amenable group actions on compact metric spaces. For each countable ordinal we construct a dynamical system on the…

Dynamical Systems · Mathematics 2021-08-30 Sebastián Barbieri , Felipe García-Ramos

We classify the topological terms (in a sense to be made precise) that may appear in a non-linear sigma model based on maps from an arbitrary worldvolume manifold to a homogeneous space $G/H$ (where $G$ is an arbitrary Lie group and $H…

High Energy Physics - Theory · Physics 2018-11-14 Joe Davighi , Ben Gripaios

In this paper we study the persistent homology associated with topological crackle generated by distributions with an unbounded support. Persistent homology is a topological and algebraic structure that tracks the creation and destruction…

Probability · Mathematics 2018-10-04 Takashi Owada , Omer Bobrowski

We develop a method of driving a Markov processes through a continuous flow. In particular, at the level of the transition functions we investigate an approach of adding a first order operator to the generator of a Markov process, when the…

Probability · Mathematics 2024-11-15 Lucian Beznea , Mounir Bezzarga , Iulian Cimpean

Each rule $f$ that assigns a vector $f(G)$ to an $(n+1)$-graph $G$ determines a class (or property) of $n$-manifold invariants. An invariant $v=v(M)$ is in this class if, for any triangulated manifold $|G|=M$, one has that $v(M)$ is a…

q-alg · Mathematics 2008-02-03 Jonathan Fine