Related papers: Two New Gestures on Peirce's Continuum and the Exi…
What kind of macroscopic structural and dynamical patterns can we observe in real-world hypergraphs? What can be underlying local dynamics on individuals, which ultimately lead to the observed patterns, beyond apparently random evolution?…
The central question of this paper is: how do algebraic invariants of edge ideals change under natural graph operations? We study this question through the lens of suspensions. The (full) suspension of a graph is obtained by adjoining a new…
Recently, a couple of degree-based topological indices, defined using a geometrical point of view of a graph edge, have attracted significant attention and being extensively investigated. Furtula and Oz [Complementary Topological Indices,…
Was paper 839 in the author's list until winter 2023 when it was divided into three. Part I: We would like to generalize imaginary elements, weight of ortp$(a,M,N), {\mathbf P}$-weight, ${\mathbf P}$-simple types, etc. from [She90, Ch.…
We survey the 19th century development of the signature of a quadratic form, and the applications in the 20th and 21st century to the topology of manifolds and dynamical systems. Version 2 is an expanded and corrected version of Version 1,…
Irregularly sampling a spatially stationary random field does not yield a graph stationary signal in general. Based on this observation, we build a definition of graph stationarity based on intrinsic stationarity, a less restrictive…
Consider a finite inhomogeneous random graph running in continuous time, where each vertex has a mass, and the edge that links any pair of vertices appears with a rate equal to the product of their masses. The simultaneous…
Motivated by the successful application of geometry to proving the Harary-Hill Conjecture for "pseudolinear" drawings of $K_n$, we introduce "pseudospherical" drawings of graphs. A spherical drawing of a graph $G$ is a drawing in the unit…
We study the double scaling limit of the $O(N)^3$-invariant tensor model, initially introduced in Carrozza and Tanasa, Lett. Math. Phys. (2016). This model has an interacting part containing two types of quartic invariants, the tetrahedric…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
We define and calculate signature and nullity invariants for complex schemes for curves in the real projective plane. We use an analog of the Murasugi-Tristram inequality to prohibit certain schemes from being realized by real algebraic…
Evolving trees arise in many real-life scenarios from computer file systems and dynamic call graphs, to fake news propagation and disease spread. Most layout algorithms for static trees do not work well in an evolving setting (e.g., they…
Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…
We apply modern methods in computational topology to the task of discovering and characterizing phase transitions. As illustrations, we apply our method to four two-dimensional lattice spin models: the Ising, square ice, XY, and…
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…
The problems of continuation of a partially defined metric and a partially defined ultrametric were considered in (O. Dovgoshey, O. Martio and M. Vuorinen, Metrization of weighted graphs, Ann. Comb., 17:455--476, 2013) and (A. A. Dovgoshey…
A vector calculus approach for the determination of advected invariants is presented for inviscid fluid flow. This approach describes invariants by means of Lie dragging of scalars, vectors, and skew-tensors with respect to the fluid…
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.…
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all "Geometry of Interaction" (GoI) constructions introduced so far. This series of work was inspired from Girard's…