95 research outputs found
The early evolution of the H-free process
The H-free process, for some fixed graph H, is the random graph process
defined by starting with an empty graph on n vertices and then adding edges one
at a time, chosen uniformly at random subject to the constraint that no H
subgraph is formed. Let G be the random maximal H-free graph obtained at the
end of the process. When H is strictly 2-balanced, we show that for some c>0,
with high probability as , the minimum degree in G is at least
. This gives new lower bounds for
the Tur\'an numbers of certain bipartite graphs, such as the complete bipartite
graphs with . When H is a complete graph with we show that for some C>0, with high probability the independence number of
G is at most . This gives new lower bounds
for Ramsey numbers R(s,t) for fixed and t large. We also obtain new
bounds for the independence number of G for other graphs H, including the case
when H is a cycle. Our proofs use the differential equations method for random
graph processes to analyse the evolution of the process, and give further
information about the structure of the graphs obtained, including asymptotic
formulae for a broad class of subgraph extension variables.Comment: 36 page
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix,
where the tensor's entries denote the parity of the number of edges in
subgraphs induced by r distinct vertices. For r=2, it is the adjacency matrix
with 1's for edges and -1's for nonedges. It is well-known that the 2-norm of
the adjacency matrix of a random graph is O(\sqrt{n}). Here we show that the
2-norm of the r-parity tensor is at most f(r)\sqrt{n}\log^{O(r)}n, answering a
question of Frieze and Kannan who proved this for r=3. As a consequence, we get
a tight connection between the planted clique problem and the problem of
finding a vector that approximates the 2-norm of the r-parity tensor of a
random graph. Our proof method is based on an inductive application of
concentration of measure
The history of degenerate (bipartite) extremal graph problems
This paper is a survey on Extremal Graph Theory, primarily focusing on the
case when one of the excluded graphs is bipartite. On one hand we give an
introduction to this field and also describe many important results, methods,
problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version
of our survey presented in Erdos 100. In this version 2 only a citation was
complete
Functional limit theorems for random regular graphs
Consider d uniformly random permutation matrices on n labels. Consider the
sum of these matrices along with their transposes. The total can be interpreted
as the adjacency matrix of a random regular graph of degree 2d on n vertices.
We consider limit theorems for various combinatorial and analytical properties
of this graph (or the matrix) as n grows to infinity, either when d is kept
fixed or grows slowly with n. In a suitable weak convergence framework, we
prove that the (finite but growing in length) sequences of the number of short
cycles and of cyclically non-backtracking walks converge to distributional
limits. We estimate the total variation distance from the limit using Stein's
method. As an application of these results we derive limits of linear
functionals of the eigenvalues of the adjacency matrix. A key step in this
latter derivation is an extension of the Kahn-Szemer\'edi argument for
estimating the second largest eigenvalue for all values of d and n.Comment: Added Remark 27. 39 pages. To appear in Probability Theory and
Related Field
Poisson Statistics for the Largest Eigenvalues in Random Matrix Ensemble
The paper studies the spectral properties of large Wigner, band and sample
covariance random matrices with heavy tails of the marginal distributions of
matrix entries.Comment: This is an extended version of my talk at the QMath 9 conference at
Giens, France on September 13-17, 200
On Arrangements of Orthogonal Circles
In this paper, we study arrangements of orthogonal circles, that is,
arrangements of circles where every pair of circles must either be disjoint or
intersect at a right angle. Using geometric arguments, we show that such
arrangements have only a linear number of faces. This implies that orthogonal
circle intersection graphs have only a linear number of edges. When we restrict
ourselves to orthogonal unit circles, the resulting class of intersection
graphs is a subclass of penny graphs (that is, contact graphs of unit circles).
We show that, similarly to penny graphs, it is NP-hard to recognize orthogonal
unit circle intersection graphs.Comment: Appears in the Proceedings of the 27th International Symposium on
Graph Drawing and Network Visualization (GD 2019
The lacuna of capital, the state and war? The lost global history and theory of Eastern agency
In this article I seek to constructively engage Alex Anievas’s seminal book that is deservedly the subject of this forum. For Anievas has become a key figure in the revival of Trotskyism in IR and his is one of the first book-length treatments of the New Trotskyist theory of the international. My critique is meant merely as a constructive effort to push his excellent scholarship further in terms of developing his non-Eurocentric approach. In the first section I argue that his book represents a giant leap forward for the New Trotskyist IR. However, in the following sections I argue that although undeniably a brave attempt nevertheless, in the last instance, Anievas falls a few steps short in realising a genuinely non-Eurocentric account of world politics. This is because while he certainly restores or brings in ‘the lost theory and history of IR’ that elevates class forces to a central role in shaping world politics, nevertheless he fails to bring in ‘the lost global theory and history of Eastern agency’ that constitutes, in my view, the key ingredient of a non-Eurocentric approach to world politics. I also argue that while his anti-reductionist ontological credentials are for the most part extremely impressive, nevertheless, I argue that these are compromised in his analysis of Hitler’s racism. Finally, in the conclusion I ask whether the theoretical architecture of the New Trotskyism in IR is capable of developing a non-Eurocentric approach before concluding in the affirmative with respect to its modern revisionist incarnation of which Anievas is in the vanguard
- …