Related papers: Recurrent and (strongly) resolvable graphs
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
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…
This paper focuses on stability estimates of the inverse random source problems for the polyharmonic, electromagnetic, and elastic wave equations. The source is represented as a microlocally isotropic Gaussian random field, which is defined…
In this paper we consider several families of potential non-isochronous systems and study their associated period functions. Firstly, we prove some properties of these functions, like their local behavior near the critical point or…
This paper deals with various cases of resonance, which is a fundamental concept of science and engineering. Specifically, we study the connections between periodic and unbounded solutions for several classes of equations and systems. In…
In this work we establish existence and multiplicity of solutions for elliptic problem with nonlinear boundary conditions under strong resonance conditions at infinity. The nonlinearity is resonance at infinity and the reso- nance phenomena…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…
A notion of band limited functions is considered in the case of the hyperbolic plane in its Poincare upper half-plane $\mathbb{H}$ realization. The concept of band-limitedness is based on the existence of the Helgason-Fourier transform on…
In this article we study the well-posedness (uniqueness and existence of solutions) of nonlinear elliptic Partial Differential Equations (PDEs) on a finite graph. These results are obtained using the discrete comparison principle and…
We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…
In the present paper we study stability of recurrence equations (which in particular case contain a dynamics of rational functions) generated by contractive functions defined on an arbitrary non-Archimedean algebra. Moreover,…
We study the mean-value harmonic functions on open subsets of $\mathbb{R}^n$ equipped with weighted Lebesgue measures and norm induced metrics. Our main result is a necessary condition saying that all such functions solve a certain…
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees…
This work analyzes Graph Neural Networks, a generalization of Fully-Connected Deep Neural Nets on Graph structured data, when their width, that is the number of nodes in each fullyconnected layer is increasing to infinity. Infinite Width…
A finite element method for elliptic problems with discontinuous coefficients is presented. The discontinuity is assumed to take place along a closed smooth curve. The proposed method allows to deal with meshes that are not adapted to the…
In the Network Inference problem, one seeks to recover the edges of an unknown graph from the observations of cascades propagating over this graph. In this paper, we approach this problem from the sparse recovery perspective. We introduce a…
We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undirected determinants as well as permanents for planar graphs,…