English
Related papers

Related papers: Invariance property for extended means

200 papers

We study some semi-linear equations for the $(m,p)$-Laplacian operator on locally finite weighted graphs. We prove existence of weak solutions for all $m\in\mathbb{N}$ and $p\in(1,+\infty)$ via a variational method already known in the…

Analysis of PDEs · Mathematics 2023-09-07 Andrea Pinamonti , Giorgio Stefani

The integrability condition called shape invariance is shown to have an underlying algebraic structure and the associated Lie algebras are identified. These shape-invariance algebras transform the parameters of the potentials such as…

Quantum Physics · Physics 2009-10-30 A. B. Balantekin

In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…

Combinatorics · Mathematics 2016-02-10 Mihyun Kang , Angelica Pachón , Pablo M. Rodriguez

We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…

Combinatorics · Mathematics 2013-12-17 Mikhail Isaev , K. V Isaeva

For $i = 0, 1, 2, \dots, k$, let $\mu_i$ be a Borel probability measure on $[0,1]$ which is equivalent to Lebesgue measure $\lambda$ and let $T_i:[0,1] \rightarrow [0,1]$ be $\mu_i$-preserving ergodic transformations. We say that…

Dynamical Systems · Mathematics 2023-05-31 Vitaly Bergelson , Younghwan Son

We introduce a two-parameter framework that refines several classical graph invariants by imposing higher-order constraints along bounded-length geodesics. For integers $k,d\ge1$, a vertex set is called $k,d$-independent if every shortest…

Combinatorics · Mathematics 2026-01-09 Brent Cody , Rose Detore

In this paper we study the diameter of Inhomogeneous random graphs $G(n,\kappa,p)$ that are induced by irreducible kernels $\kappa$. The kernels we consider act on separable metric spaces and are almost everywhere continuous. We generalize…

Probability · Mathematics 2015-11-02 Nicolas Fraiman , Dieter Mitsche

Functionals in geometric probability are often expressed as sums of bounded functions exhibiting exponential stabilization. Methods based on cumulant techniques and exponential modifications of measures show that such functionals satisfy…

Probability · Mathematics 2009-09-29 Yu Baryshnikov , P. Eichelsbacher , T. Schreiber , J. E. Yukich

Order the vertices of a directed random graph \math{v_1,...,v_n}; edge \math{(v_i,v_j)} for \math{i<j} exists independently with probability \math{p}. This random graph model is related to certain spreading processes on networks. We…

Combinatorics · Mathematics 2012-09-12 Paul Horn , Malik Magdon-Ismail

We establish a large deviation principle (LDP) for probability graphons, which are symmetric functions from the unit square into the space of probability measures. This notion extends classical graphons and provides a flexible framework for…

Probability · Mathematics 2025-09-18 Pierfrancesco Dionigi , Giulio Zucal

Let $T$ be the Koopman operator of a measure preserving transformation $\theta$ of a probability space $(X,\Sigma,\mu)$. We study the convergence properties of the averages $M_nf:=\frac1n\sum_{k=0}^{n-1}T^kf$ when $f \in L^r(\mu)$, $0<r<1$.…

Dynamical Systems · Mathematics 2024-01-02 el Houcein el Abdalaoui , Michael Lin

Bowen showed that a continuous expansive map with specification has a unique measure of maximal entropy. We show that the conclusion remains true under weaker non-uniform versions of these hypotheses. To this end, we introduce the notions…

Dynamical Systems · Mathematics 2019-02-20 Vaughn Climenhaga , Daniel J. Thompson

Let $M_{G}$ be the centered Hardy-Littlewood maximal operator on a finite graph $G$. We find $\underset{p\to \infty}{\lim}\|M_{G}\|_{p}^{p }$ when $G$ is the start graph ($S_n$) and the complete graph ($K_n$), and we fully describe…

Classical Analysis and ODEs · Mathematics 2020-11-06 Cristian González-Riquelme , José Madrid

We prove an analogue of E. Levi's Continuity Principle for meromorphic mappings with values in arbitrary compact complex manifolds in place of the Riemann sphere $\cc\pp^1$. The result is achieved by introducing a new extension method for…

Complex Variables · Mathematics 2009-09-25 Sergey Ivashkovich

In a recent paper, the last three authors showed that a game-theoretic $p$-harmonic function $v$ is characterized by an asymptotic mean value property with respect to a kind of mean value $\nu_p^r[v](x)$ defined variationally on balls…

Analysis of PDEs · Mathematics 2021-01-08 Evan W. Chandra , Michinori Ishiwata , Rolando Magnanini , Hidemitsu Wadade

We study the universality of the eigenvalue statistics of the covariance matrices $\frac{1}{n}M^* M$ where $M$ is a large $p\times n$ matrix obeying condition $\bf{C1}$. In particular, as an application, we prove a variant of universality…

Probability · Mathematics 2012-05-27 Ke Wang

Let $\mu_p(A,B,t)=(tA^p+(1-t)B^p)^{1/p}$ denote the weighted power mean between positive operators $A$ and $B$. We show that the function $t\to \|A-\mu_p(A,B,t)\|_2$ is monotonically decreasing whenever $1/2 \leq p \leq 1$. Hence showing…

Functional Analysis · Mathematics 2017-01-31 Raluca Dumitru , Jose Franco

Consider a foliation in the projective plane admitting a projective line as the unique invariant algebraic curve. Assume that the foliation is generic in the sense that its singular points are hyperbolic. We show that there is a unique…

Complex Variables · Mathematics 2017-07-19 Tien-Cuong Dinh , Nessim Sibony

The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…

Combinatorics · Mathematics 2023-11-06 Laurine Bénéteau , Jérémie Chalopin , Victor Chepoi , Yann Vaxès

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Combinatorics · Mathematics 2022-05-06 Stefan Steinerberger