Related papers: Self-avoiding walks and amenability

We continue the study of the properties of graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in some fixed vertex-transitive graph $F$, for various choices of $F$ and $r$. This is…

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

Let G be one of the local gauge groups C(X,U(n)), C^\infty(X,U(n)), C(X,SU(n)) or C^\infty(X,SU(n)) where X is a compact Riemannian manifold. We observe that G has a nontrivial group topology, coarser than its natural topology, w.r.t. which…

Given a permutation group $G$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph with connection set the set of all derangements of $G$. We prove that, when $G$ is transitive of degree at least $3$, $\Gamma_G$ contains a triangle.…

Topological properties of crystalline ice structures are studied by means of self-avoiding walks on their H-bond networks. The number of self-avoiding walks, C_n, for eight ice polymorphs has been obtained by direct enumeration up to walk…

This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…

We study the number $c_n^{(N)}$ of $n$-step self-avoiding walks on the $N$-dimensional hypercube, and identify an $N$-dependent \emph{connective constant} $\mu_N$ and amplitude $A_N$ such that $c_n^{(N)}$ is $O(\mu_N^n)$ for all $n$ and…

The Fisher transformation acts on cubic graphs by replacing each vertex by a triangle. We explore the action of the Fisher transformation on the set of self-avoiding walks of a cubic graph. Iteration of the transformation yields a sequence…

The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…

We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising…

We prove diffusive lower bounds on the rate of escape of the random walk on infinite transitive graphs. Similar estimates hold for finite graphs, up to the relaxation time of the walk. Our approach uses nonconstant equivariant harmonic…

We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the…

We consider two combinatorial models on bunkbed graphs: maximum flow and self-avoiding walks. A bunkbed graph is defined as the Cartesian product $G\times K_2$, where $G$ is a finite graph and $K_2$ is the complete graph on two vertices,…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

In this paper we present various lower bound results on collective tree spanners and on spanners of bounded treewidth. A graph $G$ is said to admit a system of $\mu$ collective additive tree $c$-spanners if there is a system $\cal{T}$$(G)$…

Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions $P(k)$ were considered ($k$, degree or connectivity), including scale-free…

Given a discrete source distribution $\mu$ and discrete target distribution $\nu$ on a common finite state space $\mathcal{X}$, we are tasked with transporting $\mu$ to $\nu$ using a given discrete-time Markov chain $X$ with the quickest…

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…