Searcharxiv⌕ Search

arXiv subjects

Andrei Raigorodskii

Publications and source records attributed to Andrei Raigorodskii.

16 recordsLinked to original sources

On Threshold Probabilities for the Stability of the Independence Number of a Random Subgraph

For an arbitrary sequence of graphs $G_n$, we consider a random spanning subgraph $G_{n,p}$ in which each edge of the graph $G_n$ survives independently of the others with probability $p$. We obtain a general upper bound for the independence number $α(G_{n,p})$, from which, for an arbitrary probability $p=p(n)$, we derive sufficient conditions for asymptotic stability, i.e., for the equality $α(G_{n,p})=(1+o(1))α(G_n)$ asymptotically almost surely, as well as upper bounds for the independence number of the random subgraph, including unconditional ones; for $p=1/2$ they recover A. M. Raigorodskii's results of 2017 and 2026. Under additional conditions on the structure of the independent sets of the graph $G_n$, we find, up to a constant factor, the threshold probabilities for both asymptotic and exact stability (the equality $α(G_{n,p})=α(G_n)$). Special cases include results on the graphs $G(n,r,<s)$ for growing $r$ and $s$, including Kneser graphs for growing $r$; we also give examples of complete multipartite graphs, graphs on the blocks of Steiner systems, and $q$-analogues of Kneser graphs.

math.CO↗

On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s

We consider a random subgraph G_p(n,r,<s) of the complete distance graph G(n,r,<s) whose vertices are the r-element subsets of the set {1,...,n} and whose edges join pairs of subsets that intersect in fewer than s elements; each edge survives independently of the others with probability p. The stability of the Erdos-Ko-Rado theorem is the event that the independence number of the random subgraph equals that of the original graph, N = C_{n-s}^{r-s}. For fixed r and s, two-sided bounds for the critical probability, whose ratio depends on r and s, were obtained by P. A. Ogarok and A. M. Raigorodskii. In this paper we establish the order of the critical probability for growing r=r(n) and s=s(n): if min{C_r^s r^2, s r^3} = o(n), then the upper and lower bounds differ only by an absolute constant factor. The proof is elementary; only one of the two branches of the growth condition uses the complete nontrivial-intersection theorem of Ahlswede-Khachatrian.

math.CO↗

Quantum channel bounds for constant-composition codes

We extend the quantum-channel optimization of Alrabiah and Guruswami to $q$-ary constant-composition codes. We study explicit channel and flag constructions that recover selected classical asymptotic upper bounds, including the Ben-Haim--Litsyn, moving-subspace and Horn-channel bounds. We give two equivalent formulations, Gram and flag, and prove stability of the obtained upper bounds under permutation transport and generalized shortening. A hierarchy defined by bounding the output-state ranks within each flag improves strictly between consecutive levels at every composition and every positive distance below the Plotkin threshold. We provide finite matrix parametrizations of these bounds (i.e., the number of variables does not depend on the length of codes under consideration). Numerical optimization rapidly produces improvements over the known asymptotic upper bounds throughout all tested nonbinary parameter ranges. For rational input data, each finite level admits near-optimal feasible rational descriptions of polynomial length. Their feasibility can be checked exactly and their objective values computed to any prescribed accuracy in polynomial time; the associated threshold problem with a prescribed gap belongs to $\mathsf{PromiseNP}$.

cs.IT↗

A polynomial method over formal power series

We give new upper bounds on families of integer vectors with prescribed coordinate multiplicities and a forbidden scalar product. Our method uses coefficient functions over formal power series and recovers the Frankl--Wilson bound for binary vectors. For vectors in $\{-1,0,1\}^n$, we obtain an exponential improvement over the ordinary polynomial count in a wide range; in certain regimes, we determine the lower limit of the exponential base. We use the new bounds to make progress on several questions in combinatorial geometry. In particular, we improve the base of the exponent in Borsuk's partition problem: we construct finite subsets of $\mathbb R^N$ requiring at least $(1.37+o(1))^{\sqrt N}$ parts of smaller diameter for all sufficiently large $N$, and obtain a base of $1.3839$ along a subsequence of dimensions.

math.CO↗

Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes

