Results 1 to 10 of about 3,049,614 (273)
Sequence of U-Shaped Convolutional Networks for Assessment of Degree of Delamination Around Scribe
International Journal of Computational Intelligence Systems, 2022 The application of protective layers is the primary method of keeping metallic structures resistant to degradation. The measurement of the layer resistance to delamination is one of the important indicators of the protection quality.
Veronika Rozsivalova +3 more
doaj +1 more source
A novel configuration model for random graphs with given degree sequence
, 2007 Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random network models in
Bekessy A +10 more
core +1 more source
Parameterized binding numbers and degree sequence theorems [PDF]
Discrete Mathematics Letters, 2023 Michael Yatauro
doaj +1 more source
Towards random uniform sampling of bipartite graphs with given degree sequence [PDF]
, 2012 In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\em semi-regular} degree sequence.
Erdös, Péter L. +2 more
core +1 more source
The component sizes of a critical random graph with given degree sequence
, 2014 Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second moment of ...
Joseph, Adrien
core +1 more source
Weighted hypersoft configuration model
Physical Review Research, 2020 Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models.
Ivan Voitalov +4 more
doaj +1 more source
Finding Fullerene Patches in Polynomial Time
, 2009 We consider the following question, motivated by the enumeration of fullerenes. A fullerene patch is a 2-connected plane graph G in which inner faces have length 5 or 6, non-boundary vertices have degree 3, and boundary vertices have degree 2 or 3.
Bonsma, Paul, Breuer, Felix
core +1 more source
Percolation on sparse random graphs with given degree sequence
, 2007 We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards we focus on ...
Fountoulakis, Nikolaos
core +2 more sources
Different forms of metric characterizations of classes of Banach spaces [PDF]
, 2011 For each sequence X of finite-dimensional Banach spaces there exists a sequence H of finite connected nweighted graphs with maximum degree 3 such that the following conditions on a Banach space Y are equivalent: (1) Y admits uniformly isomorphic ...
Ostrovskii, Mikhail I.
core
Geometric randomization of real networks with prescribed degree sequence
New Journal of Physics, 2019 We introduce a model for the randomization of complex networks with geometric structure. The geometric randomization (GR) model assumes a homogeneous distribution of the nodes in a hidden similarity space and uses rewirings of the links to find ...
Michele Starnini +2 more
doaj +1 more source