相关论文: The distribution of sandpile groups of random regu…

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…

The Bateman--Horn Conjecture predicts how often an irreducible polynomial $f(x) \in \mathbb{Z}[x]$ assumes prime values. We demonstrate that with sufficient averaging in the coefficients of $f$ (viz. exponential in the size of the inputs),…

In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…

We study random matrices whose entries are obtained by applying consistent rank correlations, such as Hoeffding's $D$, pairwise to a high-dimensional random vector with mutually independent components. Prior work has shown that, in the…

Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approximating layout problems on random graphs Discrete Mathematics, 235, 2001, 245--253), we show that several well-known graph layout problems are approximable to within a…

We take the first steps to develop Conley-Zehnder Theory, as conjectured by Arnold, in the world of probability. As far as we know, this paper provides the first probabilistic theorems about the density of fixed points of symplectic twist…

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

We study the number of isolated vertices in a preferential attachment random graph introduced by Dereich and M\"orters in 2009. In this graph model vertices are added over time and newly arriving vertices connect to older ones with…

We generalize the Poisson limit theorem to binary functions of random objects whose law is invariant under the action of an amenable group. Examples include stationary random fields, exchangeable sequences, and exchangeable graphs. A…

In the random geometric graph model $\mathsf{Geo}_d(n,p)$, we identify each of our $n$ vertices with an independently and uniformly sampled vector from the $d$-dimensional unit sphere, and we connect pairs of vertices whose vectors are…

Given a random real quadratic field from $\{ \mathbb{Q}(\sqrt{p}\,) ~|~ p \text{ primes} \}$, the conjectural probability $\mathbb{P}(h=q)$ that it has class number $q$ is given for all positive odd integers $q$. Some related conjectures of…

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

In this article, we give a partial description of the sandpile group of the cone of the cartesian product of graphs in function of the sandpile group of the cone of their factors. Also, we introduce the concept of uniform homomorphism of…

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

Consider random Young diagrams with a fixed number n of boxes, where the probability distribution on diagrams is determined by the Plancherel measure. That is, the weight of a diagram is proportional to the squared dimension of the…

We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…

In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such simplification has not been thoroughly verified. In this study, we investigate how directedness…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

We consider the singular values of certain Young diagram shaped random matrices. For block-shaped random matrices, the empirical distribution of the squares of the singular eigenvalues converges almost surely to a distribution whose moments…