Searcharxiv⌕ Search

arXiv subjects

Dávid Kunszenti-Kovács

Publications and source records attributed to Dávid Kunszenti-Kovács.

16 recordsLinked to original sources

The cut norm and Sampling Lemmas for unbounded kernels

Generalizing the bounded kernel results of Borgs, Chayes, Lovász, Sós and Vesztergombi (2008), we prove two Sampling Lemmas for unbounded kernels with respect to the cut norm. On the one hand, we show that given a (symmetric) kernel $U\in L^p([0,1]^2)$ for some $3 2$ here). These results are then partially extended to the case of vector valued kernels. On the other hand, we show that with high probability, the $k$-samples are also close to $U$ in the cut metric, albeit with a weaker bound of order $O((\ln k)^{-\frac12+\frac1{2p}})$ (for any appropriate $p>2$). As a corollary, we obtain that whenever $U\in L^p$ with $p>4$, the $k$-samples converge almost surely to $U$ in the cut metric as $k\to\infty$.

math.PR↗

Subgraph densities in Markov spaces

We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure on maps of a finite graph into a Markov space. The existence of such homomorphism measures is not always guaranteed, but can be established under rather natural smoothness conditions on the Markov space and sparseness conditions on the graph. This continues a direction in graph limit theory in which such measures are viewed as limits of graph sequences.

math.PR↗

A second-order Magnus-type integrator for evolution equations with delay

We rewrite abstract delay equations to nonautonomous abstract Cauchy problems allowing us to introduce a Magnus-type integrator for the former. We prove the second-order convergence of the obtained Magnus-type integrator. We also show that if the differential operators involved admit a common invariant set for their generated semigroups, then the Magnus-type integrator will respect this invariant set as well, allowing for much weaker assumptions to obtain the desired convergence. As an illustrative example we consider a space-dependent epidemic model with latent period and diffusion.

math.NA↗

Multigraph limits, unbounded kernels, and Banach space decorated graphs

We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense. This general functional analytic framework provides a universal language for various combinatorial limit notions. In particular it makes it possible to assign limit objects to multigraph sequences that are convergent in the sense of node-and-edge homomorphism numbers, and it generalizes the limit theory for graph sequences with compact decorations.

math.CO↗

Random homomorphisms into the orthogonality graph

Subgraph densities have been defined, and served as basic tools, both in the case of graphons (limits of dense graph sequences) and graphings (limits of bounded-degree graph sequences). While limit objects have been described for the "middle ranges", the notion of subgraph densities in these limit objects remains elusive. We define subgraph densities in the orthogonality graphs on the unit spheres in dimension $d$, under appropriate sparsity condition on the subgraphs. These orthogonality graphs exhibit the main difficulties of defining subgraphs the "middle" range, and so we expect their study to serve as a key example to defining subgraph densities in more general Markov spaces. The problem can also be formulated as defining and computing random orthogonal representations of graphs. Orthogonal representations have played a role in information theory, optimization, rigidity theory and quantum physics, so to study random ones may be of interest from the point of view of these applications as well.

math.CO↗

Counter-examples to the Dunford-Schwartz pointwise ergodic theorem on $L^1+L^\infty$

Extending a result by Chilin and Litvinov, we show by construction that given any $σ$-finite infinite measure space $(Ω,\mathcal{A}, μ)$ and a function $f\in L^1(Ω)+L^\infty(Ω)$ with $μ(\{|f|>\varepsilon\})=\infty$ for some $\varepsilon>0$, there exists a Dunford-Schwartz operator $T$ over $(Ω,\mathcal{A}, μ)$ such that $\frac{1}{N}\sum_{n=1}^N (T^nf)(x)$ fails to converge for almost every $x\inΩ$. In addition, for each operator we construct, the set of functions for which pointwise convergence fails almost everywhere is residual in $L^1(Ω)+L^\infty(Ω)$.

math.DS↗

Pointwise entangled ergodic theorems for Dunford-Schwartz operators

We investigate pointwise convergence of entangled ergodic averages of Dunford-Schwartz operators $T_0,T_1,\ldots, T_m$ on a Borel probability space. These averages take the form \[ \frac{1}{N^k}\sum_{1\leq n_1,\ldots, n_k\leq N} T_m^{n_{α(m)}}A_{m-1}T^{n_{α(m-1)}}_{m-1}\ldots A_2T_2^{n_{α(2)}}A_1T_1^{n_{α(1)}} f, \] where $f\in L^p(X,μ)$ for some $1\leq p<\infty$, and $α:\left\{1,\ldots,m\right\}\to\left\{1,\ldots,k\right\}$ encodes the entanglement. We prove that under some joint boundedness and twisted compactness conditions on the pairs $(A_i,T_i)$, almost everywhere convergence holds for all $f\in L^p$. We also present an extension to polynomial powers in the case $p=2$, in addition to a continuous version concerning Dunford-Schwartz $C_0$-semigroups.

math.FA↗

On the dense Preferential Attachment Graph models and their graphon induced counterpart

