相关论文: On region crossing change and incidence matrix

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…

For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…

Inferring brain connectivity network and quantifying the significance of interactions between brain regions are of paramount importance in neuroscience. Although there have recently emerged some tests for graph inference based on…

We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…

Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding…

We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…

A plane graph $H$ is a {\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if…

In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a…

Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In…

A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…

For a knot diagram we introduce an operation which does not increase the genus of the diagram and does not change its representing knot type. We also describe a condition for this operation to certainly decrease the genus. The proof…

This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…

An U(N)-invariant matrix model with d matrix variables is studied. It was shown that in the limit $N\to \infty $ and $d\to 0$ the model describes the knot diagrams. We realize the free partition function of the matrix model as the…

This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence…

This thesis is concerned with the question of when the double branched cover of an alternating knot can arise by Dehn surgery on a knot in $S^3$. We approach this problem using a surgery obstruction, first developed by Greene, which…

We study homomorphism problems of signed graphs. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept for signed graphs is the operation of switching at a vertex, which is to…

In a networked system, functionality can be seriously endangered when nodes are infected, due to internal random failures or a contagious virus that develops into an epidemic. Given a snapshot of the network representing the nodes' states…

We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…