Title: Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach
This paper investigates the Robinson graphon completion/recovery problem within the class of $L^p$-graphons, focusing on the range $$5 5$, any $L^p$-graphon $$w$$ can be approximated by a Robinson graphon, with error of the approximation bounded in terms of $$\Lambda(w)$$. When viewing $$w$$ as a noisy version of a Robinson graphon, our method provides a concrete recipe for recovering a cut-norm approximation of a noiseless $$w$$. Given that any symmetric matrix is a special type of graphon, our results can be applicable to symmetric matrices of any size. Our work extends and improves previous results, where a similar question for the special case of $$L^\infty$$-graphons was answered. more »« less
Ivanisvili, P; Nazarov, F
(, International Mathematics Research Notices)
null
(Ed.)
Abstract Let $$1\leq p \leq q <\infty $$ and let $$w \in \mathbb{C}$$. Weissler conjectured that the Hermite operator $$e^{w\Delta }$$ is bounded as an operator from $$L^{p}$$ to $$L^{q}$$ on the Hamming cube $$\{-1,1\}^{n}$$ with the norm bound independent of $$n$$ if and only if $$\begin{align*} |p-2-e^{2w}(q-2)|\leq p-|e^{2w}|q. \end{align*}$$It was proved in [ 1], [ 2], and [ 17] in all cases except $$2<p\leq q <3$$ and $$3/2<p\leq q <2$$, which stood open until now. The goal of this paper is to give a full proof of Weissler’s conjecture in the case $p=q$. Several applications will be presented.
Farah, Luiz Gustavo; Holmer, Justin; Roudenko, Svetlana; Yang, Kai
(, American Journal of Mathematics)
Abstract: We consider the quadratic Zakharov-Kuznetsov equation $$\partial_t u + \partial_x \Delta u + \partial_x u^2=0$$ on $$\Bbb{R}^3$$. A solitary wave solution is given by $Q(x-t,y,z)$, where $$Q$$ is the ground state solution to $$-Q+\Delta Q+Q^2=0$$. We prove the asymptotic stability of these solitary wave solutions. Specifically, we show that initial data close to $$Q$$ in the energy space, evolves to a solution that, as $$t\to\infty$$, converges to a rescaling and shift of $Q(x-t,y,z)$ in $L^2$ in a rightward shifting region $$x>\delta t-\tan\theta\sqrt{y^2+z^2}$$ for $$0\leq\theta\leq{\pi\over 3}-\delta$$.
Bhattacharya, Bhaswar B.; Chatterjee, Anirban; Janson, Svante
(, Combinatorics, Probability and Computing)
Abstract Given a graphon $$W$$ and a finite simple graph $$H$$ , with vertex set $V(H)$ , denote by $$X_n(H, W)$$ the number of copies of $$H$$ in a $$W$$ -random graph on $$n$$ vertices. The asymptotic distribution of $$X_n(H, W)$$ was recently obtained by Hladký, Pelekis, and Šileikis [17] in the case where $$H$$ is a clique. In this paper, we extend this result to any fixed graph $$H$$ . Towards this we introduce a notion of $$H$$ -regularity of graphons and show that if the graphon $$W$$ is not $$H$$ -regular, then $$X_n(H, W)$$ has Gaussian fluctuations with scaling $$n^{|V(H)|-\frac{1}{2}}$$ . On the other hand, if $$W$$ is $$H$$ -regular, then the fluctuations are of order $$n^{|V(H)|-1}$$ and the limiting distribution of $$X_n(H, W)$$ can have both Gaussian and non-Gaussian components, where the non-Gaussian component is a (possibly) infinite weighted sum of centred chi-squared random variables with the weights determined by the spectral properties of a graphon derived from $$W$$ . Our proofs use the asymptotic theory of generalised $$U$$ -statistics developed by Janson and Nowicki [22]. We also investigate the structure of $$H$$ -regular graphons for which either the Gaussian or the non-Gaussian component of the limiting distribution (but not both) is degenerate. Interestingly, there are also $$H$$ -regular graphons $$W$$ for which both the Gaussian or the non-Gaussian components are degenerate, that is, $$X_n(H, W)$$ has a degenerate limit even under the scaling $$n^{|V(H)|-1}$$ . We give an example of this degeneracy with $$H=K_{1, 3}$$ (the 3-star) and also establish non-degeneracy in a few examples. This naturally leads to interesting open questions on higher order degeneracies.
Coregliano, Leonardo N; Malliaris, Maryanthe
(, Random Structures & Algorithms)
Call a hereditary family F of graphs strongly persistent if there exists a graphon W such that in all subgraphons W0 of W , F is precisely the class of finite graphs that have positive density in W0. Our first result is a complete characterization of the hereditary families of graphs that are strongly persistent as precisely those that are closed under substitutions. We call graphons with the self-similarity property above weakly random. A hereditary family F is said to have the weakly random Erdos–Hajnal property (WR) if every graphon that is a limit of graphs in F has a weakly random subgraphon. Among families of graphs that are closed under substitutions, we completely characterize the families that belong to WR as those with “few” prime graphs. We also extend some of the results above to structures in finite relational languages by using the theory of theons.
Wu, Jiahong; Zhao, Jiefeng
(, International Mathematics Research Notices)
Abstract The global well-posedness on the 2D resistive MHD equations without kinematic dissipation remains an outstanding open problem. This is a critical problem. Any $L^p$-norm of the vorticity $$\omega $$ with $$1\le p<\infty $$ has been shown to be bounded globally (in time), but whether the $$L^\infty $$-norm of $$\omega $$ is globally bounded remains elusive. The global boundedness of $$\|\omega \|_{L^\infty }$$ yields the resolution of the aforementioned open problem. This paper examines the $$L^\infty $$-norm of $$\omega $$ from a different perspective. We construct a sequence of initial data near a special steady state to show that the $$L^\infty $$-norm of $$\omega $$ is actually mildly ill-posed.
Ghandehari, Mahya, and Mishura, Teddy. Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach. Retrieved from https://par.nsf.gov/biblio/10610596. The Electronic Journal of Combinatorics 31.4 Web. doi:10.37236/12435.
Ghandehari, Mahya, & Mishura, Teddy. Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach. The Electronic Journal of Combinatorics, 31 (4). Retrieved from https://par.nsf.gov/biblio/10610596. https://doi.org/10.37236/12435
Ghandehari, Mahya, and Mishura, Teddy.
"Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach". The Electronic Journal of Combinatorics 31 (4). Country unknown/Code not available: Free Journal Network. https://doi.org/10.37236/12435.https://par.nsf.gov/biblio/10610596.
@article{osti_10610596,
place = {Country unknown/Code not available},
title = {Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach},
url = {https://par.nsf.gov/biblio/10610596},
DOI = {10.37236/12435},
abstractNote = {This paper investigates the Robinson graphon completion/recovery problem within the class of $L^p$-graphons, focusing on the range $5 5$, any $L^p$-graphon $w$ can be approximated by a Robinson graphon, with error of the approximation bounded in terms of $\Lambda(w)$. When viewing $w$ as a noisy version of a Robinson graphon, our method provides a concrete recipe for recovering a cut-norm approximation of a noiseless $w$. Given that any symmetric matrix is a special type of graphon, our results can be applicable to symmetric matrices of any size. Our work extends and improves previous results, where a similar question for the special case of $L^\infty$-graphons was answered.},
journal = {The Electronic Journal of Combinatorics},
volume = {31},
number = {4},
publisher = {Free Journal Network},
author = {Ghandehari, Mahya and Mishura, Teddy},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.