相关论文: Multi-Parameter Analysis of Finding Minors and Sub…

A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of vertices and a series of timestamped and directed edges.…

Temporal graphs are widely used to model dynamic systems with time-varying interactions. In real-world scenarios, the underlying mechanisms of generating future interactions in dynamic systems are typically governed by a set of recurring…

The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begin with, by exploring structural observability of large-scale…

Graphs are increasingly becoming ubiquitous as models for structured data. A generative model that closely mimics the structural properties of a given set of graphs has utility in a variety of domains. Much of the existing work require that…

Electromyography (EMG) refers to a biomedical signal indicating neuromuscular activity and muscle morphology. Experts accurately diagnose neuromuscular disorders using this time series. Modern data analysis techniques have recently led to…

A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…

The search for symbolic regression models with genetic programming (GP) has a tendency of revisiting expressions in their original or equivalent forms. Repeatedly evaluating equivalent expressions is inefficient, as it does not immediately…

Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\ in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics…

Graph representation learning (also known as network embedding) has been extensively researched with varying levels of granularity, ranging from nodes to graphs. While most prior work in this area focuses on node-level representation,…

We present sublinear-time (randomized) algorithms for finding simple cycles of length at least $k\geq 3$ and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being…

In this paper, we propose a novel approach for parametric modeling of electroencephalographic (EEG) signals. It is demonstrated that the EEG signal is a mono-component non-stationary signal whose amplitude and phase (frequency) can be…

A periodic behavior is a well observed phenomena in biological and economical systems. We show that evolutionary games on graphs with imitation dynamics can display periodic behavior for an arbitrary choice of game theoretical parameters…

The analysis of electroencephalogram (EEG) waves is of critical importance for the diagnosis of sleep disorders, such as sleep apnea and insomnia, besides that, seizures, epilepsy, head injuries, dizziness, headaches and brain tumors. In…

Say that an edge of a graph $G$ dominates itself and every other edge adjacent to it. An edge dominating set of a graph $G=(V,E)$ is a subset of edges $E' \subseteq E$ which dominates all edges of $G$. In particular, if every edge of $G$ is…

Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges…

Temporal link prediction in dynamic graphs is a critical task with applications in diverse domains such as social networks, recommendation systems, and e-commerce platforms. While existing Temporal Graph Neural Networks (T-GNNs) have…

An Extended Phase Graph framework for modelling systems with exchange or magnetization transfer (MT) is proposed. The framework, referred to as EPG-X, models coupled two-compartment systems by describing each compartment with separate phase…

Robust and interpretable dementia diagnosis from noisy, non-stationary electroencephalography (EEG) is clinically essential yet remains challenging. To this end, we propose SeeGraph, a Sparse-Explanatory dynamic EEG-graph network that…

In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constraint with respect to upper bounds appears naturally in…

The study of time-varying (dynamic) networks (graphs) is of fundamental importance for computer network analytics. Several methods have been proposed to detect the effect of significant structural changes in a time series of graphs. The…