Related papers: Reply to 'Comments on Graphon Signal Processing' […
In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…
The proofs of Theorem 3.1 and Corollary 4.1 in Le\~ao and Ohashi (2013) are incomplete. The reason is a wrong statement in Remark 2.2. The hypotheses and statements of Theorem 3.1 and Corollary 4.1 in Le\~ao and Ohashi (2013) remain…
Let $G$ be a bridgeless graph, $C$ is a circuit of $G$. Fan proposed a conjecture that if $G/C$ admits a nowhere-zero 4-flow, then $G$ admits a 4-flow $(D,f)$ such that $E(G)-E(C)\subseteq$ supp$(f)$ and $|\textrm{supp}(f)\cap…
Large-scale graph machine learning is challenging as the complexity of learning models scales with the graph size. Subsampling the graph is a viable alternative, but sampling on graphs is nontrivial as graphs are non-Euclidean. Existing…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
Because of several technological limitations of traditional silicon based computing, for past few years a paradigm shift, from silicon to carbon, is occurring in computational world. DNA computing has been considered to be quite promising…
In this corrigendum, an error in the proof of a theorem in [Linear Algebra and its Applications 509 (2016) 82--113] is pointed out. This theorem states that every graph $T_n$ consisting of $n-2$ triangles sharing a common base is SPN. An…
We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons. We give a transference statement that allows us to switch…
This paper focuses on spectral filters on graphs, namely filters defined as elementwise multiplication in the frequency domain of a graph. In many graph signal processing settings, it is important to transfer a filter from one graph to…
We consider the problem of designing spectral graph filters for the construction of dictionaries of atoms that can be used to efficiently represent signals residing on weighted graphs. While the filters used in previous spectral graph…
The purpose of this erratum and addendum is to correct the errors in [1]. It consists of five components: 1. Lemma 7.1 and Proposition 7.2 are wrong and discarded; 2. A new proof of existence $\lambda(\xi)$ in (7.1) without Proposition 7.2;…
We introduce a multi-windowed graph Fourier transform (MWGFT) for the joint vertex-frequency analysis of signals defined on graphs. Building on generalized translation and modulation induced by the graph Laplacian, the proposed framework…
A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.
The rule $\mathrm{Defeated}(x) \leftarrow \mathrm{Attacks}(y,x),\, \neg \, \mathrm{Defeated}(y)$, evaluated under the well-founded semantics (WFS), yields a unique 3-valued (skeptical) solution of an abstract argumentation framework (AF).…
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
A spanner is a sparse subgraph that approximately preserves the pairwise distances of the original graph. It is well known that there is a smooth tradeoff between the sparsity of a spanner and the quality of its approximation, so long as…
In recent years, Graph Neural Network (GNN) has bloomly progressed for its power in processing graph-based data. Most GNNs follow a message passing scheme, and their expressive power is mathematically limited by the discriminative ability…
For the four-color theorem that has been developed over one and half centuries, all people believe it right but without complete proof convincing all1-3. Former proofs are to find the basic four-colorable patterns on a planar graph to…
In this note we fill a gap in the proof of the main theorem (Theorem 1.2) of our paper 'Surfaces in 4-manifolds', Math. Res. Letters 4 (1997), 907-914.
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…