Letting $\mathcal{M}$ denote the space of finite measures on $\mathbb{N}$, and $μ_λ\in\mathcal{M}$ denote the Poisson distribution with parameter $λ$, the function $W:[0,1]^2\to\mathcal{M}$ given by \[ W(x,y)=μ_{c\log x\log y} \] is called the PAG graphon with density $c$. It is known that this is the limit, in the multigraph homomorphism sense, of the dense Preferential Attachment Graph (PAG) model with edge density $c$. This graphon can then in turn be used to generate the so-called W-random graphs in a natural way. The aim of this paper is to compare the dense PAG model with the W-random graph model obtained from the corresponding graphon. Motivated by the multigraph limit theory, we investigate the expected jumble norm distance of the two models in terms on the number of vertices $n$. We present a coupling for which the expectation can be bounded from above by $O(\log^2 n\cdot n^{-1/3})$, and provide a universal lower bound that is coupling independent, but with a worse exponent.

math.CO↗

On the pointwise entangled ergodic theorem

We present some twisted compactness conditions for almost everywhere convergence of one-parameter entangled ergodic averages of Dunford-Schwartz operators $T_0,\ldots, T_a$ on a Borel probability space of the form $$ \sum_{n=1}^N T_a^n A_{a-1}T_{a-1}^nA_{a-1}\cdot \ldots \cdot A_0 T_0^nf$$ for $f\in L^p(X,μ)$, $p\geq 1$. We also discuss examples and present a continuous version of the result.

math.DS↗

On the error of Fokker-Planck approximations of some one-step density dependent processes

Using operator semigroup methods, we show that Fokker-Planck type second-order PDE-s can be used to approximate the evolution of the distribution of a one-step process on $N$ particles governed by a large system of ODEs. The error bound is shown to be of order $O(1/N)$, surpassing earlier results that yielded this order for the error only for the expected value of the process, through mean-field approximations. We also present some conjectures showing that the methods used have the potential to yield even stronger bounds, up to $O(1/N^3)$.

math.FA↗

Measures on the square as sparse graph limits

We study a metric on the set of finite graphs in which two graphs are considered to be similar if they have similar bounded dimensional "factors". We show that limits of convergent graph sequences in this metric can be represented by symmetric Borel measures on $[0,1]^2$. This leads to a generalization of dense graph limit theory to sparse graph sequences.

math.CO↗

Almost everywhere convergence of entangled ergodic averages

We study pointwise convergence of entangled averages of the form \[ \frac{1}{N^k}\sum_{1\leq n_1,\ldots, n_k\leq N} T_m^{n_{α(m)}}A_{m-1}T^{n_{α(m-1)}}_{m-1}\ldots A_2T_2^{n_{α(2)}}A_1T_1^{n_{α(1)}} f, \] where $f\in L^2(X,μ)$, $α:\left\{1,\ldots,m\right\}\to\left\{1,\ldots,k\right\}$, and the $T_i$ are ergodic measure preserving transformations on the standard probability space $(X,μ)$. We show that under some joint boundedness and twisted compactness conditions on the pairs $(A_i,T_i)$, almost everywhere convergence holds for all $f\in L^2$. We also present results for the general $L^p$ case ($1\leq p<\infty$) and for polynomial powers, in addition to continuous versions concerning ergodic flows.

math.DS↗

Uniqueness of Banach space valued graphons

A Banach space valued graphon is a function $W:(Ω, \mathcal{A},π)^2\to\mathcal{Z}$ from a probability space to a Banach space with a separable predual, measurable in a suitable sense, and lying in appropriate $L^p$-spaces. As such we may consider $W(x,y)$ as a two-variable random element of the Banach space. A two-dimensional analogue of moments can be defined with the help of graphs and weak-* evaluations, and a natural question that then arises is whether these generalized moments determine the function $W$ uniquely -- up to measure preserving transformations. The main motivation comes from the theory of multigraph limits, where these graphons arise as the natural limit objects for convergence in a generalized homomorphism sense. Our main result is that this holds true under some Carleman-type condition, but fails in general even with $\mathcal{Z}=\mathbb{R}$, for reasons related to the classical moment-problem. In particular, limits of multigraph sequences are uniquely determined - up to measure preserving transformations - whenever the tails of the edge-distributions stay small enough.

math.FA↗

PDE approximation of large systems of differential equations

A large system of ordinary differential equations is approximated by a parabolic partial differential equation with dynamic boundary condition and a different one with Robin boundary condition. Using the theory of differential operators with Wentzell boundary conditions and similar theories, we give estimates on the order of approximation. The theory is demonstrated on a voter model where the Fourier method applied to the PDE is of great advantage.

math.FA↗

Almost weak polynomial stability of operators

We investigate whether almost weak stability of an operator $T$ on a Banach space $X$ implies its almost weak polynomial stability. We show, using a modified version of the van der Corput Lemma that if $X$ is a Hilbert space and $T$ a contraction, then the implication holds. On the other hand, based on a TDS arising from a two dimensional ODE, we give an explicit example of a contraction on a $C_0$ space that is almost weakly stable, but its appropriate polynomial powers fail to converge weakly to zero along a subsequence of density 1. Finally we provide an application to convergence of polynomial multiple ergodic averages.

math.FA↗

Decomposition of operator semigroups on W*-algebras

We consider semigroups of operators on a W$^*$-algebra and prove, under appropriate assumptions, the existence of a Jacobs-DeLeeuw-Glicksberg type decomposition. This decomposition splits the algebra into a "stable" and "reversible" part with respect to the semigroup and yields, among others, a structural approach to the Perron-Frobenius spectral theory for completely positive operators on W$^*$-algebras.

math.OA↗