arXiv subjects
Publications and source records attributed to Amites Sarkar.
In this note we determine the maximum number of arcs in a digraph on $n$ vertices that does not contain a length-$k$ directed path $\overrightarrow{P}_{k+1}$ for $n \geq 50k^6$. This improves a theorem of Zhou and Li [$\textit{Graphs Combin.}$ 39(3), 2023] who proved the result with a superexponential threshold on $n$.
In this note, we present a novel connection between a multi-type (vector) multiplicative coalescent process and a multi-type branching process with Poisson offspring distributions. More specifically, we show that the equations that govern the phenomenon of gelation in the vector multiplicative coalescent process are equivalent to the equations that yield the extinction probabilities of the corresponding multi-type Poisson branching process. We then leverage this connection with two applications, one in each direction. The first is a new quick proof of gelation in the vector multiplicative coalescent process, and the second is a new series expression for the extinction probabilities of the multi-type Poisson branching process. We also use random graphs to give a new derivation of the solution to the modified Smoluchowski coagulation equations, which describe the vector multiplicative coalescent process.
Given a set of integers $A$ and an integer $k$, write $A+k\cdot A$ for the set $\{a+kb:a\in A,b\in A\}$. Hanson and Petridis showed that if $|A+A|\le K|A|$ then $|A+2\cdot A|\le K^{2.95}|A|$. At a presentation of this result, Petridis stated that the highest known value for $\frac{\log(|A+2\cdot A|/|A|)}{\log(|A+A|/|A|)}$ (bounded above by 2.95) was $\frac{\log 4}{\log 3}$. We show that, for all $ε>0$, there exist $A$ and $K$ with $|A+A|\le K|A|$ but with $|A+2\cdot A|\ge K^{2-ε}|A|$. Further, we analyse a method of Ruzsa, and generalise it to give continuous analogues of the sizes of sumsets, differences and dilates. We apply this method to a construction of Hennecart, Robert and Yudin to prove that, for all $ε>0$, there exists a set $A$ with $|A-A|\ge |A|^{2-ε}$ but with $|A+A|<|A|^{1.7354+ε}$. The second author would like to thank E. Papavassilopoulos for useful discussions about how to improve the efficiency of his computer searches.
We provide a geometric interpretation of Brillhart's celebrated algorithm for expressing a prime $p\equiv 1\pmod 4$ as the sum of two squares.
Following Bradonjić and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a vertex is $a\log n$ for some fixed $a>1$. Each vertex is added with probability $p$ to a set $A_0$ of initially infected vertices. Vertices subsequently become infected if they have at least $ θa \log n $ infected neighbours. Here $p, θ\in [0,1]$ are taken to be fixed constants. We show that if $θ< (1+p)/2$, then a sufficiently large local outbreak leads with high probability to the infection spreading globally, with all but $o(n)$ vertices eventually becoming infected. On the other hand, for $ θ> (1+p)/2$, even if one adversarially infects every vertex inside a ball of radius $O(\sqrt{\log n} )$, with high probability the infection will spread to only $o(n)$ vertices beyond those that were initially infected. In addition we give some bounds on the $(a, p, θ)$ regions ensuring the emergence of large local outbreaks or the existence of islands of vertices that never become infected. We also give a complete picture of the (surprisingly complex) behaviour of the analogous $1$-dimensional bootstrap percolation model on the circle. Finally we raise a number of problems, and in particular make a conjecture on an `almost no percolation or almost full percolation' dichotomy which may be of independent interest.
We consider a variant of a classical coverage process, the boolean model in $\mathbb{R}^d$. Previous efforts have focused on convergence of the unoccupied region containing the origin to a well studied limit $C$. We study the intersection of sets centered at points of a Poisson point process confined to the unit ball. Using a coupling between the intersection model and the original boolean model, we show that the scaled intersection converges weakly to the same limit $C$. Along the way, we present some tools for studying statistics of a class of intersection models.
We disprove a conjecture of Nagy on the maximum number of copies N(G,H) of a fixed graph G in a large graph H with prescribed edge density. Nagy conjectured that for all G, the quantity N(G,H) is asymptotically maximised by either a quasi-star or a quasi-clique. We show this is false for infinitely many graphs, the smallest of which has 6 vertices and 6 edges. We also propose some new conjectures for the behaviour of N(G,H), and present some evidence for them.
For a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a {\emph rainbow copy} of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum, denoted by $ex^*(n,F)$, is the {\emph rainbow Turán number} of $F$, and its systematic study was initiated by Keevash, Mubayi, Sudakov and Verstraëte in 2007. We determine $ex^*(n,F)$ exactly when $F$ is a forest of stars, and give bounds on $ex^*(n,F)$ when $F$ is a path with $k$ edges, disproving a conjecture in Keevash et al.
Consider a wireless cellular network consisting of small, densely scattered base stations. A user $u$ is {\em uniquely covered} by a base station $b$ if $u$ is the only user within distance $r$ of $b$. This makes it possible to assign the user $u$ to the base station $b$ without interference from any other user $u'$. We investigate the maximum possible proportion of users who are uniquely covered. We solve this problem completely in one dimension and provide bounds, approximations and simulation results for the two-dimensional case.
The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence of eavesdroppers, which, in the model, is determined solely by the locations of the nodes and eavesdroppers. In the case of infinite networks, a critical parameter is the maximum density of eavesdroppers that can be accommodated while still guaranteeing an infinite component in the network, i.e., the percolation threshold. We focus on the case where the locations of the nodes and eavesdroppers are given by Poisson point processes, and present bounds for different types of percolation, including in-, out- and undirected percolation.
Let P be a Poisson process of intensity one in a square S_n of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geometric graph G_{n,k}. We prove that there exists a critical constant c such that for c' c G_{n,c'\log n} is connected with probability tending to 1 as n tends to infinity. This answers a question previously posed by the authors.