Related papers: Noncrossing partition flow and random matrix model…
Previous literature on random matrix and network science has traditionally employed measures derived from nearest-neighbor level spacing distributions to characterize the eigenvalue statistics of random matrices. This approach, however,…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erd\"os-R\'enyi networks, the exponential and the scale-free growing networks. We show that the character of the degree…
A characterization of the existence of non-central Wishart distributions (with shape and non-centrality parameter) as well as the existence of solutions to Wishart stochastic differential equations (with initial data and drift parameter) in…
Normalizing flows are a class of generative models that enable exact likelihood evaluation. While these models have already found various applications in particle physics, normalizing flows are not flexible enough to model many of the…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite…
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…
In this paper the distribution of charged particles is constructed under the approximation of ambipolar diffusion. The results of mathematical modelling in two-dimensional case taking into account the velocities of the system are presented.
We prove that for each $k\ge0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, so that the expected number of vertices of degree $k$ is asymptotically $d_k n$, and moreover…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
Stochastic interacting particle systems are widely used to model collective phenomena across diverse fields, including statistical physics, biology, and social dynamics. The McKean-Vlasov equation arises as the mean-field limit of such…
Physical systems with complex unsteady dynamics, such as fluid flows, are often poorly represented by a single mean solution. For many practical applications, it is crucial to access the full distribution of possible states, from which…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
The dynamics of gradient and Hamiltonian flows with particular application to flows on adjoint orbits of a Lie group and the extension of this setting to flows on a loop group are discussed. Different types of gradient flows that arise from…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
This paper introduces a novel generative model for discrete distributions based on continuous normalizing flows on the submanifold of factorizing discrete measures. Integration of the flow gradually assigns categories and avoids issues of…
While the rheology of non-Brownian suspensions in the dilute regime is well-understood, their behavior in the dense limit remains mystifying. As the packing fraction of particles increases, particle motion becomes more collective, leading…
We study the spectral properties of the adjacency matrix in the giant connected component of Erd\"os-R\'enyi random graphs, with average connectivity $p$ and randomly distributed hopping amplitudes. By solving the self-consistent cavity…