Related papers: Factor models on locally tree-like graphs

We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…

Given a free group $F_k$ of rank $k\ge 2$ with a fixed set of free generators we associate to any homomorphism $\phi$ from $F_k$ to a group $G$ with a left-invariant semi-norm a generic stretching factor, $\lambda(\phi)$, which is a…

Let $F$ be a non--Archimedean locally compact field (${\rm car}(F)\geq 0$), ${\bf G}$ be a connected reductive group defined over $F$, $\theta$ be an $F$--automorphism of ${\bf G}$, and $\omega$ be a character of ${\bf G}(F)$. We fix a Haar…

We show that the largest density of factor of i.i.d. independent sets on the d-regular tree is asymptotically at most (log d)/d as d tends to infinity. This matches the lower bound given by previous constructions. It follows that the…

Let $G$ be a connected graph in which almost all vertices have linear degrees and let $T$ be a uniform spanning tree of $G$. For any fixed rooted tree $F$ of height $r$ we compute the asymptotic density of vertices $v$ for which the…

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…

We study skew-products of the form (x,\omega)\mapsto (Tx, \omega+\phi(x)) where T is a nonuniformly expanding map on a space X, preserving a (possibly singular) probability measure \tilde\mu, and \phi:X\to S^1 is a C^1 function. Under mild…

Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…

We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and…

In this paper, we provide new proofs of the existence and the condensation of Bethe roots for the Bethe Ansatz equation associated with the six-vertex model with periodic boundary conditions and an arbitrary density of up arrows (per line)…

We have constructed a one dimensional exactly solvable model, which is based on the t-J model of strongly correlated electrons, but which has additional quantum group symmetry, ensuring the degeneration of states. We use Bethe Ansatz…

Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle…

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

Given a family $\mathcal{H}$ of graphs, we say that a graph $G$ is $\mathcal{H}$-free if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. Let $S_{t,t,t}$ be the graph obtained from $K_{1,3}$ by subdividing each edge…

We investigate finite particle systems of cold atoms bound in a local potential V(r). We derive the ground state energy and the particle density using a recently developed semiclassical theory (2008 Phys. Rev. Lett. 100 200408), and…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…

For a fixed graph property $\Phi$ and integer $k \geq 1$, consider the problem of counting the induced $k$-vertex subgraphs satisfying $\Phi$ in an input graph $G$. This problem can be solved by brute-force in time $O(n^{k})$. Under ETH, we…

We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…

We study the analytic properties of tree-level wavefunction coefficients in quasi-de Sitter space. We focus on theories which spontaneously break dS boost symmetries and can produce significant non-Gaussianities. The corresponding…

The lattice spin model with $Q$--component discrete spin variables restricted to have orientations orthogonal to the faces of $Q$-dimensional hypercube is considered on the Bethe lattice, the recursive graph which contains no cycles. The…