让行走计数：从沉默圈到哈密顿圈

Making Walks Count: From Silent Circles to Hamiltonian Cycles

Max A. Alekseyev, Gerard P. Michon

发表信息：: In: J. Beineke, J. Rosenhouse (eds.) The Mathematics of Various Entertaining Subjects. Volume 2: Research in Games, Graphs, Counting, and Complexity. Princeton University Press, 2017, pp. 157-168. ISBN 978-0-691-17192-0
DOI：: 10.2307/j.ctt1s4773q.14

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

AI总结：

本文展示矩阵转移方法在沉默圈游戏、反棱柱图哈密顿圈及任意图固定长度路径与圈计数问题中的应用。

摘要：

我们阐述了矩阵转移方法在若干计数问题中的应用，这些问题涉及聚会游戏“沉默圈”、反棱柱图中的哈密顿圈，以及任意图中固定长度的简单路径和圈。

英文摘要：

We illustrate the application of the matrix-transfer method for a number of enumeration problems concerning the party game Silent Circles, Hamiltonian cycles in the antiprism graphs, and simple paths and cycles of a fixed length in arbitrary graphs.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Planar maps, random walks and circle packing

These are lecture notes of the 48th Saint-Flour summer school, July 2018, on the topic of planar maps, random walks and the circle packing theorem.

2019-01-01math.COmath.PR

Ramdom walks on hypergroup of circles in finite fields

In this paper we study random walks on the hypergroup of circles in a finite field of prime order p = 4l + 3. We investigating the behavior of random walks on this hypergroup, the equilibrium distribution and the mixing times. We use two different approaches - comparision of Dirichlet forms (geometric bound of eigenvalues), and coupling methods, to show that the mixing time of random walks on hypergroup of circles is only linear.

2005-08-22math.COmath.PR

On the Meeting Time for Two Random Walks on a Regular Graph

We provide an analysis of the expected meeting time of two independent random walks on a regular graph. For 1-D circle and 2-D torus graphs, we show that the expected meeting time can be expressed as the sum of the inverse of non-zero eigenvalues of a suitably defined Laplacian matrix. We also conjecture based on empirical evidence that this result holds more generally for simple random walks on arbitrary regular graphs. Further, we show that the expected meeting time for the 1-D circle of size $N$ is $Θ(N^2)$, and for a 2-D $N \times N$ torus it is $Θ(N^2 log N)$.

2014-08-09cs.DMmath.COmath.PR

A new type of spectral mapping theorem for quantum walks with a moving shift on graphs

The conventional spectral mapping theorem for quantum walks can only be applied for walks employing a shift operator whose square is the identity. This theorem gives most of the eigenvalues of the time evolution $U$ by lifting the eigenvalues of an induced self-adjoint matrix $T$ onto the unit circle on the complex plane. We acquire a new spectral mapping theorem for the Grover walk with a shift operator whose cube is the identity on finite graphs. Moreover, graphs we can consider for a quantum walk with such a shift operator is characterized by a triangulation. We call these graphs triangulab…

2021-03-09math.COquant-ph

Random Walk in an Alcove of an Affine Weyl Group, and Non-Colliding Random Walks on an Interval

We use a reflection argument, introduced by Gessel and Zeilberger, to count the number of k-step walks between two points which stay within a chamber of a Weyl group. We apply this technique to walks in the alcoves of the classical affine Weyl groups. In all cases, we get determinant formulas for the number of k-step walks. One important example is the region m>x_1>x_2>...>x_n>0, which is a rescaled alcove of the affine Weyl group C_n. If each coordinate is considered to be an independent particle, this models n non-colliding random walks on the interval (0,m). Another case models n non-collid…

2001-06-04math.COmath.PR

Asymptotics for random walks in alcoves of affine Weyl groups

Asymptotic results are derived for the number of random walks in alcoves of affine Weyl groups (which are certain regions in $n$-dimensional Euclidean space bounded by hyperplanes), thus solving problems posed by Grabiner [J. Combin. Theory Ser. A 97 (2002), 285-306]. These results include asymptotic expressions for the number of vicious walkers on a circle, and as well for the number of vicious walkers in an interval. The proofs depart from the exact results of Grabiner [loc. cit.], and require as diverse means as results from symmetric function theory and the saddle point method, among other…

2008-01-11cond-mat.stat-mechmath-phmath.CO

更多相关论文收起更多论文

通过确定性差异游走实现谱稀疏化

Spectral Sparsification by Deterministic Discrepancy Walk

本文将确定性差异游走框架从向量差异推广到矩阵差异，统一处理多种谱稀疏化问题，并以确定性分析给出更优结果与更简证明。

2024-08-12cs.DSmath.CO

Some criteria for circle packing types and combinatorial Gauss-Bonnet Theorem

We investigate criteria for circle packing(CP) types of disk triangulation graphs embedded into simply connected domains in $ \mathbb{C}$. In particular, by studying combinatorial curvature and the combinatorial Gauss-Bonnet theorem involving boundary turns, we show that a disk triangulation graph is CP parabolic if \[ \sum_{n=1}^\infty \frac{1}{\sum_{j=0}^{n-1} (k_j +6)} = \infty, \] where $k_n$ is the degree excess sequence defined by \[ k_n = \sum_{v \in B_n} (\mbox{deg}\, v - 6) \] for combinatorial balls $B_n$ of radius $n$ and centered at a fixed vertex. It is also shown that the simple …

2021-08-09math.COmath.MG

Effect of scale on long-range random graphs and chromosomal inversions

We consider bond percolation on $n$ vertices on a circle where edges are permitted between vertices whose spacing is at most some number L=L(n). We show that the resulting random graph gets a giant component when $L\gg(\log n)^2$ (when the mean degree exceeds 1) but not when $L\ll\log n$. The proof uses comparisons to branching random walks. We also consider a related process of random transpositions of $n$ particles on a circle, where transpositions only occur again if the spacing is at most $L$. Then the process exhibits the mean-field behavior described by Berestycki and Durrett if and only…

2012-08-20math.COmath.PR