Related papers: The double phase problems on lattice graphs
This work introduces author's approach to harmonic analysis on algebraic groups over functional two-dimensional local fields. For a two-dimensional local field a Hecke algebra which is formed by operators which integrate…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
We study solutions to measure data elliptic systems with Uhlenbeck-type structure that involve operator of divergence form, depending continuously on the spacial variable, and exposing doubling Orlicz growth with respect to the second…
We consider the problem of finding a subgraph of a given graph minimizing the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already for bipartite graphs when the functions are convex on…
We suggest a new concept of functional-differential operators with constant delay on geometrical graphs that involves {\it global} delay parameter. Differential operators on graphs model various processes in many areas of science and…
In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special…
Given a finite connected graph $\Lambda$, the space of $SU(2)$ lattice gauge-fields on $\Lambda$, modulo gauge transformations, is a Lagrangian submanifold -- with mild singularities -- of the $SU(2)$ character variety (= phase-space of…
We consider a dual Cheeger constant $\overline h$ for finite graphs with edge weights from an arbitrary real-closed ordered field. We obtain estimates of $\overline h$ in terms of number of vertices in graph. Further, we estimate the…
We study a simple lattice model with local symmetry, whose construction is based on a crossed module of finite groups. Its dynamical degrees of freedom are associated both to links and faces of a four-dimensional lattice. In special limits…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We characterize the spectrum of the Laplacian of graphs composed of one or two finite or infinite chains connected to a complete graph. We show the existence of localized eigenvectors of two types, eigenvectors that vanish exactly outside…
Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to…
The focus of Part I of this monograph has been on both the fundamental properties, graph topologies, and spectral representations of graphs. Part II embarks on these concepts to address the algorithmic and practical issues centered round…
We generalize the concept of global moment maps to local moment maps, whose different branches are labelled by the elements of the fundamental group of the underlying symplectic manifold. These branches can be smoothly glued together by…
The double-layer potential plays an important role in solving boundary value problems for elliptic equations. All the fundamental solutions of the generalized bi-axially symmetric Helmholtz equation were known, and only for the first one…
In this paper, we study the $L(2, 1)$-Labeling of the Mycielski and the iterated Mycielski of graphs in general. For a graph $G$ and all $t\geq 1$, we give sharp bounds for $\lambda(M^t(G))$ the $L(2, 1)$-labeling number of the $t$-th…
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…
We examine the dynamics of an ensemble of phase oscillators that are divided in $k$ sets, with time-delayed coupling interactions {\em only} between oscillators in different sets or partitions. The network of interactions thus form a…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…