Deriving upper bounds on code size from existing bounds is a classical approach in coding theory, dating back to the seminal results of Elias, Bassalygo, and Levenshtein. We study a framework encompassing the Bassalygo--Elias and Levenshtein inequalities for binary and nonbinary (constant-weight) codes and provides certain generalizations. The asymptotic cost of transferring a bound between different symbol compositions is expressed in terms of mutual information, yielding an information-theoretic optimal transport formulation. We determine the optimal permutation-transport cost between arbitrary compositions in terms of their least common majorant in the majorization order. Specializing to symmetric constant-weight compositions yields explicit transport profiles. As a byproduct, we establish unimodality of the asymptotic constant-weight rate as a function of the relative weight. We prove that the resulting closure operators are idempotent and that applying transport before outer Bassalygo--Elias averaging leaves the unrestricted bound obtained from the same input unchanged. We also establish necessary and sufficient conditions for an upper bound to be a fixed point of the closure operator. Since the asymptotic rate function is an upper bound for itself and it is a fixed point, we conclude the Schur concavity of the constant-composition rate function. Finally, we survey existing upper bounds for binary and nonbinary constant-weight and constant-composition codes, combine them into optimized envelopes within the transport framework, and obtain improved theoretical and numerical bounds.

cs.IT↗

On the Stability of the Independence Number in Random Distance Graphs

We consider a random subgraph $G_p(n,r,<s)$ of the complete distance graph $G(n,r,<s)$ whose vertices are the $r$-element subsets of the set $\{1,\dots,n\}$ and whose edges join pairs of subsets that intersect in fewer than $s$ elements; each edge survives independently of the others with probability $p$. The independence number of the graph $G(n,r,<s)$ equals $C_{n-s}^{r-s}$ -- this is the classical Erdos-Ko-Rado theorem. We prove that, for $r=r(n)\to\infty$, $s=s(n)\to\infty$, $s=o(r)$, $r^2=o(n)$ and $p\ge 16\,sr^2\ln(n/r)/n$, with probability tending to 1 the independence number of the random graph $G_p(n,r,<s)$ also equals $C_{n-s}^{r-s}$, i.e., the Erdos-Ko-Rado result is stable under random sparsification of the graph. Thereby, in the range of parameters $s\to\infty$, $s=o(r)$, a recent result of Raigorodskii and Karas is strengthened: the lower bound on the probability $p$ that guarantees stability is lowered by a factor of about $r/s$.

math.CO↗

Stochastic Origin Frank-Wolfe for traffic assignment

In this paper, we present the Stochastic Origin Frank-Wolfe (SOFW) method, which is a special case of the block-coordinate Frank-Wolfe algorithm, applied to the problem of finding equilibrium flow distributions. By significantly reducing the computational complexity of the minimization oracle, the method improves overall efficiency at the cost of increased memory consumption. Its key advantage lies in minimizing the number of shortest path computations. We refer to existing theoretical convergence guarantees for generalized coordinate Frank-Wolfe methods and, in addition, extend the analysis by providing a convergence proof for a batched version of the Block-Coordinate Frank-Wolfe algorithm, which was not covered in the original work. We also demonstrate the practical effectiveness of our approach through experimental results. In particular, our findings show that the proposed method significantly outperforms the classical Frank-Wolfe algorithm and its variants on large-scale datasets. On smaller datasets, SOFW also remains effective, though the performance gap relative to classical methods becomes less pronounced. In such cases, there is a trade-off between solution quality, iteration time complexity, and memory usage.

math.OC↗

Modularity of complex networks models

Modularity is designed to measure the strength of division of a network into clusters (known also as communities). Networks with high modularity have dense connections between the vertices within clusters but sparse connections between vertices of different clusters. As a result, modularity is often used in optimization methods for detecting community structure in networks, and so it is an important graph parameter from a practical point of view. Unfortunately, many existing non-spatial models of complex networks do not generate graphs with high modularity; on the other hand, spatial models naturally create clusters. We investigate this phenomenon by considering a few examples from both sub-classes. We prove precise theoretical results for the classical model of random d-regular graphs as well as the preferential attachment model, and contrast these results with the ones for the spatial preferential attachment (SPA) model that is a model for complex networks in which vertices are embedded in a metric space, and each vertex has a sphere of influence whose size increases if the vertex gains an in-link, and otherwise decreases with time. The results obtained in this paper can be used for developing statistical tests for models selection and to measure statistical significance of clusters observed in complex networks.

math.PR↗

PageRank in Undirected Random Graphs

PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning. In this paper, we study PageRank in undirected random graphs with an expansion property. The Chung-Lu random graph is an example of such a graph. We show that in the limit, as the size of the graph goes to infinity, PageR- ank can be approximated by a mixture of the restart distribution and the vertex degree distribution. We also extend the result to Stochastic Block Model (SBM) graphs, where we show that there is a correction term that depends on the community partitioning.

math.PR↗

PageRank in undirected random graphs

PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning.In this paper, we study PageRank in undirected random graphs with expansion property. The Chung-Lu random graph representsan example of such graphs. We show that in the limit, as the size of the graph goes to infinity, PageRank can be represented by a mixture of the restart distribution and the vertex degree distribution.

cs.SI↗

On the stability of the Erdős-Ko-Rado theorem

Delete the edges of a Kneser graph independently of each other with some probability: for what probabilities is the independence number of this random graph equal to the independence number of the Kneser graph itself? We prove a sharp threshold result for this question in certain regimes. Since an independent set in the Kneser graph is the same as a uniform intersecting family, this gives us a random analogue of the Erdős-Ko-Rado theorem.

math.CO↗

New bounds for the distance Ramsey number

In this paper we study the distance Ramsey number $R_{\it D}(s,t,d)$. The \textit{distance Ramsey number} $R_{\it D}(s,t,d) $ is the minimum number $n$ such that for any graph $ G $ on $ n $ vertices, either $G$ contains an induced $ s $-vertex subgraph isomorphic to a distance graph in $ \Real^d $ or $ \bar {G} $ contains an induced $ t $-vertex subgraph isomorphic to the distance graph in $ \Real^d $. We obtain the upper and lower bounds on $R_{\it D}(s,s,d),$ which are similar to the bounds for the classical Ramsey number $R(\lceil \frac{s}{[d/2]} \rceil, \lceil \frac{s}{[d/2]} \rceil)$.

math.CO↗

Empirical Validation of the Buckley--Osthus Model for the Web Host Graph: Degree and Edge Distributions

There has been a lot of research on random graph models for large real-world networks such as those formed by hyperlinks between web pages in the world wide web. Though largely successful qualitatively in capturing their key properties, such models may lack important quantitative characteristics of Internet graphs. While preferential attachment random graph models were shown to be capable of reflecting the degree distribution of the webgraph, their ability to reflect certain aspects of the edge distribution was not yet well studied. In this paper, we consider the Buckley--Osthus implementation of preferential attachment and its ability to model the web host graph in two aspects. One is the degree distribution that we observe to follow the power law, as often being the case for real-world graphs. Another one is the two-dimensional edge distribution, the number of edges between vertices of given degrees. We fit a single "initial attractiveness" parameter $a$ of the model, first with respect to the degree distribution of the web host graph, and then, absolutely independently, with respect to the edge distribution. Surprisingly, the values of $a$ we obtain turn out to be nearly the same. Therefore the same model with the same value of the parameter $a$ fits very well the two independent and basic aspects of the web host graph. In addition, we demonstrate that other models completely lack the asymptotic behavior of the edge distribution of the web host graph, even when accurately capturing the degree distribution. To the best of our knowledge, this is the first attempt for a real graph of Internet to describe the distribution of edges between vertices with respect to their degrees.

cs.SI↗

Distance graphs having large chromatic numbers and not containing cliques or cycles of given size

In this work, the classical Nelson -- Hadwiger problem is studied which lies on the edge of combinatorial geometry and graph theory. It concerns colorings of distance graphs in $ {\mathbb R}^n $, i.e., graphs such that their vertices are vectors and their edges are pairs of vectors at a distance from a given set of postive numbers apart. A series of new lower bounds are obtained for the chromatic numbers of such graphs with different restrictions on the clique numbers and the girths.

math.CO↗

Counterexamples to Borsuk's conjecture on spheres of small radii

In this work, the classical Borsuk conjecture is discussed, which states that any set of diameter 1 in the Euclidean space $ {\mathbb R}^d $ can be divided into $ d+1 $ parts of smaller diameter. During the last two decades, many counterexamples to the conjecture have been proposed in high dimensions. However, all of them are sets of diameter 1 that lie on spheres whose radii are close to the value $ {1}{\sqrt{2}} $. The main result of this paper is as follows: {\it for any $ r > {1}{2} $, there exists a $ d_0 $ such that for all $ d \ge d_0 $, a counterexample to Borsuk's conjecture can be found on a sphere $ S_r^{d-1} \subset {\mathbb R}^d $.

math.CO↗