相关论文: Region crossing change on spatial theta-curves

A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the…

We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…

The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…

By performing lattice Boltzmann simulations of a binary mixture, we scrutinize the dynamical scaling hypothesis for the spinodal decomposition of binary mixtures for the crossover region, i.e. the region of parameters in the growth curve…

We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…

Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover for binary strings and other important…

The mode-locking regions of a dynamical system are the subsets of the parameter space of the system within which there exists an attracting periodic solution. For piecewise-linear continuous maps, these regions have a curious chain…

This paper develops an adaptive version of Mallat's scattering transform for signals on graphs. The main results are norm bounds for the layers of the transform, obtained from a version of a Beurling-Deny inequality that permits to remove…

Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is among the most natural frameworks. Roughly speaking, herein one…

Spatio-temporal forecasting is challenging attributing to the high nonlinearity in temporal dynamics as well as complex location-characterized patterns in spatial domains, especially in fields like weather forecasting. Graph convolutions…

Clustering $\unicode{x2013}$ the tendency for neighbors of nodes to be connected $\unicode{x2013}$ quantifies the coupling of a complex network to its latent metric space. In random geometric graphs, clustering undergoes a continuous phase…

A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of…

In 1968, Erd\"os defined the Shift Graph as the graph whose vertices are the $k$-element subsets of $[n]=\{0,1,2,...,n-1\}$ such that $A=\{a_1,...,a_k\}$ and $B=\{b_1,...,b_k\}$ are neighbours iff $a_1<b_1=a_2<b_2=a_3<... <b_{n-1}=a_n<b_n$.…

Consider a navigation rule defined on a graph that maps every vertex of the graph to a vertex in such a way that the navigation rule commutes with every automorphism of the graph. It is to say that the navigation rule applied to the…

This paper concerns the tau constant, which is an important invariant of a metrized graph, and which has applications to arithmetic properties of curves. We give several formulas for the tau constant, and show how it changes under graph…

We define the fundamental quandle of a spatial graph and several invariants derived from it. In the category of graph tangles, we define an invariant based on the walks in the graph and cocycles from nonabelian quandle cohomology.

Let $R$ be a noncommutative ring with identity. The commuting graph of $R$, denoted by $\Gamma(R)$, is a graph with vertex set $R \setminus Z(R)$, and two vertices $a$, $b$ are adjacent if $a\neq b$ and $ab=ba$. Let $T=Tr(R)$ be the ring of…

Dynamical phase transitions are defined as non-analytic points of the large deviation function of current fluctuations. We show that for boundary driven systems, many dynamical phase transitions can be identified using the geometrical…

Discussed here are the effects of basics graph transformations on the spectra of associated quantum graphs. In particular it is shown that under an edge switch the spectrum of the transformed Schr\"odinger operator is interlaced with that…

In this work we investigate time varying networks with complex dynamics at the nodes. We consider two scenarios of network change in an interval of time: first, we have the case where each link can change with probability pt, i.e. the…