相关论文: Nonstandard Graphs, Revised

In this paper we focus on subsampling stationary random processes that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum.…

The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…

How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large…

Exploiting symmetries and invariance in data is a powerful, yet not fully exploited, way to achieve better generalisation with more efficiency. In this paper, we introduce two graph network architectures that are equivariant to several…

Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…

We propose a new model of computation based on nonstandard analysis. Intuitively, the role of "algorithm" is played by a new notion of finite procedure, called Omega-invariance and inspired by physics, from nonstandard analysis. Moreover,…

The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…

Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and…

Someone knowledgeable in nonstandard analysis may get the feeling that in the nonlinear theory of generalized functions, too often one works directly on the nets and spends effort to obtain results that should be clear from general…

Hypergraph is a data structure that enables us to model higher-order associations among data entities. Conventional graph-structured data can represent pairwise relationships only, whereas hypergraph enables us to associate any number of…

Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…

Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…

In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…

Graph embedding is a transformation of nodes of a network into a set of vectors. A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information about the graph, its…

The theory of graphons is an important tool in understanding properties of large networks. We investigate a power-law random graph model and cast it in the graphon framework. The distinctively different structures of the limit graph are…

Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of…

Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…