Related papers: Relations between connected and self-avoiding walk…

We consider self-avoiding walks terminally attached to an impenetrable surface at which they can adsorb. We call the vertices farthest away from this plane the top vertices and we consider applying a force at the plane containing the top…

We explore relations between cyclic sequences determined by a quadratic difference relation, cyclotomic polynomials, Eulerian digraphs and walks in the plane. These walks correspond to closed paths for which at each step one must turn…

Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this supplementary material for the paper "Navigability of interconnected networks…

Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…

During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the…

Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2+2)-free posets and…

Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…

This article is one of a triptych composed with [Che25a] and [Che25b], that aims at proving an asymptotic expansion to any order of the passage probability of an irreducible equivariant finite range random walk on a tree. In this text we…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and…

We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.

A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance…

Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we…

A generalization of incidence relations in abstract polytope has been explored, and parameterized surfaces are used as primers. The abstract orientable incidence structure is defined as an algebraic model of incidence relations, in which…

We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…

We give exact relations for a number of amplitude combinations that occur in the study of self-avoiding walks, polygons and lattice trails. In particular, we elucidate the lattice-dependent factors which occur in those combinations which…

We consider the continuous-time quantum walk defined on the adjacency matrix of a graph. At each instant, the walk defines a mixing matrix which is doubly-stochastic. The average of the mixing matrices contains relevant information about…

The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N going to infinity they are strictly finite in number but their radius of gyration Rc is…

We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…

By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…