Related papers: Analytical results on the polymerisation random gr…
In this work, Flory-Huggins phase diagrams for correlated random copolymers with realistic chain lengths are calculated. This is achieved in two steps. At first we derive a distribution function of copolymer chains with respect to…
We study structural phase transition of polymer-grafted colloidal particles by Monte Carlo simulations on hard spherical particles. The interaction potential, which has a weak repulsive step outside the hard core, was validated with use of…
Large scale Monte Carlo simulations of dense layers of grafted polymer chains in good solvent conditions are used to explore the relaxation of a polymer brush. Monomer displacements are analyzed for the directions parallel and perpendicular…
In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $\alpha$ and…
We study analytically and by means of an off-lattice bead-spring dynamic Monte Carlo simulation model the adsorption kinetics of a single macromolecule on a structureless flat substrate in the regime of strong physisorption. The underlying…
For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…
We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…
Dimerization and subsequent aggregation of polymers and biopolymers often occur under nonequilibrium conditions. When the initial state of the polymer is not collapsed or the final folded native state, the dynamics of dimerization can…
A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence.…
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 consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
Classical Molecular Dynamics (MD) simulations provide insight on the properties of many soft-matter systems. In some situations it is interesting to model the creation of chemical bonds, a process that is not part of the MD framework. In…
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results…
Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…
We study an ensemble of branched polymers which are embedded on other branched polymers. This is a toy model which allows us to study explicitly the reaction of a statistical system on an underlying geometrical structure, a problem of…
Probability models on graphs are becoming increasingly important in many applications, but statistical tools for fitting such models are not yet well developed. Here we propose a general method of moments approach that can be used to fit a…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We study a simple solvable model describing the genesis of monomer sequences for hetero-polymers (such as proteins), as the result of the equilibration of a slow stochastic genetic selection process which is assumed to be driven by the…
We provide an introductory account of a tricritical phase diagram, in the setting of a mean-field random walk model of a polymer density transition, and clarify the nature of the density transition in this context. We consider a…
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet…