We consider some models of random graphs and directed graphs and investigate their behavior near thresholds for the appearance of certain types of connected components. Firstly, we look at the critical window for the appearance of a giant strongly connected component in binomial random digraphs. We provide bounds on the probability that the largest strongly connected component is very large or very small. Next, we study the configuration model for graphs and show new upper bounds on the size of the largest connected component in the subcritical and barely subcritical regimes. We also show that these bounds are tight in some instances. Finally we look at the configuration model for random digraphs. We investigate the barely sub-critical regi...
ABSTRACT. Over the last few years a wide array of random graph models have been pos-tulated to under...
Abstract In the past years, many properties of the largest connected components of critical percolat...
This thesis is devoted to the study of different random graphs, defined by local properties (suchas ...
We consider some models of random graphs and directed graphs and investigate their behavior near thr...
A strongly connected component of a directed graph G is a maximal subgraph H of G such that for each...
We study near-critical behavior in the configuration model. Let D n be the degree of a random vertex...
We prove a law of large numbers for the order and size of the largest strongly connected component i...
In this paper we study the threshold model of geometric inhomogeneous random graphs (GIRGs); a gener...
The version of record is available online at: http://dx.doi.org/10.1007/978-3-030-83823-2_109We stud...
Abstract. In a recent work of the authors and Kim, we derived a com-plete description of the largest...
In this thesis, we study a recently proposed model of random graphs that exhibit properties which ar...
Over the last few years a wide array of random graph models have been postulated to understand prope...
In the 1950s, random graphs appeared for the first time in a result of the prolific hungarian mathem...
We derive a simple formula characterizing the distribution of the size of the connected component of...
We derive a simple formula characterizing the distribution of the size of the connected component of...
ABSTRACT. Over the last few years a wide array of random graph models have been pos-tulated to under...
Abstract In the past years, many properties of the largest connected components of critical percolat...
This thesis is devoted to the study of different random graphs, defined by local properties (suchas ...
We consider some models of random graphs and directed graphs and investigate their behavior near thr...
A strongly connected component of a directed graph G is a maximal subgraph H of G such that for each...
We study near-critical behavior in the configuration model. Let D n be the degree of a random vertex...
We prove a law of large numbers for the order and size of the largest strongly connected component i...
In this paper we study the threshold model of geometric inhomogeneous random graphs (GIRGs); a gener...
The version of record is available online at: http://dx.doi.org/10.1007/978-3-030-83823-2_109We stud...
Abstract. In a recent work of the authors and Kim, we derived a com-plete description of the largest...
In this thesis, we study a recently proposed model of random graphs that exhibit properties which ar...
Over the last few years a wide array of random graph models have been postulated to understand prope...
In the 1950s, random graphs appeared for the first time in a result of the prolific hungarian mathem...
We derive a simple formula characterizing the distribution of the size of the connected component of...
We derive a simple formula characterizing the distribution of the size of the connected component of...
ABSTRACT. Over the last few years a wide array of random graph models have been pos-tulated to under...
Abstract In the past years, many properties of the largest connected components of critical percolat...
This thesis is devoted to the study of different random graphs, defined by local properties (suchas ...