On a problem of Erd\H{o}s and Rothschild on edges in triangles

Erd\H{o}s and Rothschild asked to estimate the maximum number, denoted by H(N,C), such that every N-vertex graph with at least CN^2 edges, each of which is contained in at least one triangle, must contain an edge that is in at least H(N,C) triangles. In particular, Erd\H{o}s asked in 1987 to determine whether for every C>0 there is \epsilon >0 such that H(N,C) > N^\epsilon, for all sufficiently large N. We prove that H(N,C) = N^{O(1/log log N)} for every fixed C < 1/4. This gives a negative answer to the question of Erd\H{o}s, and is best possible in terms of the range for C, as it is known that every N-vertex graph with more than (N^2)/4 edges contains an edge that is in at least N/6 triangles.Comment: 8 page

On two problems in graph Ramsey theory

We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every two-coloring of the edges of the complete graph $K_N$ contains a monochromatic copy of H. A famous result of Chv\'atal, R\"{o}dl, Szemer\'edi and Trotter states that there exists a constant c(\Delta) such that r(H) \leq c(\Delta) n for every graph H with n vertices and maximum degree \Delta. The important open question is to determine the constant c(\Delta). The best results, both due to Graham, R\"{o}dl and Ruci\'nski, state that there are constants c and c' such that 2^{c' \Delta} \leq c(\Delta) \leq 2^{c \Delta \log^2 \Delta}. We improve this upper bound, showing that there is a constant c for which c(\Delta) \leq 2^{c \Delta \log \Delta}. The induced Ramsey number r_{ind}(H) of a graph H is the least positive integer N for which there exists a graph G on N vertices such that every two-coloring of the edges of G contains an induced monochromatic copy of H. Erd\H{o}s conjectured the existence of a constant c such that, for any graph H on n vertices, r_{ind}(H) \leq 2^{c n}. We move a step closer to proving this conjecture, showing that r_{ind} (H) \leq 2^{c n \log n}. This improves upon an earlier result of Kohayakawa, Pr\"{o}mel and R\"{o}dl by a factor of \log n in the exponent.Comment: 18 page

Inter-similarity between coupled networks

Recent studies have shown that a system composed from several randomly interdependent networks is extremely vulnerable to random failure. However, real interdependent networks are usually not randomly interdependent, rather a pair of dependent nodes are coupled according to some regularity which we coin inter-similarity. For example, we study a system composed from an interdependent world wide port network and a world wide airport network and show that well connected ports tend to couple with well connected airports. We introduce two quantities for measuring the level of inter-similarity between networks (i) Inter degree-degree correlation (IDDC) (ii) Inter-clustering coefficient (ICC). We then show both by simulation models and by analyzing the port-airport system that as the networks become more inter-similar the system becomes significantly more robust to random failure.Comment: 4 pages, 3 figure

Quantum Diffusion and Delocalization for Band Matrices with General Distribution

We consider Hermitian and symmetric random band matrices $H$ in $d \geq 1$ dimensions. The matrix elements $H_{xy}$, indexed by $x,y \in \Lambda \subset \Z^d$, are independent and their variances satisfy \sigma_{xy}^2:=\E \abs{H_{xy}}^2 = W^{-d} f((x - y)/W) for some probability density $f$. We assume that the law of each matrix element $H_{xy}$ is symmetric and exhibits subexponential decay. We prove that the time evolution of a quantum particle subject to the Hamiltonian $H$ is diffusive on time scales $t\ll W^{d/3}$. We also show that the localization length of the eigenvectors of $H$ is larger than a factor $W^{d/6}$ times the band width $W$. All results are uniform in the size \abs{\Lambda} of the matrix. This extends our recent result \cite{erdosknowles} to general band matrices. As another consequence of our proof we show that, for a larger class of random matrices satisfying $\sum_x\sigma_{xy}^2=1$ for all $y$, the largest eigenvalue of $H$ is bounded with high probability by $2 + M^{-2/3 + \epsilon}$ for any $\epsilon > 0$, where M \deq 1 / (\max_{x,y} \sigma_{xy}^2).Comment: Corrected typos and some inaccuracies in appendix

The critical window for the classical Ramsey-Tur\'an problem

The first application of Szemer\'edi's powerful regularity method was the following celebrated Ramsey-Tur\'an result proved by Szemer\'edi in 1972: any K_4-free graph on N vertices with independence number o(N) has at most (1/8 + o(1)) N^2 edges. Four years later, Bollob\'as and Erd\H{o}s gave a surprising geometric construction, utilizing the isoperimetric inequality for the high dimensional sphere, of a K_4-free graph on N vertices with independence number o(N) and (1/8 - o(1)) N^2 edges. Starting with Bollob\'as and Erd\H{o}s in 1976, several problems have been asked on estimating the minimum possible independence number in the critical window, when the number of edges is about N^2 / 8. These problems have received considerable attention and remained one of the main open problems in this area. In this paper, we give nearly best-possible bounds, solving the various open problems concerning this critical window.Comment: 34 page

Problems and Results on Additive Properties of General Sequences IV

Let A={a1,a2,⋯}, a1<a2<⋯, be an infinite sequence of positive integers. One defines its counting function as A(n)=Card{a∈A;a≤n} (n=0,1,2,⋯), and the representation functions R1(n), R2(n), R3(n) (n=0,1,2,⋯), as being the number of representations of n in the form: (1) n=a+a′, a∈A, a′∈A, (2) n=a+a′, a<a′, a∈A, a′∈A, (3) n=a+a′, a≤a′, a∈A, a′∈A, respectively. Of course, for any n≥0, R1(n)=R2(n)+R3(n), and R3(n) is equal either to R2(n)+1, if n is even and n/2 belongs to A, or to R2(n), otherwise. In the first three parts of this series of papers [Erdős and Sárközy, Part I, Pacific J. Math. 118 (1985), no. 2, 347–357; MR0789175 (86j:11015); Part II, Acta Math. Hungar. 48 (1986), 201–211; MR0858398 (88c:11016); Part III, the authors, Studia Sci. Math. Hungar. 22 (1987), no. 1, 53–63], regularity properties of the asymptotic behavior of the function R1 were studied. In Parts IV and V the authors study monotonicity properties of the three functions R1,R2,R3. In Part IV, they prove first that the function R1 is monotone increasing from a certain point on (i.e., there exists an n0 withR1(n+1)≥R1(n) for n≥n0) if and only if the sequence A contains all the integers from a certain point on. The proof uses elementary but complex considerations on counting functions. Secondly, they show that R2 has a different behavior, by exhibiting a class of sequences A satisfying A(n <n−cn1/3 for all large n and such that R2 is monotone increasing from some point onwards. The third result proved in Part IV is that if A(n)=o(n/logn) then the functions R2 and R3 cannot be monotone increasing from a certain point on. Here, the proof is based on analytic properties of the generating function f(z)=∑a∈Aza (|z|<1), corresponding to the sequence A. Part V treats the monotonicity of R3. The main result is as follows: If (4) limn→+∞(n−A(n))/logn=+∞, then lim supN→+∞∑k=1N(R3(2k)−R3(2k+1))=+∞. (Thus, roughly speaking, ai+aj assumes more even values than odd ones.) This theorem implies, firstly, that under hypothesis (4), which is weaker than A(n)=o(n/logn), R3 cannot be monotone increasing from a certain point on, and, secondly, that if A is an infinite "Sidon sequence'' (also called a "B2-sequence'', i.e., a sequence such that R3(n)≤1 for all n), then there are infinitely many integers k such that 2k can be represented in the form 2k=a+a′, a∈A, a′∈A, but 2k+1=a+a′, a∈A, a′∈A, is impossible. Part V finishes with the construction of a sequence showing that the main result is almost best possible. The proofs in Part V are of the same nature as those in Part IV

Cantor type functions in non-integer bases

Cantor's ternary function is generalized to arbitrary base-change functions in non-integer bases. Some of them share the curious properties of Cantor's function, while others behave quite differently

Robustness of a Network of Networks

Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical framework for studying interacting networks and present an exact percolation law for a network of $n$ interdependent networks. In particular, we find that for $n$ Erd\H{o}s-R\'{e}nyi networks each of average degree $k$, the giant component, $P_{\infty}$, is given by $P_{\infty}=p[1-\exp(-kP_{\infty})]^n$ where $1-p$ is the initial fraction of removed nodes. Our general result coincides for $n=1$ with the known Erd\H{o}s-R\'{e}nyi second-order phase transition for a single network. For any $n \geq 2$ cascading failures occur and the transition becomes a first-order percolation transition. The new law for $P_{\infty}$ shows that percolation theory that is extensively studied in physics and mathematics is a limiting case ($n=1$) of a more general general and different percolation law for interdependent networks.Comment: 7 pages, 3 figure

All scale-free networks are sparse

We study the realizability of scale free-networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this finding by analytical reasoning and by a numerical method, proposed here, based on extreme value arguments, which can be applied to any given degree distribution. Our results reveal a fundamental reason why large scale-free networks without constraints on minimum and maximum degree must be sparse.Comment: 4 pages, 2 figure

Trapping in complex networks

We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density $\rho(t)$ of random walkers in the presence of one or multiple traps with concentration $c$. We show using theory and simulations that in ER networks, while for short times $\rho(t) \propto \exp(-Act)$, for longer times $\rho(t)$ exhibits a more complex behavior, with explicit dependence on both the number of traps and the size of the network. In SF networks we reveal the significant impact of the trap's location: $\rho(t)$ is drastically different when a trap is placed on a random node compared to the case of the trap being on the node with the maximum connectivity. For the latter case we find \rho(t)\propto\exp\left[-At/N^\frac{\gamma-2}{\gamma-1}\av{k}\right] for all $\gamma>2$, where $\gamma$ is the exponent of the degree distribution $P(k)\propto k^{-\gamma}$.Comment: Appendix adde