Related papers: On the phase transition curve in a directed expone…
Using a renormalization approach, we study the asymptotic limit distribution of the maximum value in a set of independent and identically distributed random variables raised to a power q(n) that varies monotonically with the sample size n.…
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…
We study continuity, and lack thereof, of thermodynamical properties for one-dimensional dynamical systems. Under quite general hypotheses, the free energy is shown to be almost upper-semicontinuous: some normalised component of a limit…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
We study an ideal-gas-like model where the particles exchange energy stochastically, through energy conserving scattering processes, which take place if and only if at least one of the two particles has energy below a certain energy…
We derive the phase diagram of the one-dimensional three-state Potts model with an additional mean-field interaction in the canonical ensemble. The free energy is obtained by mapping the model onto the spin-$1$ Blume-Emery-Griffiths model…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
Based on a non-rigorous formalism called the "cavity method", physicists have put forward intriguing predictions on phase transitions in discrete structures. One of the most remarkable ones is that in problems such as random $k$-SAT or…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, mutuality, and friend-of-a-friend triad closure, through…
Diluted mean-field models are graphical models in which the geometry of interactions is determined by a sparse random graph or hypergraph. Based on a nonrigorous but analytic approach called the "cavity method", physicists have predicted…
It was shown that in the canonical ensemble the simple exactly soluble statistical model of nuclei decay into nucleons, which is a limiting case of the statistical multifragmentation model, predicts the nuclear first order phase transition…
We examine Ising models with heat-bath dynamics on directed networks. Our simulations show that Ising models on directed triangular and simple cubic lattices undergo a phase transition that most likely belongs to the Ising universality…
We consider the edge-triangle model (or Strauss model), and focus on the asymptotic behavior of the triangle density when the size of the graph increases to infinity. This random graph belongs to the class of exponential random graphs,…
We analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase…
This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and…
The well known scaling laws relating critical exponents in a second order phase transition have been generalized to the case of an arbitrarily higher order phase transition. In a higher order transition, such as one suggested for the…
Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The path energy of a simple graph $M$ is equal to the sum of the absolute values of the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have discovered new…
The expected value for the weighted crossing number of a randomly weighted graph is studied. A variation of the Crossing Lemma for expectations is proved. We focus on the case where the edge-weights are independent random variables that are…
We consider random walks evolving on two models of connected and undirected graphs and study the exact large deviations of a local dynamical observable. We prove, in the thermodynamic limit, that this observable undergoes a first-order…