Related papers: Stable Poisson Graphs in One Dimension
In this paper exponential stability of nonlinear fractional order stochastic system with Poisson jumps is studied in finite dimensional space. Existence and uniqueness of solution, stability and exponential stability results are established…
We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…
Assume that $n = 2k$ potential roommates each have an ordered preference of the $n-1$ others. A stable matching is a perfect matching of the $n$ roommates in which no two unmatched people prefer each other to their matched partners. In…
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…
Consider a random directed graph on $n$ vertices with independent identically distributed outdegrees with distribution $F$ having mean $\mu$, and destinations of arcs selected uniformly at random. We show that if $\mu >1$ then for large $n$…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
We study robust versions of properties of $(n,d,\lambda)$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…
We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical…
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…
Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a…
Let $\Xi$ be the set of points (we call the elements of $\Xi$ centers) of Poisson process in $\R^d$, $d\geq 2$, with unit intensity. Consider the allocation of $\R^d$ to $\Xi$ which is stable in the sense of Gale-Shapley marriage problem…
We study the absolute continuity with respect to the Lebesgue measure of the distribution of the nodal volume associated with a smooth, non-degenerated and stationary Gaussian field $(f(x), {x \in \mathbb R^d})$. Under mild conditions, we…
We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the…
We investigate ergodic-theoretical quantities and large deviation properties of one-dimensional intermittent maps, that have not only an indifferent fixed point but also a singular structure such that the uniform measure is invariant under…
We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…
A random variable X is strictly stable if a sum of independent copies of X has the same distribution as X up to scaling, and is stable (in the broad sense) if the sum has the same distribution as X up to both scaling and shifting. Steutel…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…