相关论文: Node resistance curvature in Cartesian graph produ…

In network theory, the concept of effective resistance is a distance measure on a graph that relates the global network properties to individual connections between nodes. In addition, the Kron reduction method is a standard tool for…

In this work, we study various properties of embedded hypersurfaces in $1+1+2$ decomposed spacetimes with a preferred spatial direction, denoted $e^{\mu}$, which are orthogonal to the fluid flow velocity of the spacetime and admit a proper…

Are Graph Neural Networks (GNNs) fair? In many real world graphs, the formation of edges is related to certain node attributes (e.g. gender, community, reputation). In this case, standard GNNs using these edges will be biased by this…

Today graphene nanoribbons and other graphene-based nanostructures can be synthesized with atomic precision. But while investigations have concentrated on straight graphene ribbons of fixed crystal orientation, ribbons with intrinsic…

We study attracting graphs of step skew products from the topological and ergodic points of view where the usual contracting-like assumptions of the fiber dynamics are replaced by weaker merely topological conditions. In this context, we…

We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish…

We revisit the problem of prescribing negative Gauss curvature for graphs embedded in $\mathbb R^{n+1}$ when $n\geq 2$. The problem reduces to solving a fully nonlinear Monge-Amp\`ere equation that becomes hyperbolic in the case of negative…

Contrastive learning methods have attracted considerable attention due to their remarkable success in analyzing graph-structured data. Inspired by the success of contrastive learning, we propose a novel framework for contrastive…

Graph neural networks (GNNs), consisting of a cascade of layers applying a graph convolution followed by a pointwise nonlinearity, have become a powerful architecture to process signals supported on graphs. Graph convolutions (and thus,…

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

This paper contains the proofs of Theorems 2 and 3 of the article entitled Random Electrical Networks on Complete Graphs, written by the same authors and published in the Journal of the London Mathematical Society, vol. 30 (1984), pp.…

In his seminal paper from 1952 Dirac showed that the complete graph on $n\geq 3$ vertices remains Hamiltonian even if we allow an adversary to remove $\lfloor n/2\rfloor$ edges touching each vertex. In 1960 Ghouila-Houri obtained an…

In this work, we study graphs in $\M^n\times\Real$ that are evolving by the mean curvature flow over a bounded domain on $\M^n$, with prescribed contact angle in the boundary. We prove that solutions converge to translating surfaces in…

The aim of this work is to investigate the nonnegative signed domination number $\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\gamma^{NN}_s$ for regular graphs and prove…

In this paper, we study the robustness of graph convolutional networks (GCNs). Despite the good performance of GCNs on graph semi-supervised learning tasks, previous works have shown that the original GCNs are very unstable to adversarial…

We study the evolution of convex complete non-compact graphs by positive powers of Gauss curvature. We show that if the initial complete graph has a local uniform convexity, then the graph evolves by any positive power of Gauss curvature…

The remarkable electrical, optical and mechanical properties of graphene make it a desirable material for electronics, optoelectronics and quantum applications. A fundamental understanding of the electrical conductivity of graphene across a…

We study rotational surfaces in Euclidean 3-space whose Gauss curvature is given as a prescribed function of its Gauss map. By means of a phase plane analysis and under mild assumptions on the prescribed function, we generalize the…

This work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph. Consequently a graph metric, square root of effective…

We consider the Dirichlet Laplacian in infinite two-dimensional strips defined as uniform tubular neighbourhoods of curves on ruled surfaces. We show that the negative Gauss curvature of the ambient surface gives rise to a Hardy inequality…