Related papers: A Resistance Bound via an Isoperimetric Inequality
Simplifications of a result from a prior paper concerning the electric resistance between points in a distance-regular graph are given. In particular, we prove that the maximal resistance between points is bounded by twice the resistance…
We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.
We consider the problem of two-point resistance on an m x n cobweb network with a superconducting boundary, which is topologically equivalent to a geographic globe. We deduce a concise formula for the resistance between any two nodes on the…
We prove an epiperimetric inequality for the thin obstacle problem, extending the pioneering results by Weiss on the classical obstacle problem (Invent. Math. 138 (1999), no. 1, 23-50). This inequality provides the means to study the rate…
Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…
Isoperimetric inequalities form a very intuitive yet powerful characterization of the connectedness of a state space, that has proven successful in obtaining convergence bounds. Since the seventies they form an essential tool in…
Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…
We consider two different objects on super-critical Bernoulli percolation on $\mathbb{Z}^d$ : the time constant for i.i.d. first-passage percolation (for $d\geq 2$) and the isoperimetric constant (for $d=2$). We prove that both objects are…
We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
This paper focuses on the time constant for last passage percolation on complete graph. Let $G_n=([n],E_n)$ be the complete graph on vertex set $[n]=\{1,2,\ldots,n\}$, and i.i.d. sequence $\{X_e:e\in E_n\}$ be the passage times of edges.…
We analyze a non-standard isoperimetric problem in the plane associated with a metric having degenerate conformal factor at two points. Under certain assumptions on the conformal factor, we establish the existence of curves of least length…
A comparison theorem for the isoperimetric profile on the universal cover of surfaces evolving by normalised Ricci flow is proven. For any initial metric, a model comparison is constructed that initially lies below the profile of the…
We study the effects of surfaces on resistor percolation at the instance of a semi-infinite geometry. Particularly we are interested in the average resistance between two connected ports located on the surface. Based on general grounds as…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…
A stability version of the reverse isoperimetric inequality, and the corresponding inequality for isotropic measures are established.
In [1] the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of…
In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…
Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…