text large_stringlengths 7 3.02k |
|---|
We show that there is a polynomial-time algorithm with approximation guarantee $\frac{3}{2}+\epsilon$ for the $s$-$t$-path TSP, for any fixed $\epsilon>0$. It is well known that Wolsey's analysis of Christofides' algorithm also works for the $s$-$t$-path TSP with its natural LP relaxation except for the nar... |
We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. |
This paper studies the mathematical properties of collectively canalizing Boolean functions, a class of functions that has arisen from applications in systems biology. Boolean networks are an increasingly popular modeling framework for regulatory networks, and the class of functions studied here captures a key feature... |
We study the {\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straight-line-segment intersection graphs, but solvable in polynomial time in intersection graphs of homothetic triangles. |
In a finite undirected graph $G=(V,E)$, a vertex $v \in V$ {\em dominates} itself and its neighbors in $G$. A vertex set $D \subseteq V$ is an {\em efficient dominating set} ({\em e.d.} for short) of $G$ if every $v \in V$ is dominated in $G$ by exactly one vertex of $D$. |
We study the m-Eternal Domination problem, which is the following two-player game between a defender and an attacker on a graph: initially, the defender positions k guards on vertices of the graph; the game then proceeds in turns between the defender and the attacker, with the attacker selecting a vertex and the defend... |
The following optimization problem was introduced in \cite{gutinDAM}, where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs $D,H$ and a positive cost $c_i(u)$ for each $u\in V(D)$ and $i\in V(H)$. |
An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2.. .,t such that at least one edge of G is colored by color i,i=1,2.. |
A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear ``local constraint'' codes to be associated with the edges and vertices, respectively, of the graph. The $\k$-complexity of a gra... |
To asses the advantages of a computerized surveillance system to detect Healthcare-Associated Infections (HAI). All HAI reported to the Timis County branch of the Romanian National Health Insurance and the Public Health Authority during the year 2007 were collected and assessed for validity |
Seymour's second neighbourhood conjecture asserts that every oriented graph has a vertex whose second out-neighbourhood is at least as large as its out-neighbourhood. In this paper, we prove that the conjecture holds for quasi-transitive oriented graphs, which is a superclass of tournaments and transitive acyclic ... |
A graph $G$ is Hamiltonian-connected if there exists a Hamiltonian path between any two vertices of $G$. It is known that if $G$ is 2-connected then the graph $G^2$ is Hamiltonian-connected. |
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has a vertex-partition and a layering, such that each part has a bounded number of ... |
Let $G$ be a simple graph with adjacency matrix $A(G)$, signless Laplacian matrix $Q(G)$, degree diagonal matrix $D(G)$ and let $l(G)$ be the line graph of $G$. In 2017, Nikiforov defined the $A_\alpha$-matrix of $G$, $A_\alpha(G)$, as a linear convex combination of $A(G)$ and $D(G)$, the following way, $A_\alpha(G):=... |
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more complex. |
Our daily social and political life is more and more impacted by social networks. The functioning of our living bodies is deeply dependent on biological regulation networks such as neural, genetic, and protein networks. |
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. |
This paper presents a hybrid approach called frequent pattern based search that combines data mining and optimization. The proposed method uses a data mining procedure to mine frequent patterns from a set of high-quality solutions collected from previous search, and the mined frequent patterns are then employed to bui... |
Let $G$ be a finite, simple, and undirected graph and let $S$ be a set of vertices of $G$. In the geodetic convexity, a set of vertices $S$ of a graph $G$ is convex if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$. |
Given a set $\Pi$ of permutation patterns of length at most $k$, we present an algorithm for building $S_{\le n}(\Pi)$, the set of permutations of length at most $n$ avoiding the patterns in $\Pi$, in time $O(|S_{\le n - 1}(\Pi)| \cdot k + |S_{n}(\Pi)|)$. Additionally, we present an $O(n!k)$-time algorithm for countin... |
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of arcs, each path within the MPC should contain at least one arc from this subset. |
Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. |
We study the binary Ehrenfeucht Mycielski sequence seeking a balance between the number of occurrences of different binary strings. There have been numerous attempts to prove the balance conjecture of the sequence, which roughly states that 1 and 0 occur equally often in it. |
We consider the mixed search game against an agile and visible fugitive. This is the variant of the classic fugitive search game on graphs where searchers may be placed to (or removed from) the vertices or slide along edges. |
Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they have a well-defined notion of translation. We propose a notion of graph associated to a language, which conserves ... |
We prove that throughout the satisfiable phase, the logarithm of the number of satisfying assignments of a random 2-SAT formula satisfies a central limit theorem. This implies that the log of the number of satisfying assignments exhibits fluctuations of order $\sqrt n$, with $n$ the number of variables. |
Minimum spanning trees and forests are powerful sparsification techniques that remove cycles from weighted graphs to minimize total edge weight while preserving node connectivity. They have applications in computer science, network science, and graph theory. |
A graph is $(k_1,k_2)$-colorable if its vertex set can be partitioned into a graph with maximum degree at most $k_1$ and and a graph with maximum degree at most $k_2$. We show that every $(C_3,C_4,C_6)$-free planar graph is $(0,6)$-colorable. |
In this paper, we study the generalized gapped k-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers $\ell$ and $k$, with $k\leq \ell$, and an $\ell$-tuple $B=(b_1,\ldots,b_{\ell})$ of integers $b_i\geq 2$, $i=1,\ldots,\ell$. |
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property of being isomorphic to a directed graph. |
This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. |
In the BFA 2023 conference paper, A. Polujan, L. Mariot and S. Picek exhibited the first example of a non-normal but weakly normal bent function in dimension 8. In this note, we present numerical approaches based on the classification of Boolean spaces to explore in detail the normality of bent functions of 8 variable... |
Let $m,n>1$ be integers and $\mathbb{P}_{n,m}$ be the point set of the projective $(n-1)$-space (defined by [2]) over the ring $\mathbb{Z}_m$of integers modulo $m$. Let $A_{n,m}=(a_{uv})$ be the matrix with rows and columns being labeled by elements of $\mathbb{P}_{n,m}$, where $a_{uv}=1$ if the inner product $<... |
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. |
Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width $k$ given with a $k$-expression, Dominating Set can be solved in $4^k n^{O(1)}$ time. |
In this paper, we develop a new method for the fast and memory-efficient computation of Slepian functions on the sphere. Slepian functions, which arise as the solution of the Slepian concentration problem on the sphere, have desirable properties for applications where measurements are only available within a spatially... |
Connectivity in temporal graphs relies on the notion of temporal paths, in which edges follow a chronological order (either strict or non-strict). In this work, we investigate the question of how to make a temporal graph connected. |
We developed a procedure of reducing the number of vertices and edges of a given tree, which we call the "tree simplification procedure," without changing its topological information. Our motivation for developing this procedure was to reduce computational costs of graph Laplacian eigenvalues of such trees. |
As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arborescences spanning the set of vertices reachable from each root. Fortier--Király--Léonard--Szigeti--Talon (2018) asked whether the result can b... |
In the first part of this work we provide a formula for the number of edges of the Hasse diagram of the independent subsets of the h-th power of a path ordered by inclusion. For h=1 such a value is the number of edges of a Fibonacci cube. |
A ride sharing problem is considered where we are given a graph, whose edges are equipped with a travel cost, plus a set of objects, each associated with a transportation request given by a pair of origin and destination nodes. A vehicle travels through the graph, carrying each object from its origin to its destinatio... |
Let $k\ge 2$ be an integer and $T_1,\ldots, T_k$ be spanning trees of a graph $G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$ in each $T_i$, $1\le i\le k$, do not contain common edges and common vertices, except the vertices $u$ and $v$, then $T_1,\ldots, T_k$ are completely independent s... |
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exact solutions provided by a Lagrangian decomposition of this formulation in which only one constraint is relaxed. |
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully subtractive algorithm. |
Given a finite set $N$ of feasible points of a multi-objective optimization (MOO) problem, the search region corresponds to the part of the objective space containing all the points that are not dominated by any point of $N$, i.e. the part of the objective space which may contain further nondominated points. In this p... |
For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a graph $G$, if adjacent edges are colored differently and each of $t$ colors is used. |
In this paper, we consider the lengths of cycles that can be embedded on the edges of the generalized pancake graphs which are the Cayley graph of the generalized symmetric group $S(m,n)$, generated by prefix reversals. The generalized symmetric group $S(m,n)$ is the wreath product of the cyclic group of order $m$ and... |
An infinite range spin glass like model for granular systems is introduced and studied through the replica mean field formalism. Equilibrium, density dependent properties under vibration and gravity are obtained. |
Upper and lower bounds for the typical storage capacity of a constructive algorithm, the Tilinglike Learning Algorithm for the Parity Machine [M. Biehl and M. Opper, Phys. |
A fermion model with random on-site potential defined on a two-dimensional square lattice with $\pi$-flux is studied. The continuum limit of the model near the zero energy yields Dirac fermions with random potentials specified by four independent coupling constants. |
The statistics of critical wave functions at the Anderson transition in three and four dimensions are studied numerically. The distribution of the inverse participation ratios (IPR) $P_q$ is shown to acquire a scale-invariant form in the limit of large system size. |
Cybersecurity is an issue of increasing concern since the events of September 11th. Many questions have been raised concerning the security of the Internet and the rest of the US's information infrastructure. |
We explore the potential of a static electric field to induce Anderson localization of light in a large three-dimensional (3D) cloud of randomly distributed, immobile atoms with a degenerate ground state (total angular momentum $J_g = 0$) and a three-fold degenerate excited state ($J_e = 1$). We study both the spatial... |
The role of disorder on wave propagation through the universe is studied. Assuming space fluctuations of the order of the Planck length and the size of the universe as the corresponding localization length for the background radiation, we obtain the exponent (close to unity) in the power law relationship between these... |
We compare vibrational dynamics in two structurally distinct, simple monatomic model glasses simulated by molecular dynamics: the Lennard-Jones glass with an fcc-related structure and a glass with predominantly icosahedral short-range order. The former, characterised by a single local quasi-periodicity, supports only ... |
Usually, the impact of structural disorder on the magnetic phase transition in the 3D Ising model is analyzed within the framework of quenched dilution by a non-magnetic component, where some lattice sites are occupied by Ising spins, while others are non-magnetic. This kind of quenched dilution, according to the Harr... |
We have studied the diluted Heisenberg spin glass model in a 3-component random field for the commonly-used one-dimensional long-range model where the probability that two spins separated by a distance $r$ interact with one another falls as $1/r^{2 \sigma}$, for two values of $\sigma$, $0.75$ and $0.85$. No de Almeida... |
The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means that with all known algorithms in the worst case instances are not solveable in polynomial time, i.e., the problem is hard. Though that do... |
We develop a mean-field theory for random quantum spin systems using the spin coherent state path integral representation. After the model is reduced to the mean field one-body Hamiltonian, the integral is analyzed with the aid of several methods such as the semiclassical method and the gauge transformation. |
The magnetic ordering due to the long range dipole coupling in an ensemble of magnetic islands is investigated. If the islands are large enough and closely separated, the average dipole energy per island can explain the magnitude of the observed ordering temperature of such an ensemble. |
A particular type of random dynamical processes is considered, in which the stochasticity is introduced through randomly fluctuating parameters. A method of local multipliers is developed for treating the local stability of such dynamical processes corresponding to infinite--dimensional dynamical systems. |
In the context of the random first order transition theory we use an extended mode coupling theory of the glass transition that includes activated events to account for spatiotemporal structures in aging and rejuvenating glasses. We numerically solve fluctuating dynamical equations for mobility and fictive temperature... |
In this work, we characterize the performance of a deep convolutional neural network designed to detect and quantify chemical elements in experimental X-ray photoelectron spectroscopy data. Given the lack of a reliable database in literature, in order to train the neural network we computed a large ($>$100 k) datas... |
We investigate the flat phase of $D$-dimensional crystalline membranes embedded in a $d$-dimensional space and submitted to both metric and curvature quenched disorders using a nonperturbative renormalization group approach. We identify a second order phase transition controlled by a finite-temperature, finite-disorde... |
Various functions of a network of excitable units can be enhanced if the network is in the `critical regime', where excitations are, on average, neither damped nor amplified. An important question is how can such networks self-organize to operate in the critical regime. |
Small world networks interpolate between fully regular and fully random topologies and simultaneously exhibit large local clustering as well as short average path length. Small world topology has therefore been suggested to support network synchronization. |
Random graphs undergo structural phase transitions that are crucial for dynamical processes and cooperative behavior of models defined on graphs. In this work we investigate the impact of a first-order structural transition on the thermodynamics of the Ising model defined on Erdös-Rényi random graphs, as well as on th... |
Using heterogeneous-elasticity theory (HET) and a generalisation of HET theory (GHET), obtained by applying a newly developed procedure for obtaining the continuum limit of the glass's Hessian, we investigate the nature of vibrational excitations, which are present in small systems, which do not allow for low-frequ... |
The set of the fixed points of the Hopfield type network is under investigation. The connection matrix of the network is constructed according to the Hebb rule from the set of memorized patterns which are treated as distorted copies of the standard-vector. |
We compute the complexity (logarithm of the number of TAP states) associated with minima and index-one saddle points of the TAP free energy. Higher-index saddles have smaller complexities. |
We present a mean field solution of the dynamics of a Greenberg-Hastings neural network with both excitatory and inhibitory units. We analyse the dynamical phase transitions that appear in the stationary state as the model parameters are varied. |
The link between the energy surface of bulk systems and their dynamical properties is generally difficult to establish. Using the activation-relaxation technique (ART nouveau), we follow the change in the barrier distribution of a model of amorphous silicon as a function of the degree of relaxation. |
We study the fluctuation-dissipation relations for a three dimensional Ising spin glass in a magnetic field both in the high temperature phase as well as in the low temperature one. In the region of times simulated we have found that our results support a picture of the low temperature phase with broken replica symmet... |
We study the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates suitable for entanglement distillation, teleportation and fault-tolerant quantum computation. We map the error-correction process onto a statistical mechanical random 3-body Is... |
We calculate the effective spatial dimension $d_\text{IR}$ of electron modes at critical points of 3D Anderson models in various universality classes (O,U,S,AIII). The results are equal within errors, and suggest the super-universal value $d_\text{IR} \! |
Based on neutron wide-angle diffraction and small-angle neutron scattering experiments, we show that there is a correlation between the preparational conditions of amorphous ice structures, their microscopic structural properties, the extent of heterogeneities on a mesoscopic spatial scale and the transformation kineti... |
In a recent paper, Tanaka formulated and solved a model of CDMA multiuser demodulation by applying the theory of spin glasses, the replica method in particular. It is shown in the present comment that some of his results can be derived without recourse to the replica method; conclusions from the somewhat tricky replic... |
We introduce the one-dimensional quasireciprocal lattices where the forward hopping amplitudes between nearest neighboring sites $\{ t+t_{jR} \}$ are chosen to be a random permutation of the backward hopping $\{ t+t_{jL} \}$ or vice versa. The values of $\{ t_{jL} \}$ (or $\{t_{jR} \}$) can be periodic, quasiperiodic,... |
We present a many body approach for non-equilibrium behavior and self-generated glassiness in strongly correlated quantum systems. It combines the dynamical mean field theory of equilibrium systems with the replica theory for classical glasses without quenched disorder. |
We study the distribution of phases and of Wigner delay times for a one-dimensional Anderson model with one open channel. Our approach, based on classical Hamiltonian maps, allows us an analytical treatment. |
In this work we solve the dynamics of pattern diluted associative networks, evolving via sequential Glauber update. We derive dynamical equations for the order parameters, that quantify the simultaneous pattern recall of the system, and analyse the nature and stability of the stationary solutions by means of linear st... |
Topological constraint theory has become an increasingly popular tool to predict the compositional dependence of glass properties or pinpoint promising compositions with tailored functionalities. This approach reduces complex disordered networks into simpler mechanical trusses. |
The pairwise maximum entropy model, also known as the Ising model, has been widely used to analyze the collective activity of neurons. However, controversy persists in the literature about seemingly inconsistent findings, whose significance is unclear due to lack of reliable error estimates. |
Finite-width one hidden layer networks with multiple neurons in the readout layer display non-trivial output-output correlations that vanish in the lazy-training infinite-width limit. In this manuscript we leverage recent progress in the proportional limit of Bayesian deep learning (that is the limit where the size of... |
At the critical point in two dimensions, the number of percolation clusters of enclosed area greater than A is proportional to 1/A, with a proportionality constant C that is universal. We show theoretically (based upon Coulomb gas methods), and verify numerically to high precision, that C = 1/(8 sqrt(3) pi) = 0.022972... |
In an isolated single-particle quantum system a spatial disorder can induce Anderson localization. Being a result of interference, this phenomenon is expected to be fragile in the face of dissipation. |
Spike-train responses of single Hodgkin-Huxley (HH) and integrate-and-fire (IF) neurons with and without the refractory period, are calculated and compared. The HH and IF neurons are assumed to receive spike-train inputs with the constant interspike intervals (ISIs) and stochastic ISIs given by the Gamma distribution,... |
We characterize the phase diagram of anisotropic Heisenberg spin glasses, finding both the spin and the chiral glass transition. We remark the presence of strong finite-size effects on the chiral sector. |
We study the zero-temperature relaxation dynamics of an electron glass model with single-electron hops. We find numerically that in the charge rearrangements (avalanches) triggered by displacing an electron, the number of electron hops has a scale-free, power-law distribution up to a cutoff diverging with the system s... |
Our recent study elucidate that information of density of states in configuration space (CDOS) for non-interacting system, characterized by spatial constraint on the system, plays essential role to determine thermodynamically equilibrium properties for interacting systems. Particularly for disordered states, variance ... |
We show that the common local Monte Carlo rules used to simulate the motion of driven flux lines in disordered media cannot capture the interplay between elasticity and disorder which lies at the heart of these systems. We therefore discuss a class of generalized Monte Carlo algorithms where an arbitrary number of lin... |
The two-parameter dynamical replica theory (2-DRT) is applied to investigate retrieval properties of non-monotonic associative memory, a model which lacks thermodynamic potential functions. 2-DRT reproduces dynamical properties of the model quite well, including the capacity and basin of attraction. |
The investigations carried out in this paper show the influence of cutoff dipole interaction radius and dilution on the basic thermodynamic characteristics of the kagome artificial spin ice with free boundary conditions. The phase transition disappearance at the dipole interaction radius limitation was shown in our pr... |
We have measured the thermal conductivity of glassy glycerol between 1.5 K and 100 K, as well as the specific heat of both glassy and crystalline phases of glycerol between 0.5 K and 25 K. We discuss both low-temperature properties of this typical molecular glass in terms of the soft-potential model. Our finding of an... |
We test a hypothesis for the origin of dynamical heterogeneity in slowly relaxing systems, namely that it emerges from soft (Goldstone) modes associated with a broken continuous symmetry under time reparametrizations. We do this by constructing coarse grained observables and decomposing the fluctuations of these obser... |
Stochastic-Beta-Relaxation (SBR) provides a characterisation of the glass crossover in discontinuous Spin-Glasses and Supercoooled liquid. Notably it can be derived through a rigorous computation from a dynamical Landau theory. |
Among several approaches to tackle the problem of energy consumption in modern computing systems, two solutions are currently investigated: one consists of artificial neural networks (ANNs) based on photonic technologies, the other is a different paradigm compared to ANNs and it is based on random networks of nonlinear... |
The use of parameters measuring order-parameter fluctuations (OPF) has been encouraged by the recent results reported in \cite{RS} which show that two of these parameters, $G$ and $G_c$, take universal values in the $\lim_{T\to 0}$. In this paper we present a detailed study of parameters measuring OPF for two mean-fie... |
The critical dynamics of Ising spin glasses with Bimodal, Gaussian, and Laplacian interaction distributions are studied numerically in dimensions 3 and 4. The data demonstrate that in both dimensions the critical dynamic exponent $z_{\rm c}$, the non-equilibrium autocorrelation decay exponent $\lambda_c/z_{\rm c}$, an... |
An implementation of the Reverse Monte Carlo algorithm is presented for the study of amorphous tetrahedral semiconductors. By taking into account a number of constraints that describe the tetrahedral bonding geometry along with the radial distribution function, we construct a model of amorphous silicon using the rever... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.