Related papers: The chain relation in sofic subshifts
We derive the coherent state representation of the integrable spin chain Hamiltonian with non-compact supersymmetry group G=SU(1,1|1). By passing to the continuous limit, we find a spin chain sigma model describing a string moving on the…
In this work, we propose a novel approach for subgraph matching, the problem of finding a given query graph in a large source graph, based on the fused Gromov-Wasserstein distance. We formulate the subgraph matching problem as a partial…
We describe a polynomial-time algorithm which, given a graph $G$ with treewidth $t$, approximates the pathwidth of $G$ to within a ratio of $O(t\sqrt{\log t})$. This is the first algorithm to achieve an $f(t)$-approximation for some…
Soft robotics is a thriving branch of robotics which takes inspiration from nature and uses affordable flexible materials to design adaptable non-rigid robots. However, their flexible behavior makes these robots hard to model, which is…
The center, median and the security center are three central parts defined for any connected graph whereas the characteristic set, subtree core and core vertices are three central parts defined for trees only. We extend the concept of the…
In this survey we overview known results on the strong subgraph $k$-connectivity and strong subgraph $k$-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and…
Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains…
Many real-world interactions (e.g., researcher collaborations and email communication) occur among multiple entities. These group interactions are naturally modeled as hypergraphs. In graphs, transitivity is helpful to understand the…
Complex networks with high numbers of nodes or links are often difficult to analyse. However, not all elements contribute equally to their structural patterns. A small number of elements (the hubs) seem to play a particularly relevant role…
Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Graph embedding techniques…
The parameter $\sigma(G)$ of a graph $G$ stands for the number of Laplacian eigenvalues greater than or equal to the average degree of $G$. In this work, we address the problem of characterizing those graphs $G$ having $\sigma(G)=1$. Our…
We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…
Chain graphs combine directed and undirected graphs and their underlying mathematics combines properties of the two. This paper gives a simplified definition of chain graphs based on a hierarchical combination of Bayesian (directed) and…
Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…
We study dynamics of a substitution subshift given by the substitution a->aca, b->d, c->b, d->c that is related to the Grigorchuk group. This dynamical system is shown to be, up to a countable set, conjugated to the binary odometer.
Capturing both the structural and temporal aspects of interactions is crucial for many real world datasets like contact between individuals. Using the link stream formalism to capture the dynamic of the systems, we tackle the issue of…
A gain graph over a group $G$, also referred to as $G$-gain graph, is a graph where an element of a group $G$, called gain, is assigned to each oriented edge, in such a way that the inverse element is associated with the opposite…
Human mobility analysis at urban-scale requires models to represent the complex nature of human movements, which in turn are affected by accessibility to nearby points of interest, underlying socioeconomic factors of a place, and local…
For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…
It is well-known that concentrators are sparse graphs of high connectivity, which play a key role in the construction of switching networks; and any semi-vertex transitive graph is isomorphic to a bi-coset graph. In this paper, we prove…