Related papers: On the phase transition curve in a directed expone…
The model of directed polymer in a random environment is a fundamental model of interaction between a simple random walk and ambient disorder. This interaction gives rise to complex phenomena and transitions from a central limit theory to…
This paper examines a model involving two dynamic Erd\H{o}s-R\'enyi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according to specified on- and off-time distributions. A key…
In this contribution, we summarize our recent studies of the phase structure of the Grosse-Wulkenhaar model and its connection to renormalizability. Its action contains a special term that couples the field to the curvature of the…
We study a zero-temperature phase transition in the random field Ising model on scale-free networks with the degree exponent $\gamma$. Using an analytic mean-field theory, we find that the spins are always in the ordered phase for…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
We consider directed polymers in 1+1 spatial dimension under action of an external repulsive potential along a line. Using the exact mapping onto imaginary time evolution of free fermions we find that for sufficiently strong potential the…
Exponential Random Graph Models (ERGM) behave peculiar in large networks with thousand(s) of actors (nodes). Standard models containing two-star or triangle counts as statistics are often unstable leading to completely full or empty…
The $k$-section width and the Max-Cut for the configuration model are shown to exhibit phase transitions according to the values of certain parameters of the asymptotic degree distribution. These transitions mirror those observed on…
The topological theory of phase transitions was proposed on the basis of different arguments, the most important of which are: a direct evidence of the relation between topology and phase transitions for some exactly solvable models; an…
We study a (1+1)-dimensional directed polymer in a random environment on the integer lattice with log-gamma distributed weights. Among directed polymers, this model is special in the same way as the last-passage percolation model with…
Dynamical processes on complex networks, ranging from biological, technological and social systems, show phase transitions between distinct global states of the system. Often, such transitions rely upon the interplay between the structure…
We concentrate on kinetic models for swarming with individuals interacting through self-propelling and friction forces, alignment and noise. We assume that the velocity of each individual relaxes to the mean velocity. In our present case,…
We investigate analytically and numerically the critical line in undirected random Boolean networks with arbitrary degree distributions, including scale-free topology of connections $P(k)\sim k^{-\gamma}$. We show that in infinite…
In a connected graph, Kemeny's constant gives the expected time of a random walk from an arbitrary vertex $x$ to reach a randomly-chosen vertex $y$. Because of this, Kemeny's constant can be interpreted as a measure of how well a graph is…
The p-star model or exponential random graph is among the oldest and best-known of network models. Here we give an analytic solution for the particular case of the 2-star model, which is one of the most fundamental of exponential random…
The transition from the ordered commensurate phase to the incommensurate gaussian phase of the antiferroelectric asymmetric six-vertex model is investigated by keeping the temperature constant below the roughening point and varying the…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We study the Anderson transition on a generic model of random graphs with a tunable branching parameter $1<K\le 2$, through large scale numerical simulations and finite-size scaling analysis. We find that a single transition separates a…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…
In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such simplification has not been thoroughly verified. In this study, we investigate how directedness…