相关论文: Random unconditional convergence of Rademacher cha…
We study density estimates of an index set $\mathcal{A}$, under which unconditionality (or even a weaker property of the random unconditional divergence) of the corresponding Rademacher fractional chaos $\{r_{j_1}(t)\cdot…
Necessary and sufficient conditions for the equivalence of the Rademacher chaos to the canonical basis of l_2 and also for the complementability of the corresponding generated subspace are derived. In particular, we obtain the…
It is shown that a specific ordering of the Rademacher chaos leads to a basic sequence in a wide class of symmetric spaces on the segment [0,1]. Necessary and sufficient conditions on a such space are found for Rademacher chaos to possess…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
The present note is an essential addition to the author's arxiv paper arXiv:2001.01070, concerning general multiplicative systems of random variables. Using some lemmas and the methodology of \cite{Kar4}, we obtain a general extreme…
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…
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…
In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\"os-R\'enyi random graphs in a random environment. We show that the expected number of…
We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection…
Erd\H{o}s and R\'{e}nyi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
We determine to within a constant factor the threshold for the property that two random k-uniform hypergraphs with edge probability p have an edge-disjoint packing into the same vertex set. More generally, we allow the hypergraphs to have…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…
This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…
For a given graph $F$ we consider the family of (finite) graphs $G$ with the Ramsey property for $F$, that is the set of such graphs $G$ with the property that every two-colouring of the edges of $G$ yields a monochromatic copy of $F$. For…
In this article, we prove that in the Rademacher setting, a random vector with chaotic components is close in distribution to a centred Gaussian vector, if both the maximal influence of the associated kernel and the fourth cumulant of each…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…