相关论文: Radius of Gyration, Contraction Factors, and Subdi…

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…

We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…

We investigate experimentally the distribution of configurations of a ring with an elementary topological constraint, a ``figure-8'' twist. Using vibrated granular chains, which permit controlled preparation and direct observation of such a…

We determine the density expansion of the radius of gyration, of the hydrodynamic radius, and of the end-to-end distance for a monodisperse polymer solution in good-solvent conditions. We consider the scaling limit (large degree of…

We present a detailed account of a recently proposed phenomenological theory for noncatenated ring polymer melts (Phys. Rev. Lett. 106, 167802 (2011)). A basic assumption lies in the implementation of the noncatenation constraint via the…

We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…

We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\sigma$ distance measure ($1 \leq \sigma \leq \infty$). Our main result is an exact characterization of the probability that a particular labeled cycle…

A close relation between hitting times of the simple random walk on a graph, the Kirchhoff index, resistance-centrality, and related invariants of unicyclic graphs is displayed. Combining with the graph transformations and some other…

We study scale-invariant geometric quantities associated with embedded closed curves in Euclidean three-space, with an emphasis on their behavior under optimization within a fixed knot type. Given a Euclidean-invariant and scale-covariant…

We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

Given an undirected graph, the resistance distance between two nodes is the resistance one would measure between these two nodes in an electrical network if edges were resistors. Summing these distances over all pairs of nodes yields the…

Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…

The Gromov width of a uniruled projective K\"ahler manifold can be bounded from above by the symplectic area of its minimal curves. We apply this result to toric varieties and thus get in this case upper bounds expressed in toric…

We study conformations of the Gaussian polymer chains in d-dimensional space in the presence of an external field with the harmonic potential. We apply a path integral approach to derive an explicit expression for the probability…

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…

Ring polymers are prevalent in natural and engineered systems, including circular bacterial DNA, crown ethers for cation chelation, and mechanical nanoswitches. The morphology and dynamics of ring polymers are governed by the chemistry and…