Related papers: On four state Hard Core Models on the Cayley Tree

In this paper we investigate generalized Gibbs measure (GGM) for $p$-adic Hard-Core(HC) model with a countable set of spin values on a Cayley tree of order $k\geq 2$. This model is defined by $p$-adic parameters $\lambda_i$, $i\in \mathbb…

In this paper we study the extremality of translation-invariant Gibbs measure for the HC-model on a Cayley tree. It is known that for this model the translation-invariant measure is unique. We give a new proof of this statement and found…

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…

In this paper, we continue an investigation of the $p$-adic Ising-Vannimenus model on the Cayley tree of an arbitrary order $k$ $(k\geq 2$). We prove the existence of $p$-adic quasi Gibbs measures by analyzing fixed points of…

A complete description of two-periodic Gibbs measures on the Cayley tree of orders two and three for HC model with two states is obtained and using the reconstruction method, the extremality of these measures in the area of their existence…

We describe some necessary conditions for the existence of a Hamiltonian path in any graph (in other words, for a graph to be traceable). These conditions result in a linear time algorithm to decide the Hamiltonian path problem for cactus…

We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

The hard-core model has attracted much attention across several disciplines, representing lattice gases in statistical physics and independent sets in discrete mathematics and computer science. On finite graphs, we are given a parameter…

In this paper we consider a model with nearest-neighbor interactions and with the set $[0,1]$ of spin values, on a Cayley tree of order $k \geq 2$. To study translation-invariant Gibbs measures of the model we drive an nonlinear functional…

We consider a system of qubits coupled via nearest-neighbour interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to $1$. We are interested in determining which graphs allow for a…

Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a $(2,s,3)$-presentation, that…

We investigate the finite-state $p$-solid-on-solid model, for $p=\infty$, on Cayley trees of order $k\geq 2$ and establish a system of functional equations where each solution corresponds to a (splitting) Gibbs measure of the model. Our…

We consider a nearest-neighbor $p$-adic $\l$-model with spin values $\pm 1$ on a Cayley tree of order $k\geq 1$. We prove for the model there is no phase transition and as well as the unique $p$-adic Gibbs measure is bounded if and only if…

Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…

We consider the hard-core model in $\mathbb{R}^2$, in which a random set of non-intersecting unit disks is sampled with an intensity parameter $\lambda$. Given $\varepsilon>0$ we consider the graph in which two disks are adjacent if they…

We introduce a new way to sample inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities while remaining tractable. To achieve this we run a Poisson…

Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…

We give constructive proofs for the existence of uniquely hamiltonian graphs for various sets of degrees. We give constructions for all sets with minimum 2 (a trivial case added for completeness), all sets with minimum 3 that contain an…

We describe fixed points of an infinite dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values on the Cayley tree. This operator is defined by a countable set of parameters…