Related papers: Moment sequences, transformations, and Spidernet g…
In the recent research of data mining, frequent structures in a sequence of graphs have been studied intensively, and one of the main concern is changing structures along a sequence of graphs that can capture dynamic properties of data. On…
We give a substitute to Feller property for semigroups of time-changed processes; under some conditions this leads to establish sufficient (new) conditions for the semigroups to be Feller. Moreover, given a standard process and a sequence…
The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods,…
Using a change of basis in the algebra of symmetric functions, we compute the moments of the Hermitian Jacobi process. After a careful arrangement of the terms and the evaluation of the determinant of an `almost upper-triangular' matrix, we…
We study Hankel transforms of sequences, where the transform elements are members of the set {-1,0,1}. We relate these Hankel transforms to special continued fraction expansions. In particular, we posit a conjecture relating the…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
In this paper, we study the truncated matrix moment problem in one variable through recursive matrix extensions. \ We give necessary and sufficient conditions for a recursive matrix extension of finite data to be a matrix moment sequence in…
We use the Schmidt Subspace Theorem to establish the transcendence of a class of quasi-periodic continued fractions. This improves earlier works of Maillet and of A. Baker. We also improve an old result of Davenport and Roth on the rate of…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…
We give continued fraction algorithms for a particular class of Fuchsian triangle groups. In particular, we give an explicit form of each such group that is a subgroup of the Hilbert modular group of its trace field and provide an interval…
We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the…
We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel. By giving a visual representation of this bijection in terms of so-called cycle…
We prove that for some knot-like objects one can easily recognize non-equivalence w.r.t. all Reidemeister moves by studying some equivalence classes modulo only 2nd Reidemeister moves. There are applications to virtual knots, graph-links…
This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…
The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for…
We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider…
The left-invariant sub-Riemannian problem on the group of motions of a plane is considered. Sub-Riemannian geodesics are parametrized by Jacobi's functions. Discrete symmetries of the problem generated by reflections of pendulum are…