All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 7 Next

Displaying 121 – 140 of 298

Showing per page

Geometric influences II: Correlation inequalities and noise sensitivity

Nathan Keller, Elchanan Mossel, Arnab Sen (2014)

Annales de l'I.H.P. Probabilités et statistiques

In a recent paper, we presented a new definition of influences in product spaces of continuous distributions, and showed that analogues of the most fundamental results on discrete influences, such as the KKL theorem, hold for the new definition in Gaussian space. In this paper we prove Gaussian analogues of two of the central applications of influences: Talagrand’s lower bound on the correlation of increasing subsets of the discrete cube, and the Benjamini–Kalai–Schramm (BKS) noise sensitivity theorem....

Giant vacant component left by a random walk in a random d-regular graph

Jiří Černý, Augusto Teixeira, David Windisch (2011)

Annales de l'I.H.P. Probabilités et statistiques

We study the trajectory of a simple random walk on a d-regular graph with d ≥ 3 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these graphs, we investigate percolative properties of the set of vertices not visited by the walk until time un, where u > 0 is a fixed positive parameter. We show that this so-called vacant set exhibits a phase transition in u in the following sense: there...

Global alliances and independence in trees

Mustapha Chellali, Teresa W. Haynes (2007)

Discussiones Mathematicae Graph Theory

A global defensive (respectively, offensive) alliance in a graph G = (V,E) is a set of vertices S ⊆ V with the properties that every vertex in V-S has at least one neighbor in S, and for each vertex v in S (respectively, in V-S) at least half the vertices from the closed neighborhood of v are in S. These alliances are called strong if a strict majority of vertices from the closed neighborhood of v must be in S. For each kind of alliance, the associated parameter is the minimum cardinality of such...

Global domination and neighborhood numbers in Boolean function graph of a graph

T. N. Janakiraman, S. Muthammai, M. Bhanumathi (2005)

Mathematica Bohemica

For any graph G , let V ( G ) and E ( G ) denote the vertex set and the edge set of G respectively. The Boolean function graph B ( G , L ( G ) , N I N C ) of G is a graph with vertex set V ( G ) ∪ E ( G ) and two vertices in B ( G , L ( G ) , N I N C ) are adjacent if and only if they correspond to two adjacent vertices of G , two adjacent edges of G or to a vertex and an edge not incident to it in G . In this paper, global domination number, total global domination number, global point-set domination number and neighborhood number for this graph are obtained.

Going down in (semi)lattices of finite Moore families and convex geometries

Bordalo Gabriela, Caspard Nathalie, Monjardet Bernard (2009)

Czechoslovak Mathematical Journal

In this paper we first study what changes occur in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the semilattice of all convex geometries) defined on a finite set. Then we study the set of all convex geometries which have the same poset of join-irreducible elements. We show that this set—ordered by set inclusion—is a ranked join-semilattice and we...

Currently displaying 121 – 140 of 298