Related papers: The Liouville and the intersection properties are …

We present a new family of graphs with remarkable properties. They are obtained by connecting the points of a random walk when their distance is smaller than a given scale. Their degree (number of neighbors) does not depend on the graph's…

We study the probability that a random walk started inside a subgraph of a larger graph exits that subgraph (or, equivalently, hits the exterior boundary of the subgraph). Considering the chance a random walk started in the subgraph never…

A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G such that T and T* do not intersect. We show that it is not always possible to find T in G, such that the diameters of T and T*…

This paper is concerned with qualitative properties of bounded steady flows of an ideal incompressible fluid with no stagnation point in the two-dimensional plane R^2. We show that any such flow is a shear flow, that is, it is parallel to…

Let $\mathcal G$ be an infinite graph -- not necessarily one-ended -- on which the simple random walk is transient. We define a variant of the continuous-time random walk on $\mathcal G$ which reaches $\infty$ in finite time and "reflects…

Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\},…

It is known that for the 2n-step symmetric simple random walk on Z, two events have the same probability if and only if their sets of paths have the same cardinality. In this article, we construct two kinds of bijections between sets of…

We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…

We study the asymptotic behaviour of the number of self-intersections of a trajectory of a periodic planar Lorentz process with strictly convex obstacles and finite horizon. We give precise estimates for its expectation and its variance. As…

We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than what might naively be expected. One application is a simple…

A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular…

In this paper we prove the following Liouville-type theorem: any anisotropic minimal graph with free boundary in the half-space must be flat, provided that the graph function has at most one-sided linear growth. This extends the classical…

A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

In 1966, Gallai asked whether all longest paths in a connected graph have a nonempty intersection. The answer to this question is not true in general and various counterexamples have been found. However, there is a positive solution to…

We extend path analysis by showing that, for a singly-connected path diagram, the partial covariance of two random variables factorizes over the nodes and edges in the path between the variables. This result allows us to determine the…

Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…

Let $G$ be a graph such that, whenever two vertices $x$ and $y$ of $G$ are joined by three internally disjoint paths, $x$ and $y$ are adjacent. Jamison and Mulder determined that the set of such graphs coincides with the set of graphs that…

We study harmonic functions on general weighted graphs which allow for a compatible intrinsic metric. We prove an $L^{p}$ Liouville type theorem which is a quantitative integral $L^{p}$ estimate of harmonic functions analogous to Karp's…

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…