Results 71 to 80 of about 1,372 (214)
Counting Independent Sets in Percolated Graphs via the Ising Model
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
Symmetrization results for a multi-exponent, degenerate and anisotropic electrostatic problem
In this paper, we give some isoperimetric inequalities for the capacity c p of an anisotropic configuration.
Gonoko Moussa
doaj
Inequalities and counterexamples for functional intrinsic volumes and beyond
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
Machine Learning for Maximizing the Memristivity of Single and Coupled Quantum Memristors
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
Sharp inequalities for coherent states and their optimizers
We are interested in sharp functional inequalities for the coherent state transform related to the Wehrl conjecture and its generalizations. This conjecture was settled by Lieb in the case of the Heisenberg group, Lieb and Solovej for SU(2), and Kulikov ...
Frank Rupert L.
doaj +1 more source
Expanderizing Higher‐Order Random Walks
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
Orlicz Mean Dual Affine Quermassintegrals
Our main aim is to generalize the mean dual affine quermassintegrals to the Orlicz space. Under the framework of dual Orlicz-Brunn-Minkowski theory, we introduce a new affine geometric quantity by calculating the first Orlicz variation of the mean dual ...
Chang-Jian Zhao, Wing-Sum Cheung
doaj +1 more source
Spectral sparsification of simplicial complexes for clustering and label propagation
As a generalization of the use of graphs to describe pairwise interactions, simplicial complexes can be used to model higher-order interactions between three or more objects in complex systems.
Braxton Osting +2 more
doaj +1 more source
Edge-isoperimetric inequalities .1. Information-theoretical methods
Ahlswede R, Cai N. Edge-isoperimetric inequalities .1. Information-theoretical methods. EUROPEAN JOURNAL OF COMBINATORICS.
Cai, Ning, Ahlswede, Rudolf
core +1 more source
A full classification of the isometries of the class of ball‐bodies
Abstract Complementing our previous results, we give a classification of all isometries (not necessarily surjective) of the metric space consisting of ball‐bodies, endowed with the Hausdorff metric. ‘Ball‐bodies’ are convex bodies which are intersections of translates of the Euclidean unit ball.
Shiri Artstein‐Avidan +2 more
wiley +1 more source

