Related papers: On the phase transition curve in a directed expone…
We present a large $q$ expansion of the 2d $q$-states Potts model free energies up to order 9 in $1/\sqrt{q}$. Its analysis leads us to an ansatz which, in the first-order region, incorporates properties inferred from the known critical…
We revisit the two-dimensional quantum Ising model by computing renormalization group flows close to its quantum critical point. The low but finite temperature regime in the vicinity of the quantum critical point is squashed between two…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights…
We study phase transitions in the Ising model on random graphs using graph limits. We show that the critical temperatures are determined by the eigenvalues of the kernel operator associated with the graph limit. Bifurcation diagrams for…
The poster presents an analytic formalism describing metric properties of undirected random graphs with arbitrary degree distributions and statistically uncorrelated (i.e. randomly connected) vertices. The formalism allows to calculate the…
We consider the van der Waals' free energy functional, with a scaling small parameter epsilon, in the plane domain given by the first quadrant, and inhomogeneous Dirichlet boundary conditions. The boundary data are chosen in such a way that…
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 study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…
In this paper we are concerned with the learnability of energies from data obtained by observing time evolutions of their critical points starting at random initial equilibria. As a byproduct of our theoretical framework we introduce the…
The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
We compute the expected normalized trace norm (matrix/graph energy) of random symmetric band circulant matrices and graphs in the limit of large sizes, and obtain explicit bounds on the rate of convergence to the limit, and on the…
The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…
In this article we investigate normalized adjacency eigenvalues (simply normalized eigenvalues) and normalized adjacency energy of connected threshold graphs. A threshold graph can always be represented as a unique binary string. Certain…
In this work, we provide a theoretical understanding of the framelet-based graph neural networks through the perspective of energy gradient flow. By viewing the framelet-based models as discretized gradient flows of some energy, we show it…
The Axelrod model has been widely studied since its proposal for social influence and cultural dissemination. In particular, the community of statistical physics focused on the presence of a phase transition as a function of its two main…
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
The local eigenvalue statistics of large random matrices near a hard edge transitioning into a soft edge are described by the Bessel process associated with a large parameter $\alpha$. For this point process, we obtain 1) exponential moment…
Within the conventional statistical physics framework, we study critical phenomena in a class of configuration network models with hidden variables controlling links between pairs of nodes. We find analytical expressions for the average…