In this paper we explore first passage percolation (FPP) on the Erdős–Rényi random graph Gn(pn), where we assign independent random weights, having an exponential distribution with rate 1, to the edges. In the sparse regime, i.e., when npn → λ > 1, we find refined asymptotics both for the minimal weight of the path between uniformly chosen vertices in the giant component, as well as for the hopcount (i.e., the number of edges) on this minimal weight path. More precisely, we prove a central limit theorem for the hopcount, with asymptotic mean and variance both equal to (λ log n)/(λ − 1). Furthermore, we prove that the minimal weight centred by (log n)/(λ − 1) converges in distribution.

We also investigate the dense regime, where npn → ∞. We find that although the base graph is ultra-small (meaning that graph distances between uniformly chosen vertices are o(log n)), attaching random edge weights changes the geometry of the network completely. Indeed, the hopcount Hn satisfies the universality property that whatever the value of pn, Hn/log n → 1 in probability and, more precisely, (Hn − βn log n)/, where βn = λn/(λn − 1), has a limiting standard normal distribution. The constant βn can be replaced by 1 precisely when λn ≫ , a case that has appeared in the literature (under stronger conditions on λn) in [4, 13]. We also find lower bounds for the maximum, over all pairs of vertices, of the optimal weight and hopcount.

This paper continues the investigation of FPP initiated in [4] and [5]. Compared to the setting on the configuration model studied in [5], the proofs presented here are much simpler due to a direct relation between FPP on the Erdős–Rényi random graph and thinned continuous-time branching processes.

In this paper, we study certain pairings which are defined as follows: if A and B are finite subsets of an arbitrary group, a Wakeford–Fan–Losonczy pairing from B onto A is a bijection φ : B → A such that bφ(b) ∉ A, for every b ∈ B. The number of such pairings is denoted by μ(B, A).

We investigate the quantity μ(B, A) for A and B, two finite subsets of an arbitrary group satisfying 1 ∉ B, |A| = |B|, and the fact that the order of every element of B is ≥ |B| + 1. Extending earlier results, we show that in this case, μ(B, A) is never equal to 0. Furthermore we prove an explicit lower bound on μ(B, A) in terms of |B| and the cardinality of the group generated by B, which is valid unless A and B have a special form explicitly described. In the case A = B, our bound holds unless B is a translate of a progression.

We consider the following process for generating large random cubic graphs. Starting with a given graph, repeatedly add edges that join the midpoints of two randomly chosen edges. We show that the growing graph asymptotically almost surely has logarithmic diameter. This process is motivated by a particular type of peer-to-peer network. Our method extends to similar processes that generate regular graphs of higher degree.

An r-cut of the complete r-uniform hypergraph Krn is obtained by partitioning its vertex set into r parts and taking all edges that meet every part in exactly one vertex. In other words it is the edge set of a spanning complete r-partite subhypergraph of Krn. An r-cut cover is a collection of r-cuts such that each edge of Krn is in at least one of the cuts. While in the graph case r = 2 any 2-cut cover on average covers each edge at least 2-o(1) times, when r is odd we exhibit an r-cut cover in which each edge is covered exactly once. When r is even no such decomposition can exist, but we can bound the average number of times an edge is cut in an r-cut cover between and . The upper bound construction can be reformulated in terms of a natural polyhedral problem or as a probability problem, and we solve the latter asymptotically.

An old result by Shearer relates the Lovász local lemma with the independent set polynomial on graphs, and consequently, as observed by Scott and Sokal, with the partition function of the hard-core lattice gas on graphs. We use this connection and a recent result on the analyticity of the logarithm of the partition function of the abstract polymer gas to get an improved version of the Lovász local lemma. As an application we obtain tighter bounds on conditions for the existence of Latin transversal matrices.

