Related papers: Average Length of Cycles in Rectangular Lattice
Let $G$ be a connected graph on $n$ vertices with girth $g$. Let $m_GI$ denote the number of Laplacian eigenvalues of graph $G$ in an interval $I$. In this paper, we show that if $G$ is not a cycle, then $m_G(n-g+3,n]\leq n-g$. Moreover, we…
We provide an example for the generating matrix $A$ of a two-dimensional lattice $\Gamma = A\mathbb{Z}^2$, such that the following holds: For any sufficiently smooth and localized mother wavelet $\psi$, there is a constant…
We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…
We calculate the third coefficient of the lattice beta function in QCD with Wilson fermions, extending the pure gauge results of Luescher and Weisz; we show how this coefficient modifies the scaling function on the lattice. We also…
A statistical model of loops on the three-dimensional lattice is proposed and is investigated. It is O(n)-type but has loop fugacity that depends on global three-dimensional shapes of loops in a particular fashion. It is shown that, despite…
In this short note it is shown that every graph of diameter 2 and minimum degree at least 3 contains a cycle of length 4 or 8. This result contributes to the study of the Erd\H{o}s-Gy\'arf\'as Conjecture by confirming it for the class of…
We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…
Group synchronization plays a crucial role in global pipelines for Structure from Motion (SfM). Its formulation is nonconvex and it is faced with highly corrupted measurements. Cycle consistency has been effective in addressing these…
A detailed study of the thermodynamics of the O(N=3) model in 1+1 dimensions is presented, employing a two-particle-irreducible resummation prescription as well as fully nonperturbative finite-temperature lattice simulations. The analytical…
We consider the model of random surfaces with extrinsic curvature term embedded into 3d Euclidean lattice $Z^3$. On a 3d Euclidean lattice it has equivalent representation in terms of transfer matrix $K(Q_{i},Q_{f})$, which describes the…
We present a method for calculating transfer matrices for the $q$-state Potts model partition functions $Z(G,q,v)$, for arbitrary $q$ and temperature variable $v$, on cyclic and M\"obius strip graphs $G$ of the square (sq), triangular…
An $n\times n$ matrix $M=[m_{ij}]$ with $m_{ij}\in U_n=\{1,2,\ldots,n\}$ will be called a cycle matrix if $(U_n,\cdot)$ is a cycle set, where $i\cdot j=m_{ij}$. We study these matrices in this article. Using these matrices, we give some…
Structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically.…
The effects of the ring-exchange Hamiltonian H_3 = J_3 sum_{<ijk>} (S_i * S_j) (S_i * S_k) on the triangular lattice are studied using classical Monte Carlo simulations. Each spin $S_i$ is treated as a classical XY spin taking on Q equally…
We study random spatial permutations on Z^3 where each jump x -> \pi(x) is penalized by a factor exp(-T ||x-\pi(x)||^2). The system is known to exhibit a phase transition for low enough T where macroscopic cycles appear. We observe that the…
We have studied numerically the random interchange model and related loop models on the three-dimensional cubic lattice. We have determined the transition time for the occurrence of long loops. The joint distribution of the lengths of long…
In 1959, Erd\H{o}s and Gallai proved that every graph G with average vertex degree ad(G)\geq 2 contains a cycle of length at least ad(G). We provide an algorithm that for k\geq 0 in time 2^{O(k)} n^{O(1)} decides whether a 2-connected…
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…