Related papers: Improved lower bounds on the connective constants …
We consider self-avoiding walks terminally attached to a surface at which they can adsorb. A force is applied, normal to the surface, to desorb the walk and we investigate how the behaviour depends on the vertex of the walk at which the…
In this work, the outward and inward accessibilities of individual nodes are defined and their potential for application is illustrated with respect to the investigation of 6 different types of networks. The outward accessibility quantifies…
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding…
We have simulated the motion of a single vertical, two-dimensional liquid bridge spanning the gap between two flat, horizontal solid substrates of given wettabilities, using a multicomponent pseudopotential lattice Boltzmann method. For…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
We show that a coupling of non-colliding simple random walkers on the complete graph on $n$ vertices can include at most $n - \log n$ walkers. This improves the only previously known upper bound of $n-2$ due to Angel, Holroyd, Martin,…
We study the critical behavior of surface-interacting self-avoiding random walks on a class of truncated simplex lattices, which can be labeled by an integer $n\ge 3$. Using the exact renormalization group method we have been able to obtain…
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…
For an input graph $G$, an additive spanner is a sparse subgraph $H$ whose shortest paths match those of $G$ up to small additive error. We prove two new lower bounds in the area of additive spanners: 1) We construct $n$-node graphs $G$ for…
We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…
The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the asymptotic growth rate of the number of self-avoiding walks (SAWs) on $G$ from a given starting vertex. We survey several aspects of the relationship between the…
We give upper and lower bounds on the leading coefficients of the $L^2$-Alexander torsions of a $3$-manifold $M$ in terms of hyperbolic volumes and of relative $L^2$-torsions of sutured manifolds obtained by cutting $M$ along certain…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS),…
Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation…
Consider a random walk in $\mathbb{R}^d$ that starts at the origin and whose increment distribution assigns zero probability to any affine hyperplane. We solve Sylvester's problem for these random walks by showing that the probability that…