Related papers: Phase transition in random contingency tables with…

We show that by restricting the degrees of the vertices of a graph to an arbitrary set \( \Delta \), the threshold point $ \alpha(\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \alpha(\Delta) n $ edges…

In this paper, we study the high-order phase transition in random $r$-uniform hypergraphs. For a positive integer $n$ and a real $p\in [0,1]$, let $H:=H^r(n,p)$ be the random $r$-uniform hypergraph with vertex set $[n]$, where each $r$-set…

We study probabilities of various rare events for the limiting point process that appears at the random matrix hard edge. We also show a transition from hard edge to bulk behavior. Asymptotic events studied include a central limit theorem…

We study random subgraphs of an arbitrary finite connected transitive graph $\mathbb G$ obtained by independently deleting edges with probability $1-p$. Let $V$ be the number of vertices in $\mathbb G$, and let $\Omega$ be their degree. We…

Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges…

Let $X$ be a random walk on the torus of side length $N$ in dimension $d\geq 3$ with uniform starting point, and $t_{\text{cov}}$ be the expected value of its cover time, which is the first time that $X$ has visited every vertex of the…

If a system undergoing phase transitions exhibits some characteristics of both first and second order, it is said to be of 'mixed order' or to display the Thouless effect. Such a transition is present in a simple model of a dynamic social…

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

We establish large deviation formulas for linear statistics on the $N$ transmission eigenvalues $\{T_i\}$ of a chaotic cavity, in the framework of Random Matrix Theory. Given any linear statistics of interest $A=\sum_{i=1}^N a(T_i)$, the…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…

The vertex-cover problem is studied for random graphs $G_{N,cN}$ having $N$ vertices and $cN$ edges. Exact numerical results are obtained by a branch-and-bound algorithm. It is found that a transition in the coverability at a $c$-dependent…

For parameters $n,\delta,B,C$, we obtained a sharp asymptotic formula for the number of $(n+\lfloor n^\delta\rfloor)^2$-dimensional binary contingency tables with non-uniform margins taking values of $\lfloor BCn\rfloor$ and $\lfloor…

We have constructed a general theory describing the topological quantum phase transitions in 3D systems with broken inversion symmetry. While the consideration of the system's codimension generally predicts the appearance of a stable…

We study the full distribution $P_{N}\left(A\right)$ of sums $A = \sum_{i=1}^N$ where $x_1, \dots, x_N$ are $N \gg 1$ independent and identically distributed random variables each sampled from a given distribution $p(x)$ with a…

We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. Such a problem relates to recent developments in copula modeling for discrete random vectors.…

We consider the random directed graph $\vec{G}(n,p)$ with vertex set $\{1,2,\ldots,n\}$ in which each of the $n(n-1)$ possible directed edges is present independently with probability $p$. We are interested in the strongly connected…

Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…

The organization of high-dimensional probability spaces is a fundamental problem at the intersection of statistical physics and information theory. Here, we analyze the distributions populating level surfaces of the probability simplex…

We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced $\textit{probabilistic divide-and-conquer}$ technique. A simple exact sampling algorithm is presented for…