Related papers: Recognizing generalized Petersen graphs in linear …
In this paper, we analyze timed systems with data structures, using a rich interplay of logic and properties of graphs. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called…
We propose an extension of the Contextual Graph Markov Model, a deep and probabilistic machine learning model for graphs, to model the distribution of edge features. Our approach is architectural, as we introduce an additional Bayesian…
Graph deep learning methods have become popular tools to process collections of correlated time series. Unlike traditional multivariate forecasting methods, graph-based predictors leverage pairwise relationships by conditioning forecasts on…
Building patterns are important urban structures that reflect the effect of the urban material and social-economic on a region. Previous researches are mostly based on the graph isomorphism method and use rules to recognize building…
Centrality indices are used to rank the nodes of a graph by importance: this is a common need in many concrete situations (social networks, citation networks, web graphs, for instance) and it was discussed many times in sociology,…
A parameter of a mathematical model is structurally identifiable if it can be determined from noiseless experimental data. Here, we examine the identifiability properties of two important classes of linear compartmental models:…
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…
I present here a simple proof that, under general regularity conditions, the standard parametrization of generalized linear mixed model is identifiable. The proof is based on the assumptions of generalized linear mixed models on the first…
In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph, and then we use…
Given a finite Lie incidence geometry which is either a polar space of rank at least $3$ or a strong parapolar space of symplectic rank at least $4$ and diameter at most $4$, or the parapolar space arising from the line Grassmannian of a…
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…
The chain graph model admits both undirected and directed edges in one graph, where symmetric conditional dependencies are encoded via undirected edges and asymmetric causal relations are encoded via directed edges. Though frequently…
In this paper, we design linear time algorithms to recognize and determine topological invariants such as the genus and homology groups in 3D. These properties can be used to identify patterns in 3D image recognition. This has tremendous…
Cities can be seen as the epitome of complex systems. They arise from a set of interactions and components so diverse that is almost impossible to describe them exhaustively. Amid this diversity, we chose an object which orchestrates the…
Path signatures are powerful nonparametric tools for time series analysis, shown to form a universal and characteristic feature map for Euclidean valued time series data. We lift the theory of path signatures to the setting of Lie group…
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…
We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…
Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which…
In this paper we extend counting of traversing Hamiltonian cycles from 2-tiled graphs to generalized tiled graphs. We further show that, for a fixed finite set of tiles, counting traversing Hamiltonian cycles can be done in linear time with…
This paper explores the properties of directed graphs, termed generalized action graphs, which exhibit a strong connection to certain number sequences. Focusing on the structural and combinatorial aspects, we investigate the conditions…