Let k ≥ 1 be an integer, and let H be a graph with no isolated vertices embedded in the projective plane, such that every homotopically non-trivial closed curve intersects H at least k times, and the deletion and contraction of any edge in this embedding results in an embedding that no longer has this property. Let G be the planar double cover of H obtained by lifting G into the universal covering space of the projective plane, the sphere. We prove that G is minor-minimal of branch-width 2k. We also exhibit examples of minor-minimal planar graphs of branch-width 6 that do not arise in this way.

The study of the structural properties of large random planar graphs has become in recent years a field of intense research in computer science and discrete mathematics. Nowadays, a random planar graph is an important and challenging model for evaluating methods that are developed to study properties of random graphs from classes with structural side constraints.

In this paper we focus on the structure of random 2-connected planar graphs regarding the sizes of their 3-connected building blocks, which we call cores. In fact, we prove a general theorem regarding random biconnected graphs from various classes. If Bn is a graph drawn uniformly at random from a suitable class of labelled biconnected graphs, then we show that with probability 1 − o(1) as n → ∞, Bn belongs to exactly one of the following categories:

1. (i) either there is a unique giant core in Bn, that is, there is a 0 < c = c() < 1 such that the largest core contains ~ cn vertices, and every other core contains at most nα vertices, where 0 < α = α() < 1;

2. (ii) or all cores of Bn contain O(logn) vertices.

We obtain a first non-trivial estimate for the sum of dilates problem in the case of groups of prime order, by showing that if t is an integer different from 0, 1 or −1 and if ⊂ ℤ/pℤ is not too large (with respect to p), then | + t ⋅ | is significantly larger than 2|| (unless |t| = 3). In the important case |t| = 2, we obtain for instance | + t ⋅ | ≥ 2.08 ||−2.

We prove that the maximum degree Δn of a random series-parallel graph with n vertices satisfies Δn/logn → c in probability, and Δn ~ c logn for a computable constant c > 0. The same kind of result holds for 2-connected series-parallel graphs, for outerplanar graphs, and for 2-connected outerplanar graphs.

Let A be a finite non-empty set of integers. An asymptotic estimate of the size of the sum of several dilates was obtained by Bukh. The unique known exact bound concerns the sum |A + k⋅A|, where k is a prime and |A| is large. In its full generality, this bound is due to Cilleruelo, Serra and the first author.

Let k be an odd prime and assume that |A| > 8kk. A corollary to our main result states that |2⋅A + k⋅A|≥(k+2)|A|−k2−k+2. Notice that |2⋅P+k⋅P|=(k+2)|P|−2k, if P is an arithmetic progression.

In this paper we consider the influences of variables on Boolean functions in general product spaces. Unlike the case of functions on the discrete cube, where there is a clear definition of influence, in the general case several definitions have been presented in different papers. We propose a family of definitions for the influence that contains all the known definitions, as well as other natural definitions, as special cases. We show that the proofs of the BKKKL theorem and of other results can be adapted to our new definition. The adaptation leads to generalizations of these theorems, which are tight in terms of the definition of influence used in the assertion.

Let be a set of terms over an arbitrary (but finite) number of Boolean variables. Let U() be the set of truth assignments that satisfy exactly one term in . Motivated by questions in computational complexity, Rudich conjectured that there exist ∊, δ > 0 such that, if is any set of terms for which U() contains at least a (1−∊)-fraction of all truth assignments, then there exists a term t ∈ such that at least a δ-fraction of assignments satisfy some term of sharing a variable with t [8].

