Results 61 to 70 of about 1,599 (218)
Isoperimetric inequalities in graphs and surfaces [PDF]
Electronic Notes in Discrete Mathematics, 2014 Let M be the set of metric spaces that are either graphs with bounded degree or Riemannian manifolds with bounded geometry. Kanai proved the quasi-isometric stability of several geometric properties (in particular, of isoperimetric inequalities) for the spaces in M.
Cantón Pire, Alicia +3 more
openaire +2 more sources
Counting Independent Sets in Percolated Graphs via the Ising Model
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT Given a graph G$$ G $$, we form a random subgraph Gp$$ {G}_p $$ by including each edge of G$$ G $$ independently with probability p$$ p $$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite graphs satisfying certain vertex‐isoperimetric properties, extending the work of ...
Anna Geisler +3 more
wiley +1 more source
The sharp quantitative isoperimetric inequality
, 2008 A quantitative sharp form of the classical isoperimetric inequality is proved, thus giving a positive answer to a conjecture by ...
MAGGI F. +6 more
core +1 more source
Isoperimetric inequalities of the fourth order Neumann eigenvalues
Journal of Inequalities and Applications, 2020 In this paper, we obtain some isoperimetric inequalities for the first ( n − 1 ) $(n-1)$ eigenvalues of the fourth order Neumann Laplacian on bounded domains in an n-dimensional Euclidean space. Our result supports strongly the conjecture of Chasman.
Yanlin Deng, Feng Du
doaj +1 more source
Inequalities and counterexamples for functional intrinsic volumes and beyond
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We show that analytic analogs of Brunn–Minkowski‐type inequalities fail for functional intrinsic volumes on convex functions. This is demonstrated both through counterexamples and by connecting the problem to results of Colesanti, Hug, and Saorín Gómez.
Fabian Mussnig, Jacopo Ulivelli
wiley +1 more source
Quantitative stability in the isodiametric inequality via the isoperimetric inequality
, 2014 The isodiametric inequality is derived from the isoperimetric inequality through a variational principle, establishing that balls maximize the perimeter among convex sets with fixed diameter.
Ponsiglione M. +5 more
core +2 more sources
Exact bounds for tail probabilities of martingales with bounded differences
Lietuvos Matematikos Rinkinys, 2009 We consider random walks, say Wn = {0, M1, . . ., Mn} of length n starting at 0 and based on a martingale sequence Mk = X1 + ··· + Xk with differences Xm. Assuming |Xk| \leq 1 we solve the isoperimetric problem Bn(x) = supP\{Wn visits an interval [x,∞
Dainius Dzindzalieta
doaj +1 more source
Machine Learning for Maximizing the Memristivity of Single and Coupled Quantum Memristors
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.Machine learning (ML) methods are proposed to characterize the memristive properties of single and coupled quantum memristors. It is shown that maximizing the memristivity leads to large values in the degree of entanglement of two quantum memristors, unveiling the close relationship between quantum correlations and memory.
Carlos Hernani‐Morales +5 more
wiley +1 more source
Advanced Nonlinear Studies, 2021 Through conformal map, isoperimetric inequalities are equivalent to the Hardy–Littlewood–Sobolev (HLS) inequalities involved with the Poisson-type kernel on the upper half space.
Tao Chunxia
doaj +1 more source
Expanderizing Higher‐Order Random Walks
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We study a variant of the down‐up (also known as the Glauber dynamics) and up‐down walks over an n$$ n $$‐partite simplicial complex, which we call expanderized higher‐order random walks—where the sequence of updated coordinates corresponds to the sequence of vertices visited by a random walk over an auxiliary expander graph H$$ H $$. When H$$
Vedat Levi Alev, Shravas Rao
wiley +1 more source