Related papers: Characterizing the Lovasz theta function via walk …
We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, $p^{(n)}(v,w)\leq C…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
The rules to construct Lagrangian formulation for $\theta$-superfield theory of fields ($\theta$-STF) are introduced and considered on the whole in the framework of new superfield quantization method for general gauge theories. Algebraic,…
We prove new lower bounds on the likely size of a maximum independent set in a random graph with a given average degree. Our method is a weighted version of the second moment method, where we give each independent set a weight based on the…
We present the proper co-frame and its corresponding (diagonal) co-frame/spin connection pair for spherically symmetric geometries which can be used as an initial ansatz in any theory of teleparallel gravity. The Lorentz transformation…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
This is a preprint of Chapter 2 in the following work: Marta Lewicka, A Course on Tug-of-War Games with Random Noise, 2020, Springer, reproduced with permission of Springer Nature Switzerland AG. We present the basic relation between the…
In this paper we introduce some new methods to understand the analytic behaviour of the zeta function of a group. We can then combine this knowledge with suitable Tauberian theorems to deduce results about the growth of subgroups in a…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
In this paper, we consider an extended Kazakov-Migdal model defined on an arbitrary graph. The partition function of the model, which is expressed as the summation of all Wilson loops on the graph, turns out to be represented by the…
We establish a novel type of connection between random walks and analytic number theory. Working with a random walk on the circle group $\mathbb{R}/\mathbb{Z}$ in which each step is a random integer multiple of a given quadratic irrational…
This is the first part of a two-part paper describing a new concept of separation of variables applied to the Clebsch integrable case of the Kirchhoff equations. There are two principal novelties: 1) Separating coordinates are constructed…
Starting with Ihara's work in 1968, there has been a growing interest in the study of zeta functions of finite graphs, by Sunada, Hashimoto, Bass, Stark and Terras, Mizuno and Sato, to name just a few authors. Then, Clair and…
In previous work (arXiv:1908.09589), we studied rational generating functions ("ask zeta functions") associated with graphs and hypergraphs. These functions encode average sizes of kernels of generic matrices with support constraints…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…
We propose a twisted Szegedy walk for estimating the limit behavior of a discrete-time quantum walk on a crystal lattice, an infinite abelian covering graph, whose notion was introduced by [14]. First, we show that the spectrum of the…
The aim of this article is to introduce a unified method to obtain explicit integral representations of the trivariate generating function counting the walks with small steps which are confined to a quarter plane. For many models, this…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
A recent conjecture of Fyodorov--Hiary--Keating states that the maximum of the absolute value of the Riemann zeta function on a typical bounded interval of the critical line is $\exp\{\log \log T -\frac{3}{4}\log \log \log T+O(1)\}$, for an…
In this paper we introduce a new approach for approximately counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula $\Phi$ when the…