Related papers: Stable and Fr\'echet limit theorem for subgraph fu…
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erd\H{o}s-R\'enyi random graphs, inhomogeneous random graphs (also called Chung-Lu graphs), and geometric…
We study the stability of the mesoscopic fluctuations of certain orthogonal polynomial ensembles on the real line utilizing the recurrence relation of the associated orthogonal polynomials. We prove that under a sparse enough decaying…
We study fractal properties of invariant graphs of hyperbolic and partially hyperbolic skew product diffeomorphisms in dimension three. We describe the critical (either Lipschitz or at all scales H\"older continuous) regularity of such…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…
Let $k,d $ be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a $d$-dimensional Poisson Boolean model with balls of fixed radius is of order $k$, as the…
Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "\emph{controlled diffusion}" steps needed to transport a constant mass $p$ outside of the ball of radius $n$. In a step of a controlled diffusion…
The intricate relations between elements in natural and human-made systems sustain the complex processes that shape our world, forming multiscale networks of interactions. These networks can be represented as graphs composed of nodes…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
For $s \ge 4$, the 3-uniform tight cycle $C^3_s$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive points. For fixed $s \ge 4$ and $s \not\equiv 0$ (mod 3) we…
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…
In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We study a class of corner growth models in which the weights are either all exponentially or all geometrically distributed. The parameter of the distribution at site $(i, j)$ is $a_i+b_j$ in the exponential case and $a_ib_j$ in the…
The two-star random graph is the simplest exponential random graph model with nontrivial interactions between the graph edges. We propose a set of auxiliary variables that control the thermodynamic limit where the number of vertices N tends…
In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
We introduce two new concepts, frictional rigidity percolation and minimal rigidity proliferation, to help identify the nature of the frictional jamming transition as well as significantly broaden the scope of rigidity percolation. For…
In this paper, we prove a combination theorem for a relatively acylindrical graph of relatively hyperbolic groups (Theorem 1.1). Here, we are extending the technique of [Tom21] and constructing Bowditch boundary of the fundamental group of…