Related papers: Characterizing the Lovasz theta function via walk …
In this paper, we propose a flexible notion of characteristic functions defined on graph vertices to describe the distribution of vertex features at multiple scales. We introduce FEATHER, a computationally efficient algorithm to calculate a…
In this work we introduce the dynamic $\Theta$-random graph and the associated $\Theta$-coalescent with momentum. Dynamic $\Theta$-random graphs are a subclass of exchangeable and consistent random graph processes, parametrised by a measure…
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…
A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…
Ideas of Kn\"odel and B\"ohm-Hornik about walks in certain graphs, resembling the classical symmetric random walk on the integers, are combined. All the relevant generating functions (although occasionally quite involved) are made fully…
For a dust-like self-similar set (generated by IFSs with the strong separation condition), Elekes, Keleti and M\'{a}th\'{e} found an invariant, called `algebraic dependence number', by considering its generating IFSs and isometry invariant…
Generation of Wigner functions of Landau levels and determination of their symmetries and generic properties are achieved in the autonomous framework of deformation quantization. Transformation properties of diagonal Wigner functions under…
We consider the generating function of the algebraic area of lattice walks, evaluated at a root of unity, and its relation to the Hofstadter model. In particular, we obtain an expression for the generating function of the n-th moments of…
In this article, we deeply reveal the relationship between functions $\theta$ and $\vartheta$ in an overlap function additively generated by an additive generator pair ($\theta$,$\vartheta$). Then we characterize the conditions for an…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
We investigate two recently introduced graph parameters, both of which measure the complexity of the tree decompositions of a given graph. Recall that the treewidth ${\rm tw}(G)$ of a graph $G$ measures the largest number of vertices…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
A lot of efforts have been devoted in the last decade to the investigation of the high-frequency behaviour of geometric functionals for the excursion sets of random spherical harmonics, i.e., Gaussian eigenfunctions for the spherical…
Generating functions for asymmetric step-size paths restricted by two absorbing barriers are derived. The method begins by applying the Lagrange inversion formula to arbitrary powers of roots of the characteristic equation, that being a…
Given a symmetric linear transformation on a Hilbert space, a natural problem to consider is the characterization of its set of symmetric extensions. This problem is equivalent to the study of the partial isometric extensions of a fixed…
We consider minimal, aperiodic symbolic subshifts and show how to characterize the combinatorial property of bounded powers by means of a metric property. For this purpose we construct a family of graphs which all approximate the subshift…
We study random one-Lipschitz integer functions $f$ on the vertices of a finite connected graph, sampled according to the weight $W(f) = \prod_{\langle v, w \rangle \in E} \mathbf{c}^{ \mathbb{I} \{ f(v) = f(w) \} }$ where $\mathbf{c} \geq…
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…
Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by…
In this work a method is presented to derive the generating functional in path integral form for a system with an arbitrary number of degrees of freedom and constrained by general conditions. The method is applied to the case of the…