English
Related papers

Related papers: A Resistance Bound via an Isoperimetric Inequality

200 papers

In this article, for the radiative transport equation, we study inverse problems of determining a time independent scattering coefficient or total attenuation by boundary data on the complementary sub-boundary after making one time input of…

Analysis of PDEs · Mathematics 2013-07-30 Manabu Machida , Masahiro Yamamoto

In Part I of this work we defined a generalization of the concept of effective resistance to directed graphs, and we explored some of the properties of this new definition. Here, we use the theory developed in Part I to compute effective…

Optimization and Control · Mathematics 2013-10-23 George Forrest Young , Luca Scardovi , Naomi Ehrich Leonard

In this paper, an upper bound on the nullity of signed graphs in terms of the cyclomatic number and the number of pendant vertices is proved, and the corresponding extremal signed graphs are completely characterized.

Combinatorics · Mathematics 2022-08-16 Keming Liu , Xiying Yuan

We investigate the steady state of a two-dimensional random resistor network subjected to two competing biased percolations as a function of the bias strength. The properties of the linear and nonlinear regimes are studied by means of Monte…

Statistical Mechanics · Physics 2007-05-23 C. Pennetta , E. Alfinito , L. Reggiani

Motivated by the numerical investigation by Aoki et al. [1], we study a rarefied gas flow between two parallel infinite plates of the same temperature governed by the Boltzmann equation with diffuse reflection boundaries, where one plate is…

Analysis of PDEs · Mathematics 2024-12-02 Renjun Duan , Zhu Zhang

An inverse problem for the wave equation outside an obstacle with a {\it dissipative boundary condition} is considered. The observed data are given by a single solution of the wave equation generated by an initial data supported on an open…

Analysis of PDEs · Mathematics 2016-07-22 Masaru Ikehata

We consider the problem of two-point resistance in a resistor network previously studied by one of us [F. Y. Wu, J. Phys. A {\bf 37}, 6653 (2004)]. By formulating the problem differently, we obtain a new expression for the two-point…

Statistical Mechanics · Physics 2015-06-17 N. Sh. Izmailian , R. Kenna , F. Y. Wu

This contribution is concerned with the effective viscosity problem, that is, the homogenization of the steady Stokes system with a random array of rigid particles, for which the main difficulty is the treatment of close particles. Standard…

Analysis of PDEs · Mathematics 2022-01-13 Mitia Duerinckx , Antoine Gloria

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

Combinatorics · Mathematics 2007-05-23 Gabor Elek

In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the…

Probability · Mathematics 2023-04-18 Pierre Le Bris , Christophe Poquet

We deal with an inverse problem arising in corrosion detection. We prove a stability estimate for a nonlinear term on the inaccessible portion of the boundary by electrostatic boundary measurements on the accessible one.

Analysis of PDEs · Mathematics 2007-05-23 Giovanni Alessandrini , Eva Sincich

In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…

Optimization and Control · Mathematics 2023-04-19 Andrei Agrachev , Stefano Baranzini , Ivan Beschastnyi

In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is…

Probability · Mathematics 2015-04-28 Daniel Ahlberg , Vladas Sidoravicius , Johan Tykesson

Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured…

Combinatorics · Mathematics 2011-09-23 T. C. E. Cheng , Yinkui Li , Chuandong Xu , Shenggui Zhang

We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…

Probability · Mathematics 2023-09-25 Tyler Helmuth , Will Perkins , Michail Sarantis

The aim of the paper is to present numerical results supporting the presence of conformal invariance in three dimensional statistical mechanics models at criticality and to elucidate the geometric aspects of universality. As a case study we…

Statistical Mechanics · Physics 2015-10-05 G. Gori , A. Trombettoni

We consider random walk on the structure given by a random hypergraph in the regime where there is a unique giant component. We give the asymptotics for hitting times, cover times, and commute times and show that the results obtained for…

Probability · Mathematics 2019-03-05 Amine Helali , Matthias Löwe

We apply the method of differential inequalities for the computation of upper bounds for the rate of convergence to the limiting regime for one specific class of (in)homogeneous continuous-time Markov chains. To obtain these estimates, we…

Probability · Mathematics 2021-05-13 Alexander Zeifman , Yacov Satin , Alexander Sipin

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…

Probability · Mathematics 2018-11-28 Serena Sian Yuan

A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…

Probability · Mathematics 2007-05-23 Alexey M. Kulik