Related papers: The chain relation in sofic subshifts
We show that the "grandfather graph" has the following property: it is the unique completion to a transitive graph of a large enough finite subgraph of itself.
Graphs are naturally used to describe the structures of various real-world systems in biology, society, computer science etc., where subgraphs or motifs as basic blocks play an important role in function expression and information…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Graph matching finds the correspondence of nodes across two correlated graphs and lies at the core of many applications. When graph side information is not available, the node correspondence is estimated on the sole basis of network…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
The dynamics of the tip of the falling chain is analyzed. Results of laboratory experiments are presented and compared with results of numerical simulations. Time dependences of the velocity and the acceleration of the chain tip for a…
For a smooth morphism $f: X \longrightarrow \Sigma$ of real analytic manifolds and an $\mathbb{R}$-constructible sheaf $F$ on $X$ satisfying some condition, we define a family of Lagrangian cycles parameterized by $\Sigma$ that we call the…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
Let $(X,G,\Phi)$ be a dynamical system, where $X$ is compact Hausdorff space, and $G$ is a countable discrete group. We investigate shadowing property and mixing between subshifts and general dynamical systems. For the shadowing property,…
Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…
In this work the dynamics of a freely jointed random chain with small masses attached to the joints is studied from a microscopic point of view. The chain is treated using a stringy approach, in which a statistical sum is performed over all…
Let $G$ be a sofic group, and let $\Sigma = (\sigma_n)_{n\geq 1}$ be a sofic approximation to it. For a probability-preserving $G$-system, a variant of the sofic entropy relative to $\Sigma$ has recently been defined in terms of sequences…
We consider extensions of the notion of topological transitivity for a dynamical system $(X,f)$. In addition to chain transitivity, we define strong chain transitivity and vague transitivity. Associated with each there is a notion of…
We examine dynamical systems with the property that pseudo-orbits can be traced by small diameter sets with bounded cardinality. In particular, we show that mixing sofic subshifts and surjective dynamical systems with the specification…
Let $G$ be a graph with order $n$ and adjacency matrix $\mathbf{A}(G)$. The adjacency polynomial of $G$ is defined as $\phi(G;\lambda) =det(\lambda\mathbf{I}-\mathbf{A}(G))=\sum_{i=0}^n\mathbf{a_i}(G)\lambda^{n-i}$. Hereafter,…
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.
The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total…
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced and studied strong subgraph $k$-connectivity of digraphs obtaining characterizations, lower and upper bounds and computational complexity results for the new digraph…
Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…
We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the…