Related papers: A Resistance Bound via an Isoperimetric Inequality

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

We consider the standard model of i.i.d. bond percolation on $\mathbb Z^d$ of parameter $p$. When $p>p_c$, there exists almost surely a unique infinite cluster $\mathcal C_p$. Using the recent techniques of Cerf and Dembin, we prove that…

We consider the problem of determining an unaccessible part of the boundary of a conductor by mean of thermal measurements. We study a problem of corrosion where a Robin type condition is prescribed on the damaged part and we prove…

We study the growth and isoperimetry of infinite clusters in slightly supercritical Bernoulli bond percolation on transitive nonamenable graphs under the $L^2$ boundedness condition ($p_c<p_{2\to 2}$). Surprisingly, we find that the volume…

We derive a uniform bound for the difference of two contractive semigroups, if the difference of their generators is form-bounded by the Hermitian parts of the generators themselves. We construct a semigroup dynamics for second order…

For a connected graph $G$, its resistance distance matrix is denoted by $R(G)$. A graph is called resistance regular if all the row (or column) sums of $R(G)$ are equal. We provide a necessary and sufficient condition for a simple connected…

We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…

We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs…

We establish general estimates for simple random walk on an arbitrary infinite random graph, assuming suitable bounds on volume and effective resistance for the graph. These are generalizations of the results in \cite[Section 1,2]{BJKS},…

In this paper we provide a Bonnesen-style inequality which gives a lower bound for the isoperimetric deficit corresponding to a closed convex curve in terms of some geometrical invariants of this curve. Moreover we give a geometrical…

We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…

Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.

We further study the interfaces arising in a situation of inhomogeneity. More precisely, we identify a characteristic length for the gradient percolation model, that enables us to tighten previous estimates established for it. This allows…

We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…

The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

This note surveys some classical results and recent developments on the interplay between lower curvature bounds and the isoperimetric problem. It is based on mini-courses given at the European Doctorate School of Differential Geometry…

We prove that critical percolation has no infinite clusters almost surely on any unimodular quasi-transitive graph satisfying a return probability upper bound of the form $p_n(v,v) \leq \exp\left[-\Omega(n^\gamma)\right]$ for some…