Related papers: Analytical results on the polymerisation random gr…
The structural phase behavior of polymer brushes, single-component linear homopolymers grafted onto a planar substrate, is studied using the molecular Monte Carlo method in 3 dimensions. When simulation parameters of the system are set in…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
We investigate the phase behaviour of random copolymers melts via large scale Monte Carlo simulations. We observe macrophase separation into A and B--rich phases as predicted by mean field theory only for systems with a very large…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…
Electropolymerization is a bottom-up materials engineering process of micro and nano-scale that utilizes electrical signals to deposit conducting dendrites' morphologies by a redox reaction in the liquid phase. It resembles synaptogenesis…
We construct a random surface model with a string susceptibility exponent one quarter by taking an Ising model on a random surface and introducing an additional degree of freedom which amounts to allowing certain outgrowths on the surfaces.…
Formation of a molecular network from multifunctional precursors is modelled with a random graph process. The random graph model favours reactivity for monomers that are positioned close in the network topology, and disfavours reactivity…
By means of Metropolis Monte Carlo simulations of a coarse-grained model for flexible polymers, we investigate how the integrated autocorrelation times of different energetic and structural quantities depend on the temperature. We show…
The results in this paper provide new information on asymptotic properties of classical models: the neutral Kingman coalescent under a general finite-alleles, parent-dependent mutation mechanism, and its generalisation, the ancestral…
Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
Computation of the probability that a random graph is connected is a challenging problem, so it is natural to turn to approximations such as Monte Carlo methods. We describe sequential importance resampling and splitting algorithms for the…
We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we…
Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…
It is commonly accepted that in concentrated solutions or melts high-molecular weight polymers display random-walk conformational properties without long-range correlations between subsequent bonds. This absence of memory means, for…
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree…
Using exact enumeration methods and Monte Carlo simulations we study the phase diagram relative to the conformational transitions of a two dimensional diblock copolymer. The polymer is made of two homogeneous strands of monomers of…
We analyze a dynamic random undirected graph in which newly added vertices are connected to those already present in the graph either using, with probability $p$, an anti-preferential attachment mechanism or, with probability $1-p$, a…