Discrepancy of random graphs and hypergraphs

Answering in a strong form a question posed by Bollobás and Scott, in this paper we determine the discrepancy between two random k‐uniform hypergraphs, up to a constant factor depending solely on k. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 47, 147–162, 2015     

Density theorems for bipartite graphs and related Ramsey-type results

In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve and generalize earlier results of various researchers. The proofs combine probabilistic arguments with some combinatorial ideas. In addition, these techniques can be used to study properties of graphs with a forbidden induced subgraph, edge intersection patterns in topological graphs, and to obtain several other Ramsey-type statements. Research supported by an NSF Graduate Research Fellowship and a Princeton Centennial Fellowship. Research supported in part by NSF CAREER award DMS-0812005 and by USA-Israeli BSF grant.     

Random regular graphs of high degree

Random d‐regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d‐regular graph when d=d(n) grows more quickly than . These properties include connectivity, hamiltonicity, independent set size, chromatic number, choice number, and the size of the second eigenvalue, among others. ©2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 346–363, 2001.     

Lipschitz continuity of quantile functions on spaces of random variables

We prove that quantile functions on spaces of random variables satisfy the Lipschitz condition with constant 1 with respect to any norm on a subspace of a space of random variables that majorizes L^∞-norm. The considered random variables not necessarily belong to this Banach space. Bibliography: 3 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 351–358, 2008, pp. 253–258.     

Numerical analysis of vortex cell efficiency in laminar and turbulent flows past a circular cylinder with embedded rotating bodies

The effect of flow intensification in small-sized vortex cells on the flow pattern in the near wake downstream of a cylinder and the cylinder drag in laminar and turbulent flows is analyzed on the basis of a numerical simulation of the two-dimensional steady-state flow past a circular cylinder with rotating cylindrical bodies built into the cylinder contour. St. Petersburg, Saratov. Translated from Izvestiya Rossiiskoi Akademii Nauk, Mekhanika Zhidkosti i Gaza, No. 4, pp. 88–96, July–August, 2000. The study was carried out with the support of the Russian Foundation for Basic Research (projects Nos. 99-01-01115 and 99-01-00772).     

The chromatic numbers of random hypergraphs

For a pair of integers 1≤γ<r, the γ-chromatic number of an r-uniform hypergraph H=(V, E) is the minimal k, for which there exists a partition of V into subsets T₁,…,T_k such that |e∩T_i|≤γ for every e∈E. In this paper we determine the asymptotic behavior of the γ-chromatic number of the random r-uniform hypergraph H_r(n, p) for all possible values of γ and for all values of p down to p=Θ(n^−r+1). © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12: 381–403, 1998