English
Related papers

Related papers: Potentials in recurrent networks: a survey

200 papers

Let $f:X\to X$ be a continuous map on a compact metric space with finite topological entropy. Further, we assume that the entropy map $\mu\mapsto h_\mu(f)$ is upper semi-continuous. It is well-known that this implies the continuity of the…

Dynamical Systems · Mathematics 2018-03-08 Christian Wolf

A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as conductors of possibly varying strengths. The Dirichlet energy form $\mathcal E$ produces a Hilbert space…

Functional Analysis · Mathematics 2011-02-01 Palle E. T. Jorgensen , Erin P. J. Pearse

This paper extends the definitions of effective resistance and effective conductance to characterize the overall relation (positive coupling or antagonism) between any two disjoint sets of nodes in a signed graph. It generalizes the…

Optimization and Control · Mathematics 2019-07-19 Yue Song , David J. Hill , Tao Liu

On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…

Dynamical Systems · Mathematics 2013-12-20 Xiaojun Cui

We show that, independently of the boundary conditions, the two phases of the 4-dimensional compact U(1) lattice gauge theory can be characterized by the presence or absence of an ``infinite'' current network, with an appropriate definition…

High Energy Physics - Lattice · Physics 2009-10-28 W. Kerler , C. Rebbi , A. Weber

We propose to view hermitian metrics on trivial holomorphic vector bundles $E\to\Omega$ as noncommutative analogs of functions defined on the base $\Omega$, and curvature as the notion corresponding to the Laplace operator or…

Complex Variables · Mathematics 2016-10-13 Laszlo Lempert

In this article we study the notion of capacity of a vertex for infinite graphs over non-Archimedean fields. In contrast to graphs over the real field monotone limits do not need to exist. Thus, in our situation next to positive and null…

Analysis of PDEs · Mathematics 2025-01-03 Florian Fischer , Matthias Keller , Anna Muranova , Noema Nicolussi

Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…

Functional Analysis · Mathematics 2011-09-15 Robert Carlson

We study the existence and uniqueness of solutions to the inverse quasi-variational inequality problem. Motivated by the neural network approach to solving optimization problems such as variational inequality, monotone inclusion, and…

Optimization and Control · Mathematics 2022-04-13 Soumitra Dey , Simeon Reich

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

Optimization and Control · Mathematics 2010-06-10 Adrian S. Lewis , C. H. Jeffrey Pang

We demonstrate two new important properties of the 1-path-norm of shallow neural networks. First, despite its non-smoothness and non-convexity it allows a closed form proximal operator which can be efficiently computed, allowing the use of…

Machine Learning · Computer Science 2020-07-16 Fabian Latorre , Paul Rolland , Nadav Hallak , Volkan Cevher

In terms of layer potential methods, this paper is devoted to study the $L^2$ boundary value problems for nonhomogeneous elliptic operators with rapidly oscillating coefficients in a periodic setting. Under a low regularity assumption on…

Analysis of PDEs · Mathematics 2018-01-30 Qiang Xu , Peihao Zhao , Shulin Zhou

This paper deals with extensions of vector-valued functions on finite graphs fulfilling distinguished minimality properties. We show that so-called lex and L-lex minimal extensions are actually the same and call them minimal Lipschitz…

Numerical Analysis · Mathematics 2019-03-13 Miroslav Bačák , Johannes Hertrich , Sebastian Neumayer , Gabriele Steidl

We prove various results connecting structural or algebraic properties of graphs and groups to conditions on their spaces of harmonic functions. In particular: we show that a group with a finitely supported symmetric measure has a…

Group Theory · Mathematics 2016-09-22 Matthew Tointon

We study the streamlines of $\infty$-harmonic functions in planar convex rings. We include convex polygons. The points where streamlines can meet are characterized: they lie on certain curves. The gradient has constant norm along…

Analysis of PDEs · Mathematics 2020-06-30 Erik Lindgren , Peter Lindqvist

It is shown that there exist Banach spaces $X,Y$, a $1$-net $\mathscr{N}$ of $X$ and a Lipschitz function $f:\mathscr{N}\to Y$ such that every $F:X\to Y$ that extends $f$ is not uniformly continuous.

Metric Geometry · Mathematics 2015-08-06 Assaf Naor

In this work it is studied a quasilinear elliptic problem in the whole space $\mathbb{R}^N$ involving the $1-$Laplacian operator, with potentials which can vanish at infinity. The Euler-Lagrange functional is defined in a space whose…

Analysis of PDEs · Mathematics 2016-11-22 G. M. Figueiredo , M. T. O. Pimenta

We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…

Functional Analysis · Mathematics 2015-02-25 Palle Jorgensen , Feng Tian

We discuss the spectrum phenomenon for Lipschitz functions on the infinite-dimensional torus. Suppose that $f$ is a measurable, real-valued, Lipschitz function on the torus $\mathbb{T}^{\infty}$. We prove that there exists a number $a \in…

Probability · Mathematics 2014-11-07 Dmitry Faifman , Bo'az Klartag

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely…

Machine Learning · Computer Science 2015-07-01 Rasmus Kyng , Anup Rao , Sushant Sachdeva , Daniel A. Spielman