We prove a stronger version: for any independent assignment of the variables (not necessarily the uniform one), if the measure of U() is at least 1 − ∊, there exists a t ∈ such that the measure of the set of assignments satisfying either t or some term incompatible with t (i.e., having no satisfying assignments in common with t) is at least . (A key part of the proof is a correlation-like inequality on events in a finite product probability space that is in some sense dual to Reimer's inequality [11], a.k.a. the BKR inequality [5], or the van den Berg–Kesten conjecture [3].)

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set S of s points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in three dimensions. We offer conjectures involving the new set-up, but are still unable to fully resolve them.

Instead, we adapt the recent new algebraic analysis technique of Guth and Katz [9], as further developed by Elekes, Kaplan and Sharir [6], to obtain sharp bounds on the number of incidences between these helices or parabolas and points in ℝ3. Applying these bounds, we obtain, among several other results, the upper bound O(s3) on the number of rotations (rigid motions) which map (at least) three points of S to three other points of S. In fact, we show that the number of such rotations which map at least k ≥ 3 points of S to k other points of S is close to O(s3/k12/7).

One of our unresolved conjectures is that this number is O(s3/k2), for k ≥ 2. If true, it would imply the lower bound Ω(s/logs) on the number of distinct distances in the plane.

Let d = (d1, d2, . . ., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.

Although there are many results of this kind, they are restricted to the sparse case with only a few exceptions. Our focus is instead on the case where the average degree is approximately a constant fraction of n.

Our approach is the multidimensional saddle-point method. This extends the enumerative work of McKay and Wormald (1990) and is analogous to the theory developed for bipartite graphs by Greenhill and McKay (2009).

Let Δ ≥ 3 be an integer. Given a fixed z ∈ +Δ such that zΔ > 0, we consider a graph Gz drawn uniformly at random from the collection of graphs with zin vertices of degree i for i = 1,. . .,Δ. We study the performance of the Karp–Sipser algorithm when applied to Gz. If there is an index δ > 1 such that z1 = . . . = zδ−1 = 0 and δzδ,. . .,ΔzΔ is a log-concave sequence of positive reals, then with high probability the Karp–Sipser algorithm succeeds in finding a matching with n ∥ z ∥ 1/2 − o(n1−ε) edges in Gz, where ε = ε (Δ, z) is a constant.

In this work we give a study of generalizations of Stirling permutations, a restricted class of permutations of multisets introduced by Gessel and Stanley [15]. First we give several bijections between such generalized Stirling permutations and various families of increasing trees extending the known correspondences of [20, 21]. Then we consider several permutation statistics of interest for generalized Stirling permutations as the number of left-to-right minima, the number of left-to-right maxima, the number of blocks of specified sizes, the distance between occurrences of elements, and the number of inversions. For all these quantities we give a distributional study, where the established connections to increasing trees turn out to be very useful. To obtain the exact and limiting distribution results we use several techniques ranging from generating functions, connections to urn models, martingales and Stein's method.

We introduce a polynomial invariant of graphs on surfaces, PG, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for PG, analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statistical mechanics, where the Tutte polynomial is known as the partition function of the Potts model. For ribbon graphs, PG specializes to the well-known Bollobás–Riordan polynomial, and in fact the two polynomials carry equivalent information in this context. Duality is also established for a multivariate version of the polynomial PG. We then consider a 2-variable version of the Jones polynomial for links in thickened surfaces, taking into account homological information on the surface. An analogue of Thistlethwaite's theorem is established for these generalized Jones and Tutte polynomials for virtual links.

In this paper we study planar first-passage percolation (FPP) models on random Delaunay triangulations. In [14], Vahidi-Asl and Wierman showed, using sub-additivity theory, that the rescaled first-passage time converges to a finite and non-negative constant μ. We show a sufficient condition to ensure that μ>0 and derive some upper bounds for fluctuations. Our proofs are based on percolation ideas and on the method of martingales with bounded increments.

We present a simple graph integral equivalent to a multiple of the circuit partition polynomial. Let G be a directed graph, and let k be a positive integer. Associate with each vertex v of G an independent, uniformly random k-dimensional complex vector xv of unit length. We define q(G;k) to be the expected value of the product, over all edges (u, v), of the inner product 〈xu, xv〉. We show that q(G;k) is proportional to G's cycle partition polynomial, and therefore that computing q(G;k) is #P-complete for any k > 1. We also study the natural variants that arise when the xv are real or drawn from the Gaussian distribution.

We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar. Examples show that the condition of G being simple cannot be omitted.