Related papers: Analytical results on the polymerisation random gr…
Widely used closed product-form networks have emerged recently as a primary model of stochastic growth of sub-cellular structures, e.g., cellular filaments. In the baseline model, homogeneous monomers attach and detach stochastically to…
In a recent letter, a simple method was proposed to generate solvable models that predict the critical properties of statistical systems in hyperspherical geometries. To that end, it was shown how to reduce a random walk in $D$ dimensions…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
We consider the random directed graph $\vec{G}(n,p)$ with vertex set $\{1,2,\ldots,n\}$ in which each of the $n(n-1)$ possible directed edges is present independently with probability $p$. We are interested in the strongly connected…
We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…
The phase diagram of soft spheres with size dispersion has been studied by means of an optimized Monte Carlo algorithm which allows to equilibrate below the kinetic glass transition for all sizes distribution. The system ubiquitously…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
In this paper we study the mixing time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs generated by the unit intensity Poisson Point Process in a $d$-dimensional cube of volume $n$.…
By means of multicanonical computer simulations, we investigate thermodynamic properties of the aggregation of interacting semiflexible polymers. We analyze a mesoscopic bead-stick model, where nonbonded monomers interact via Lennard-Jones…
Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…
This paper focuses on the problem of growing multiplex networks. Currently, the results on the joint degree distribution of growing multiplex networks present in the literature pertain to the case of two layers, and are confined to the…
Polymer-grafted nanoparticles (PGNPs) can provide property profiles than cannot be obtained individually by polymers or nanoparticles (NPs). Here, we have studied the mixing--demixing transition of symmetric copolymer melts of…
Synthetic polymers are versatile and widely used materials. Similar to small organic molecules, a large chemical space of such materials is hypothetically accessible. Computational property prediction and virtual screening can accelerate…
The conformational behavior of a coarse-grained finite polymer chain near an attractive spherical surface was investigated by means of multicanonical Monte Carlo computer simulations. In a detailed analysis of canonical equilibrium data…
We consider a system of clusters made of elementary building blocks, monomers, and evolving via collisions between diffusing monomers and immobile composite clusters. In our model, the cluster-monomer collision can lead to the attachment of…
Long DNA molecules can be mapped by cutting them with restriction enzymes inside a narrow channel. Once cut, the individual fragments thus produced move away from each other due to diffusion and entropic effects. We investigate how long it…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detect deviations from randomness in network properties. Here we…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
We study a blend of two kinds of homopolymers with tendency for segragation. Cross-links between the chains of different kinds do not allow macrophase separation. Instead microphase structure appears. Starting from a microscopic model we…