Related papers: Noncrossing partition flow and random matrix model…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
We compute an asymptotic expansion in $1/c$ of the limit in $n$ of the empirical spectral measure of the adjacency matrix of an Erd\H{o}s-R\'enyi random graph with $n$ vertices and parameter $c/n$. We present two different methods, one of…
We investigate the level density for several ensembles of positive random matrices of a Wishart--like structure, $W=XX^{\dagger}$, where $X$ stands for a nonhermitian random matrix. In particular, making use of the Cauchy transform, we…
The asymptotic behaviour of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of…
We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…
The Origin-Destination~(OD) networks provide an estimation of the flow of people from every region to others in the city, which is an important research topic in transportation, urban simulation, etc. Given structural regional urban…
Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of…
We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…
Let S and T be vectors of positive integers with the same sum. We study the uniform distribution on the space of simple bipartite graphs with degree sequence S in one part and T in the other; equivalently, binary matrices with row sums S…
We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary…
We demonstrate a mechanism for the production of massive excitations in graphs. We treat the number of neighbors at each vertex in the graph (degree) as a scalar field. Then we introduce a mechanism inspired by the Higgs mechanism in…
An analytic, asymptotic approximation of the nonlinear steady-state equations for viscoelastic creeping flow, modeled by the Oldroyd-B equations with polymer stress diffusion, is derived. Near the extensional stagnation point the flow…
We study the spectrum of a random matrix, whose elements depend on the Euclidean distance between points randomly distributed in space. This problem is widely studied in the context of the Instantaneous Normal Modes of fluids and is…
We consider a binary branching process structured by a stochastic trait that evolves according to a diffusion process that triggers the branching events, in the spirit of Kimmel's model of cell division with parasite infection. Based on the…
We analyze the correlation between randomly chosen edge weights on neighboring edges in a directed graph. This shared-endpoint correlation controls the expected organization of randomly drawn edge flows when the flow on each edge is…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
We study the degree distribution of a randomly chosen vertex in a duplication--divergence graph, under a variety of different generalizations of the basic model of Bhan, Galas and Dewey (2002) and V\'azquez, Flammini, Maritan and Vespignani…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…